Part I: Foundations
1. Introduction to Fixed-Parameter Algorithms
2. Preliminaries and Agreements
3. Parameterized Complexity Theory - A Primer
4. Vertex Cover - An Illustrative Example
5. The Art of Problem Parameterization
6. Summary and Concluding Remarks
Part II: Algorithmic Methods
7. Data Reduction and Problem Kernels
8. Depth-Bounded Search Trees
9. Dynamic Programming
10. Tree Decompositions of Graphs
11. Further Advanced Techniques
12. Summary and Concluding Remarks
Part III: Some Theory, Some Case Studies
13. Parameterized Complexity Theory
14. Connections to Approximation Algorithms
15. Selected Case Studies
16. Zukunftsmusik
References
Index