The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-012-9681-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2083586074
@@ Property / OpenAlex ID: W2083586074 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time data reduction for dominating set
@@ Property / cites work: Polynomial-time data reduction for dominating set / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On Problems without Polynomial Kernels (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel bounds for disjoint cycles and disjoint paths
+Normal rank
@@ Property / cites work @@
+Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
+Normal rank
@@ Property / cites work @@
+Domination Problems in Nowhere-Dense Classes
@@ Property / cites work: Domination Problems in Nowhere-Dense Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Incompressibility through Colors and IDs
@@ Property / cites work: Incompressibility through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+The steiner problem in graphs
@@ Property / cites work: The steiner problem in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549693
@@ Property / cites work: Q3549693 / rank @@
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity for Domination Problems on Degenerate Graphs
+Normal rank
@@ Property / cites work @@
+Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
+Normal rank
@@ Property / cites work @@
+Domination When the Stars Are Out
@@ Property / cites work: Domination When the Stars Are Out / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Kernel for Planar Connected Dominating Set
@@ Property / cites work: Linear Kernel for Planar Connected Dominating Set / rank @@
+Normal rank
@@ Property / cites work @@
+A linear kernel for a planar connected dominating set
+Normal rank
@@ Property / cites work @@
+An Improved Kernel for Planar Connected Dominating Set
+Normal rank
@@ Property / cites work @@
+Q2908840
@@ Property / cites work: Q2908840 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
+Normal rank
@@ Property / cites work @@
+Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank
@@ Property / cites work @@
+Graph minors. VIII: A Kuratowski theorem for general surfaces
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+A simpler proof of the excluded minor theorem for higher surfaces
+Normal rank