Paths to Trees and Cacti (Q5283353): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-57586-5_4
+Normal rank
@@ Property / OpenAlex ID @@
+W2606694986
@@ Property / OpenAlex ID: W2606694986 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-contraction problems
@@ Property / cites work: Edge-contraction problems / rank @@
+Normal rank
@@ Property / cites work @@
+A Subexponential Parameterized Algorithm for Proper Interval Completion
+Normal rank
@@ Property / cites work @@
+A Subexponential Parameterized Algorithm for Proper Interval Completion
+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 @@
+Unit interval editing is fixed-parameter tractable
+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 @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+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 @@
+On the threshold of intractability
@@ Property / cites work: On the threshold of intractability / rank @@
+Normal rank
@@ Property / cites work @@
+Q2965491
@@ Property / cites work: Q2965491 / 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 @@
+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 @@
+A faster FPT algorithm for bipartite contraction
@@ Property / cites work: A faster FPT algorithm for bipartite 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 @@
+Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
+Normal rank
@@ Property / cites work @@
+Obtaining a Bipartite Graph by Contracting Few Edges
+Normal rank
@@ Property / cites work @@
+Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT
+Normal rank
@@ Property / cites work @@
+Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
+Normal rank
@@ Property / cites work @@
+On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
+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 @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / 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