Nonconstructive advances in polynomial-time complexity
Information Processing Letters
Nonconstructive tools for proving polynomial-time decidability
Journal of the ACM (JACM)
On search decision and the efficiency of polynomial-time algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Graph minors. IV. Tree-width and well-quasi-ordering
Journal of Combinatorial Theory Series B
On well-partial-order theory and its application to combinatorial problems of VLSI design
SIAM Journal on Discrete Mathematics
The vertex separation number of a graph equals its path-width
Information Processing Letters
Obstruction set isolation for the gate matrix layout problem
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Exact and Approximate Solutions for the Gate Matrix Layout Problem
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |
Many of the foundational parameterized tenets discussed in this festschrift actually predate by over a decade the first systematic treatments of fixed-parameter tractability. In this frank, firsthand account I will, to the best of my recollection, describe some of the earliest research avenues Mike Fellows and I pursued that would turn out later to be highly relevant to parameterized complexity. Although we did not know it at the time, these were the origins and formative years of this burgeoning new field. Readers unfamiliar with the history of fixed-parameter tractability may be surprised to learn that its initial motivations arose from, of all things, automation and optimization for integrated circuit design.