Introduction to Parameterized Algorithms 25/26

Tutorials are led by Tung Anh Vu and Martin Koreček. Click here for the website of the tutorials, where you can find materials from the tutorial sessions and instructions on how to solve homework.

• [PA] is the book Parameterized Algorithms.
• [Ker] is the book Kernelization.
• [ND] Algorithmic Meta-theorems for Restrictions of Treewidth: a paper which introduced $nd(G)$ and describes the coloring algorithm
• [NdCol] A note on coloring...: a paper by Martin which retells the coloring algorithm by Lampis and points out that it can be solved more efficiently
• [5M] Integer programming in parameterized complexity: Five miniatures a comprehensive paper about various parameterized integer programming algorithms and their applications to problems on bounded-$nd$ graphs.
• [GR] Polynomiality for Bin Packing with a Constant Number of Item Types