The following pages link to Perfect Code is \(W[1]\)-complete (Q1603518):
Displaying 23 items.
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Parameterized complexity of control problems in Maximin election (Q656582) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- Parameterized computational complexity of control problems in voting systems (Q1029347) (← links)
- Multi-attribute proportional representation (Q1731837) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties. (Q1853579) (← links)
- The Turing way to parameterized complexity (Q1877697) (← links)
- Perfect codes in direct graph bundles (Q2346568) (← links)
- The parameterized complexity of unique coverage and its variants (Q2392923) (← links)
- Parameterized counting problems (Q2576944) (← links)
- Parameterized Complexity in Multiple-Interval Graphs: Domination (Q2891335) (← links)
- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (Q3506940) (← links)
- Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements (Q5136256) (← links)
- Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055) (← links)
- Perfect domination and small cycles (Q5367522) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- The clever shopper problem (Q5919456) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- Parameterized complexity of minimum membership dominating set (Q6090540) (← links)
