Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Threshold dominating sets and an improved characterization of W[2]
Theoretical Computer Science
Information Processing Letters
Intervalizing k-Colored Graphs
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Parameterized Complexity
Chordless paths through three vertices
Theoretical Computer Science - Parameterized and exact computation
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
The complexity of fixed-parameter problems: guest column
ACM SIGACT News
Facility Location Problems: A Parameterized View
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
ROMAN DOMINATION: a parameterized perspective
International Journal of Computer Mathematics
Vertex and edge covers with clustering properties: Complexity and algorithms
Journal of Discrete Algorithms
The Complexity of Probabilistic Lobbying
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Facility location problems: A parameterized view
Discrete Applied Mathematics
The parameterized complexity of local consistency
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Roman domination: a parameterized perspective
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Campaigns for lazy voters: truncated ballots
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
The robust set problem: parameterized complexity and approximation
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We propose a general proof technique based on the Turing machine halting problem that allows us to establish membership results for the classes W[1], W[2], and W[P]. Using this technique, we prove that Perfect Code belongs to W[1], Steiner Tree belongs to W[2], and α-Balanced Separator, Maximal Irredundant Set, and Bounded DFA Intersection belong to W[P].