Parameterized Algorithms
Notes to return to. Ideas to build on.
Course notes
Resources
- Lecture resources
- Reading
- Week 1 · Kernels and fixed-parameter tractability
- Week 2 · Branching and recurrences
- Week 3 · Iterative compression
- Week 4 · Randomization and color coding
- Week 5 · Treewidth and structural decompositions
- Week 6 · Dynamic programming on tree decompositions
- Week 7 · Finding tree decompositions
- Week 8 · Subsets and integer programming
- Week 9 · Important cuts
- Week 10 · Algebraic techniques
- Week 11 · Representative sets in matroids
- Week 12 · Reductions and hardness