Fine-grained Parameterized Algorithms

SoSe 2024



This course introduces you to the exciting areas of parameterized algorithms and fine-grained complexity theory. In these areas, we analyze the complexity of problems in more detail than just “polynomial time” and “NP-hard”. You will discover beautiful algorithmic techniques to develop algorithms that are faster than the naive brute-force approach, and you will learn to prove that certain problems probably do not have faster algorithms.

Organizational Details

Learning goals

After the course, you will be able to


This is a preliminary weekplan. It will be updated as the course progresses.