Theoretical Computer Science Group

We value the joy of algorithmic thinking and excellence in research and teaching.

The group is part of the Computer Science Department at Goethe-Universität Frankfurt.

Members

• 
  Holger Dell
  Professor
• 
  Claudia Gressler
  Secretary
• 
  Anselm Haak
  Postdoc
• 
  Leo Krull
  PhD Student
• 
  Melvin Kallmayer
  Research Assistant

Research

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

Seminar:
Graph Homomorphisms

Thesis:
Apply by September 1, 2022 to work on a thesis or research project in the winter term of 2022/23.

Past Events

• The 82th Workshop on Algorithms and Complexity (Theorietag) took place on June 8-9, 2022 in Frankfurt.