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

Events

The 82th Workshop on Algorithms and Complexity (Theorietag) will take place on 08.-09.06.2022 in Frankfurt. More information can be found here.

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 Summer 2022

Course:
Complexity Theory

Seminar:
Current Topics in Theoretical Computer Science: Graph kernels

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

Related research groups

In Frankfurt, we have close connections to these research groups:

• Algorithms, Dynamics, and Information Flow in Networks (DFG research unit)
• Algorithm Engineering (research group)
• Algorithms & Complexity (research group)
• Discrete Mathematics (group of research groups)

Beyond Frankfurt, we have strong links with

• Basic Algorithms Research Copenhagen (BARC) (Copenhagen)
• Max Planck Institute Computer Science (Saarbrücken)