A Purely Democratic Characterization of W[1]

DOI10.1007/978-3-540-79723-4_11zbMath1142.68359OpenAlexW1561911436WikidataQ57359854 ScholiaQ57359854MaRDI QIDQ3503582

Moritz Müller, Michael R. Fellows, Frances A. Rosamond, Danny Hermelin

Publication date: 5 June 2008

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79723-4_11

Mathematics Subject Classification ID

Cites Work

• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Parametrized complexity theory.
• Parameterized Complexity of Independence and Domination on Geometric Graphs
• Algorithms and Data Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Purely Democratic Characterization of W[1]