On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414): Difference between revisions

@@ label / en / label / en @@
+On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
@@ Property / full work available at URL @@
+https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.51
+Normal rank
@@ Property / OpenAlex ID @@
+W3081802581
@@ Property / OpenAlex ID: W3081802581 / rank @@
+Normal rank
@@ Property / title @@
+On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (English)
+Normal rank
@@ Property / cites work @@
+Q4636602
@@ Property / cites work: Q4636602 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-contraction problems
@@ Property / cites work: Edge-contraction problems / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time approximation algorithm for the weighted vertex cover problem
+Normal rank
@@ Property / cites work @@
+A Subexponential Parameterized Algorithm for Proper Interval Completion
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithm for I             <scp>nterval</scp>             C             <scp>ompletion</scp>
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Contracting Few Edges to Remove Forbidden Induced Subgraphs
+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 @@
+Interval Deletion Is Fixed-Parameter Tractable
@@ Property / cites work: Interval Deletion 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 @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the threshold of intractability
@@ Property / cites work: On the threshold of intractability / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring the Subexponential Complexity of Completion Problems
+Normal rank
@@ Property / cites work @@
+A polynomial kernel for trivially perfect editing
@@ Property / cites work: A polynomial kernel for trivially perfect editing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3304124
@@ Property / cites work: Q3304124 / rank @@
+Normal rank
@@ Property / cites work @@
+Lossy Kernels for Hitting Subgraphs
@@ Property / cites work: Lossy Kernels for Hitting Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Lossy Kernels for Connected Dominating Set on Sparse Graphs
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds for parameterized complexity of cluster editing with a small number of clusters
+Normal rank
@@ Property / cites work @@
+Kernelization
@@ Property / cites work: Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithm for Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithms for deletion to split graphs
+Normal rank
@@ Property / cites work @@
+Obtaining planarity by contracting few edges
@@ Property / cites work: Obtaining planarity by contracting few edges / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A faster FPT algorithm for bipartite contraction
@@ Property / cites work: A faster FPT algorithm for bipartite contraction / rank @@
+Normal rank
@@ Property / cites work @@
+Obtaining split graphs by edge contraction
@@ Property / cites work: Obtaining split graphs by edge contraction / rank @@
+Normal rank
@@ Property / cites work @@
+Contracting graphs to paths and trees
@@ Property / cites work: Contracting graphs to paths and trees / rank @@
+Normal rank
@@ Property / cites work @@
+Obtaining a Bipartite Graph by Contracting Few Edges
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of approximating dominating set
+Normal rank
@@ Property / cites work @@
+Revisiting connected vertex cover: FPT algorithms and lossy kernels
+Normal rank
@@ Property / cites work @@
+Lossy Kernels for Graph Contraction Problems
@@ Property / cites work: Lossy Kernels for Graph Contraction Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
+Normal rank
@@ Property / cites work @@
+Lossy kernelization
@@ Property / cites work: Lossy kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5075825
@@ Property / cites work: Q5075825 / rank @@
+Normal rank
@@ Property / cites work @@
+On the removal of forbidden graphs by edge-deletion or by edge- contraction
+Normal rank
@@ Property / cites work @@
+On the NP-hardness of edge-deletion and -contraction problems
+Normal rank