Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-11269-0_4
+Normal rank
@@ Property / OpenAlex ID @@
+W97328970
@@ Property / OpenAlex ID: W97328970 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+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 @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+Capacitated Domination and Covering: A Parameterized Perspective
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
+Normal rank
@@ Property / cites work @@
+Q4633895
@@ Property / cites work: Q4633895 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
+Normal rank
@@ Property / cites work @@
+Linear Problem Kernels for NP-Hard Problems on Planar Graphs
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+conf/iwpec/BodlaenderLP09
@@ Property / DBLP publication ID: conf/iwpec/BodlaenderLP09 / rank @@
+Normal rank