Our core field of expertise is Theoretical Computer Science with a focus on topics related to algorithms and complexity. We mostly deal with discrete combinatorial problems with applications in fields such as network analysis (biological, social, technical,...), pattern matching, and social choice. Central courses taught include

• Algorithmics / Foundations of Algorithmics;
• Computational Complexity Theory;
• Parameterized Algorithms;
• Randomized Algorithms;
• Seminars on current research topics;

and basic theory classes and seminars in the first two bachelor years.

This summer term, we offer several classes and seminars:

For Bachelor students:

• Grundlagen der Algorithmik
  
• Programmierpraktikum: Wettbewerbsorientierte Algorithmik
• Aktuelle Themen der Algorithmik

For Master students:

• Computational Complexity
• Algorithmics for Discrete Data Science

For anyone interested in theoretical computer science:

• Algorithmik und Komplexitätstheorie (research colloquium)