Welcome to the Chair of Algorithm Engineering

Prof. Dr. Ulrich Meyer
Institute for Computer Science
Goethe-Universität Frankfurt

Robert-Mayer-Straße 11-15
60325 Frankfurt am Main

Claudia Gressler
Room 314
Tel: +49-69-798-28325
Fax: +49-69-798-28814
Email: sekretariat@ae.cs.uni-frankfurt.de
Office Hours:
During lockdown: Home office only
Mo, Mi, Do 10-12 und 14-16
Di 10-12 und 15-16


March 14, 2020

ESA Test of Time Award

Ulrich Meyer (together with Peter Sanders from KIT) will be awarded the Test-of-Time Award of the European Symposium on Algorithms 2019 (ESA) at ESA 2020.
ESA is the premier European conference on algorithms research. The ESA Test-of-Time Award (ToTA) recognizes excellent papers in algorithms research that were published in the ESA proceedings 19 to 21 years ago which are still influential and stimulating for the field today. For 2019, the Award Committee selected

  • Ulrich Meyer, Peter Sanders
    Delta-Stepping: A Parallel Single Source Shortest Path Algorithm.
    Proceedings of ESA 1998, pp. 393-404. Link
    The full version appeared in J. Algorithms 49(1): 114-152 (2003) Link
March 03, 2020

SPP Spring School on Algorithms for Big Data

We successfully coorganized and ran the 3rd Indo-German Spring School on Algorithms for Big Data. It took place at IIIT Delhi and SNU during Feb 10th-13 2020.
Information on speakers and programme be found on the webpage of the school. There is also a report with pictures on the webpage of the DFG Office India.

February 09, 2020

STOC 2020 Submission accepted

Group member Annamaria Kovacs coauthored a paper on the Nisan-Ronen conjecture for submodular valuations which was accepted for presentation at STOC 2020.
A preliminary version can be found at arXiv.

September 10, 2019

Two Best Paper Awards at ESA 2019

Group members Manuel Penschuck and Ulrich Meyer coauthored two best papers at ESA 2019:
- On the Fragile Complexity of Comparison-Based Algorithms (Best Paper in Track A)
- On Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs (Best Paper in Track B)