This is a three-part lecture taught by Cornelius Brand, Andreas Feldmann and myself.

Topics will be roughly:

1. Parameterized algorithms for integer programming and their applications in scheduling. (Martin)
2. Hard graph problems (e.g., longest path, longest cycle) via algebraic methods; this will be an elementary exposition, so everyone is wellcome. (Cornelius)
3. Parameterized approximation (i.e., how to deal with problems which are hard to approximate and do not admit fixed-parameter algorithms), in particular for network design. (Andreas)