1 Introduction  
2 Basics on Parameterized Algorithms and Complexity  
3 Graph Layout Problems  
4 Minimum Vertex Cover  
5 Maximum Cut  
6 Maximum Bisection  
7 Maximum Independent Sets  
8 Longest Path  
9 Longest Cycle  
10 Traveling Salesperson Problem  
11 Parameterizations Times Multiplicative Guarantees