Q5005171 (Q5005171): Difference between revisions

@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Enumerate and Measure: Improving Parameter Budget Management
+Normal rank
@@ Property / cites work @@
+The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463498
@@ Property / cites work: Q5463498 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal dynamic program for r-domination problems over tree decompositions
+Normal rank
@@ Property / cites work @@
+Improved approximation bounds for edge dominating set in dense graphs
+Normal rank
@@ Property / cites work @@
+Approximation hardness of edge dominating set problems
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for (             <i>k</i>             ,             <i>r</i>             )-center in planar graphs and map graphs
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability and Completeness I: Basic Results
+Normal rank
@@ Property / cites work @@
+Q4850549
@@ Property / cites work: Q4850549 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating <i>k</i>-center in planar graphs
@@ Property / cites work: Approximating <i>k</i>-center in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+edge dominating set: Efficient Enumeration-Based Exact Algorithms
+Normal rank
@@ Property / cites work @@
+On two techniques of combining branching and treewidth
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for the minimum weight edge dominating set problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernels for Edge Dominating Set: Simpler or Smaller
+Normal rank
@@ Property / cites work @@
+On Directed Covering and Domination Problems
@@ Property / cites work: On Directed Covering and Domination Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Some properties of line digraphs
@@ Property / cites work: Some properties of line digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Edge Dominating Sets
@@ Property / cites work: Minimum Edge Dominating Sets / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Algorithm for Parameterized Edge Dominating Set Problem
+Normal rank
@@ Property / cites work @@
+Q5743498
@@ Property / cites work: Q5743498 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2941638
@@ Property / cites work: Q2941638 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of dissociation set problems in graphs
+Normal rank
@@ Property / cites work @@
+Approximating edge dominating set in dense graphs
@@ Property / cites work: Approximating edge dominating set in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New parameterized algorithms for the edge dominating set problem
+Normal rank
@@ Property / cites work @@
+Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
+Normal rank
@@ Property / cites work @@
+A refined exact algorithm for edge dominating set
@@ Property / cites work: A refined exact algorithm for edge dominating set / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge Dominating Sets in Graphs
@@ Property / cites work: Edge Dominating Sets in Graphs / rank @@
+Normal rank