On the parameterized complexity of maximum degree contraction problem (Q832521): Difference between revisions

@@ Property / cites work @@
+On the parameterized complexity of contraction to generalization of trees
+Normal rank
@@ Property / cites work @@
+Path Contraction Faster than $2^n$
@@ Property / cites work: Path Contraction Faster than $2^n$ / rank @@
+Normal rank
@@ Property / cites work @@
+Paths to Trees and Cacti
@@ Property / cites work: Paths to Trees and Cacti / rank @@
+Normal rank
@@ Property / cites work @@
+Split Contraction
@@ Property / cites work: Split Contraction / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-contraction problems
@@ Property / cites work: Edge-contraction problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of three edge contraction problems with degree constraints
+Normal rank
@@ Property / cites work @@
+On bounded-degree vertex deletion parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+Reduction algorithms for graphs of small treewidth
+Normal rank
@@ Property / cites work @@
+Contractibility and NP-completeness
@@ Property / cites work: Contractibility and NP-completeness / rank @@
+Normal rank
@@ Property / cites work @@
+Contracting Few Edges to Remove Forbidden Induced Subgraphs
+Normal rank
@@ Property / cites work @@
+A Linear Kernel for Co-Path/Cycle Packing
@@ Property / cites work: A Linear Kernel for Co-Path/Cycle Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4268437
@@ Property / cites work: Q4268437 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of Nemhauser and Trotter's local optimization theorem
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization
@@ Property / cites work: Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
+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 @@
+Increasing the minimum degree of a graph by contractions
+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 @@
+On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
+Normal rank
@@ Property / cites work @@
+On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Obtaining a Bipartite Graph by Contracting Few Edges
+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 @@
+Isolation concepts for efficiently enumerating dense subgraphs
+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 @@
+An FPT algorithm for contraction to cactus
@@ Property / cites work: An FPT algorithm for contraction to cactus / rank @@
+Normal rank
@@ Property / cites work @@
+Slightly Superexponential Parameterized Problems
@@ Property / cites work: Slightly Superexponential Parameterized 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 @@
+The computational complexity of disconnected cut and \(2 K_2\)-partition
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
+Normal rank
@@ Property / cites work @@
+On the Parameterized Complexity Of Grid Contraction
+Normal rank
@@ Property / cites work @@
+A 4             <i>k</i>             <sup>2</sup>             kernel for feedback vertex set
+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