Q5090486 (Q5090486): Difference between revisions

@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+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 @@
+On Multiway Cut Parameterized above Lower Bounds
@@ Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
+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 @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for the minimum weight edge dominating set problem
+Normal rank
@@ Property / cites work @@
+Raising The Bar For V<scp>ertex</scp> C<scp>over</scp>: Fixed-parameter Tractability Above A Higher Guarantee
+Normal rank
@@ Property / cites work @@
+An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
+Normal rank
@@ Property / cites work @@
+Kernels for Edge Dominating Set: Simpler or Smaller
+Normal rank
@@ Property / cites work @@
+An Improved Algorithm for Parameterized Edge Dominating Set Problem
+Normal rank
@@ Property / cites work @@
+Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
+Normal rank
@@ Property / cites work @@
+On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets
+Normal rank
@@ Property / cites work @@
+Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
+Normal rank
@@ Property / cites work @@
+Edge dominating set and colorings on graphs with fixed clique-width
+Normal rank
@@ Property / cites work @@
+A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
+Normal rank
@@ Property / cites work @@
+Faster Parameterized Algorithms Using Linear Programming
+Normal rank
@@ Property / cites work @@
+Paths, Flowers and Vertex Cover
@@ Property / cites work: Paths, Flowers and Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient exact algorithms through enumerating maximal independent sets and other techniques
+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 @@
+Exact algorithms for edge domination
@@ Property / cites work: Exact algorithms for edge domination / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set
+Normal rank
@@ Property / cites work @@
+Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
+Normal rank
@@ Property / cites work @@
+New parameterized algorithms for the edge dominating set problem
+Normal rank
@@ Property / cites work @@
+Parameterized edge dominating set in graphs with degree bounded by 3
+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 @@
+Edge Dominating Sets in Graphs
@@ Property / cites work: Edge Dominating Sets in Graphs / rank @@
+Normal rank