Fixed-Parameter Tractability, A Prehistory,

DOI10.1007/978-3-642-30891-8_1zbMath1358.68139OpenAlexW148417474MaRDI QIDQ2908528

Michael A. Langston

Publication date: 5 September 2012

Published in: The Multivariate Algorithmic Revolution and Beyond (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30891-8_1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) History of computer science (68-03)

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Nonconstructive advances in polynomial-time complexity
• The vertex separation number of a graph equals its path-width
• Obstruction set isolation for the gate matrix layout problem
• Graph minors. XIII: The disjoint paths problem
• Graph minors. IV: Tree-width and well-quasi-ordering
• Disjoint Paths—A Survey
• Nonconstructive tools for proving polynomial-time decidability
• On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design

This page was built for publication: Fixed-Parameter Tractability, A Prehistory,