How to design algorithms for hard problems with running time exponential only in some small parameter of the problem much smaller than the input size? How to show that probably some problems do not admit such algorithms? Design paradigms: treewidth, iterative compression, color coding. Complexity concepts: fixed parameter tractability, W-hierarchy. Problems: Independent Set, Dominating Set, Steiner Tree, and many more...