Short cycles make $W$-hard problems hard: FPT algorithms for $W$-hard problems in graphs with no short cycles (Q958211): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-007-9148-9
@@ Property / DOI: 10.1007/s00453-007-9148-9 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-007-9148-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2030711914
@@ Property / OpenAlex ID: W2030711914 / rank @@
+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 @@
+A refined search tree technique for dominating set on planar graphs
+Normal rank
@@ Property / cites work @@
+On easy and hard hereditary classes of graphs with respect to the independent set problem
+Normal rank
@@ Property / cites work @@
+Boundary classes of graphs for the dominating set problem
+Normal rank
@@ Property / cites work @@
+Computing small partial coverings
@@ Property / cites work: Computing small partial coverings / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold dominating sets and an improved characterization of \(W[2]\)
+Normal rank
@@ Property / cites work @@
+The Parametrized Complexity of Some Fundamental Problems in Coding Theory
+Normal rank
@@ Property / cites work @@
+The complexity of irredundant sets parameterized by size
+Normal rank
@@ Property / cites work @@
+Q4526990
@@ Property / cites work: Q4526990 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+SOFSEM 2005: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+On the ratio of optimal integral and fractional covers
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangles, 4-Cycles and Parameterized (In-)Tractability
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-007-9148-9
@@ Property / DOI: 10.1007/S00453-007-9148-9 / rank @@
+Normal rank

Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211): Difference between revisions

Latest revision as of 09:59, 10 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)