Theoretical Computer Science Group
We value the joy of algorithmic thinking and excellence in research and teaching.
- Holger DellProfessor
- Claudia GresslerSecretary
- Anselm HaakPostdoc
- Leo KrullPhD Student
- Melvin KallmayerResearch Assistant
We study theoretical computer science, broadly understood. Our areas of interest include complexity theory, algebraic graph algorithms, dynamic algorithms, graph neural networks, logics, integer linear programming, and combinatorics. Read more…
Learning Activities in Winter 2022/23
Apply by September 1, 2022 to work on a thesis or research project in the winter term of 2022/23.
- The 82th Workshop on Algorithms and Complexity (Theorietag) took place on June 8-9, 2022 in Frankfurt.