Fixed-parameter tractability, a prehistory

DOI10.1007/978-3-642-30891-8_1zbMATH Open1358.68139OpenAlexW148417474MaRDI QIDQ2908528FDOQ2908528

Authors: 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

Recommendations

• The birth and early years of parameterized complexity
• A basic parameterized complexity primer
• Vertex cover, dominating set and my encounters with parameterized complexity and Mike Fellows
• Mathematical Foundations of Computer Science 2004
• scientific article; zbMATH DE number 2080999

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Title not available (Why is that?)
• About one characteristic initial value problem with prehistory and its investigation

This page was built for publication: Fixed-parameter tractability, a prehistory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908528)