On the Complexity Landscape of the Domination Chain (Q2795935): Difference between revisions

@@ Property / cites work @@
+Approximation Algorithms Inspired by Kernelization Methods
+Normal rank
@@ 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 @@
+Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
+Normal rank
@@ Property / cites work @@
+Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Upper Domination: A Parameterised Perspective
+Normal rank
@@ Property / cites work @@
+Computing the differential of a graph: hardness, approximability and exact algorithms
+Normal rank
@@ Property / cites work @@
+Combinatorics for smaller kernels: the differential of a graph
+Normal rank
@@ Property / cites work @@
+The differential and the roman domination number of a graph
+Normal rank
@@ Property / cites work @@
+Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
+Normal rank
@@ Property / cites work @@
+Graph-theoretic parameters concerning domination, independence, and irredundance
+Normal rank
@@ Property / cites work @@
+On the max min vertex cover Problem
@@ Property / cites work: On the max min vertex cover Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for min independent dominating set
+Normal rank
@@ Property / cites work @@
+A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
+Normal rank
@@ Property / cites work @@
+A Roman domination chain
@@ Property / cites work: A Roman domination chain / rank @@
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Improved non-approximability results for minimum vertex cover with density constraints
+Normal rank
@@ Property / cites work @@
+Q4211755
@@ Property / cites work: Q4211755 / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of Hereditary Hypergraphs and Middle Graphs
+Normal rank
@@ Property / cites work @@
+Irredundance and Maximum Degree in Graphs
@@ Property / cites work: Irredundance and Maximum Degree in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+SOFSEM 2006: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Q4027320
@@ Property / cites work: Q4027320 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of irredundant sets parameterized by size
+Normal rank
@@ Property / cites work @@
+Stability, domination and irredundance in a graph
@@ Property / cites work: Stability, domination and irredundance in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Clean the graph before you draw it!
@@ Property / cites work: Clean the graph before you draw it! / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the minimum maximal independence number
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Inequalities relating domination parameters in cubic graphs
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for Dominating Set Analyzed by the Potential Method
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+On the algorithmic complexity of twelve covering and independence parameters of graphs
+Normal rank
@@ Property / cites work @@
+On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
+Normal rank
@@ Property / cites work @@
+Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q4818795
@@ Property / cites work: Q4818795 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Maximum Independent Set
@@ Property / cites work: Exact Algorithms for Maximum Independent Set / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank
@@ Property / cites work @@
+The domination parameters of cubic graphs
@@ Property / cites work: The domination parameters of cubic graphs / rank @@
+Normal rank