Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675): Difference between revisions

@@ Property / cites work @@
+Geometric separation and exact solutions for the parameterized independent set problem on disk 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 @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Dominating Sets in Chordal Graphs
@@ Property / cites work: Dominating Sets in Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear FPT reductions and computational lower bounds
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Independence and Domination on Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. IV: Tree-width and well-quasi-ordering
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank