Vertex Deletion Problems on Chordal Graphs (Q5136314): Difference between revisions

@@ label / en / label / en @@
+Vertex Deletion Problems on Chordal Graphs
@@ Property / cites work @@
+Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
+Normal rank
@@ Property / cites work @@
+New classes of perfect graphs
@@ Property / cites work: New classes of perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating sets for split and bipartite graphs
@@ Property / cites work: Dominating sets for split and bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Largest Chordal and Interval Subgraphs Faster Than 2 n
+Normal rank
@@ Property / cites work @@
+Q4942616
@@ Property / cites work: Q4942616 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Linear Recognition of Almost Interval Graphs
@@ Property / cites work: Linear Recognition of Almost Interval Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Unit interval editing is fixed-parameter tractable
+Normal rank
@@ Property / cites work @@
+Chordal Editing is Fixed-Parameter Tractable
@@ Property / cites work: Chordal Editing is Fixed-Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal editing is fixed-parameter tractable
@@ Property / cites work: Chordal editing is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Q4165164
@@ Property / cites work: Q4165164 / rank @@
+Normal rank
@@ Property / cites work @@
+\textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On split-coloring problems
@@ Property / cites work: On split-coloring problems / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms via Monotone Local Search
@@ Property / cites work: Exact Algorithms via Monotone Local Search / rank @@
+Normal rank
@@ Property / cites work @@
+Large Induced Subgraphs via Triangulations and CMSO
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Trivially perfect graphs
@@ Property / cites work: Trivially perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the pathwidth of chordal graphs
@@ Property / cites work: On the pathwidth of chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3271426
@@ Property / cites work: Q3271426 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Kernelization for Chordal Vertex Deletion
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+HAMILTONian circuits in chordal bipartite graphs
@@ Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Measuring Indifference: Unit Interval Vertex Deletion
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum k-colorable subgraph problem for chordal graphs
+Normal rank
@@ Property / cites work @@
+Approximate association via dissociation
@@ Property / cites work: Approximate association via dissociation / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.4230/LIPIcs.FSTTCS.2017.22
+Normal rank
@@ Property / OpenAlex ID @@
+W2885933347
@@ Property / OpenAlex ID: W2885933347 / rank @@
+Normal rank
@@ Property / title @@
+Vertex Deletion Problems on Chordal Graphs (English)
@@ Property / title: Vertex Deletion Problems on Chordal Graphs (English) / rank @@
+Normal rank