Perfect Code is \(W[1]\)-complete (Q1603518): Difference between revisions

@@ Property / cites work @@
+On the parameterized complexity of short computation and factorization
+Normal rank
@@ Property / cites work @@
+The Turing way to parameterized complexity
@@ Property / cites work: The Turing way to parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Computation Models for Parameterized Complexity
@@ Property / cites work: Computation Models for Parameterized Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability and Completeness I: Basic Results
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+Threshold dominating sets and an improved characterization of \(W[2]\)
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501141
@@ Property / cites work: Q4501141 / rank @@
+Normal rank