Skip to content
Parameterized Algorithms

Resources

Slide decks and supporting material for the course.

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