Abstract is missing.
- Fixed-Parameter Tractability, A Prehistory, Michael A. Langston. 3-16 [doi]
- The Birth and Early Years of Parameterized ComplexityRod Downey. 17-38 [doi]
- Crypto Galore!Neal Koblitz. 39-50 [doi]
- Flyby: Life Before, During, and After Graduate Studies with Mike FellowsTodd Wareham. 51-55 [doi]
- The Impact of Parameterized Complexity to Interdisciplinary Problem SolvingUlrike Stege. 56-68 [doi]
- Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike FellowsVenkatesh Raman. 69-73 [doi]
- Mike Fellows: Weaving the Web of Mathematics and AdventureJan Arne Telle. 74-79 [doi]
- Passion Plays: Melodramas about MathematicsFrances A. Rosamond. 80-87 [doi]
- A Basic Parameterized Complexity PrimerRod Downey. 91-128 [doi]
- Kernelization - Preprocessing with a GuaranteeDaniel Lokshtanov, Neeldhara Misra, Saket Saurabh. 129-161 [doi]
- Parameterized Complexity and Subexponential-Time ComputabilityJianer Chen, Iyad A. Kanj. 162-195 [doi]
- Fixed-Parameter Tractability of Treewidth and PathwidthHans L. Bodlaender. 196-227 [doi]
- Graph Minors and Parameterized Algorithm DesignDimitrios M. Thilikos. 228-256 [doi]
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A SurveyGregory Gutin, Anders Yeo. 257-286 [doi]
- Backdoors to SatisfactionSerge Gaspers, Stefan Szeider. 287-317 [doi]
- Studies in Computational Aspects of Voting - A Parameterized Complexity PerspectiveNadja Betzler, Robert Bredereck, Jiehua Chen, Rolf Niedermeier. 318-363 [doi]
- A Parameterized Halting ProblemYijia Chen, Jörg Flum. 364-397 [doi]
- Computer Science Unplugged and Related Projects in Math and Computer Science PopularizationTim Bell, Frances A. Rosamond, Nancy Casey. 398-456 [doi]
- FPT Suspects and Tough Customers: Open Problems of Downey and FellowsFedor V. Fomin, Dániel Marx. 457-468 [doi]
- What's Next? Future Directions in Parameterized ComplexityDániel Marx. 469-496 [doi]