Approximation and Kernelization for Chordal Vertex Deletion (Q4586151): Difference between revisions

@@ Property / cites work @@
+O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
+Normal rank
@@ Property / cites work @@
+Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
+Normal rank
@@ Property / cites work @@
+A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
+Normal rank
@@ Property / cites work @@
+A unified approach to approximating resource allocation and scheduling
+Normal rank
@@ Property / cites work @@
+Recognizing tough graphs is NP-hard
@@ Property / cites work: Recognizing tough graphs is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
+Normal rank
@@ Property / cites work @@
+A Subexponential Parameterized Algorithm for Proper Interval Completion
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithm for Interval Completion
+Normal rank
@@ Property / cites work @@
+On Linear Time Minor Tests with Depth-First Search
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+A cubic kernel for feedback vertex set and loop cutset
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+A characterisation of rigid circuit graphs
@@ Property / cites work: A characterisation of rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
+Normal rank
@@ Property / cites work @@
+Nondeterminism within $P^ *  $
@@ Property / cites work: Nondeterminism within $P^ * $ / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of vertex colouring
@@ Property / cites work: Parameterized complexity of vertex colouring / rank @@
+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 @@
+Chordal editing is fixed-parameter tractable
@@ Property / cites work: Chordal editing is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Interval Deletion Is Fixed-Parameter Tractable
@@ Property / cites work: Interval Deletion Is Fixed-Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Exploring the Subexponential Complexity of Completion Problems
+Normal rank
@@ Property / cites work @@
+On Independent Circuits Contained in a Graph
@@ Property / cites work: On Independent Circuits Contained in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+On diameters and radii of bridged graphs
@@ Property / cites work: On diameters and radii of bridged graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Minimum Weight Vertex Separators
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Preprocessing subgraph and minor problems: when does a small vertex cover help?
+Normal rank
@@ Property / cites work @@
+A Polynomial Kernel for Proper Interval Vertex Deletion
+Normal rank
@@ Property / cites work @@
+Kernelization using structural parameters on sparse graph classes
+Normal rank
@@ Property / cites work @@
+Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
+Normal rank
@@ Property / cites work @@
+Multiway cuts in node weighted graphs
@@ Property / cites work: Multiway cuts in node weighted graphs / 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 @@
+Uniform Kernelization Complexity of Hitting Forbidden Minors
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Chordal Graphs
@@ Property / cites work: A Separator Theorem for Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471328
@@ Property / cites work: Q4471328 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of vertex deletion into perfect graph classes
+Normal rank
@@ Property / cites work @@
+The k-Disjoint Paths Problem on Chordal Graphs
@@ Property / cites work: The k-Disjoint Paths Problem on Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Unit interval vertex deletion: fewer vertices are relevant
+Normal rank
@@ Property / cites work @@
+A polynomial kernel for distance-hereditary vertex deletion
+Normal rank
@@ Property / cites work @@
+Erd\H{o}s-P\'osa property of chordless cycles and its applications
+Normal rank
@@ Property / cites work @@
+Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
+Normal rank
@@ Property / cites work @@
+Q4967164
@@ Property / cites work: Q4967164 / rank @@
+Normal rank
@@ Property / cites work @@
+Compression via Matroids
@@ Property / cites work: Compression via Matroids / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Kernelization – Preprocessing with a Guarantee
@@ Property / cites work: Kernelization – Preprocessing with a Guarantee / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal Deletion Is Fixed-Parameter Tractable
@@ Property / cites work: Chordal Deletion Is Fixed-Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal deletion is fixed-parameter tractable
@@ Property / cites work: Chordal deletion is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Q5683627
@@ Property / cites work: Q5683627 / rank @@
+Normal rank
@@ Property / cites work @@
+A 4             <i>k</i>             <sup>2</sup>             kernel for feedback vertex set
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / cites work @@
+Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
+Normal rank