Final Meeting of  the SPP "Algorithm Engineering"

Other pictures can be found at

Efficient algorithms and data structures are a prerequisite for demanding computer applications that work with large data sets on increasingly complex hardware. Algorithmics – the systematic development of efficient algorithms – is therefore decisive for the transfer of technological possibilities into applications with large impact on engineering, economy, science, and our daily life. However, the solution of pending problems is inhibited by a wide gap between the state of knowledge of algorithm theory and the practical application of applications. The goal of algorithm engineering (AE) is to bridge this gap which has widened for decades now. The key for achieving this goal is a wider methodology. At the core of this methodology is a cycle of design, analysis, implementation, and experimental evaluation of practicable algorithms. Realistic models for machines and applications, algorithm libraries, and collections of real world inputs provide additional coupling to applications.


Priority Program "Algorithm Engineering"

The Priority program's  aim is to sustain innovative drive for the application of algorithms by advancing AE, establishing it more widely, and cross-linking AE researchers. The program supports research projects that significantly contribute to bridging the described gaps between theory and practice using AE methodology.
Whithin six years the Priority program "Algorithm Engineering" supported dozens of projects from all over the Germany. The scientific outcome measures in hundreds of publications.


Final Meeting

The Final Meeting is a one day finishing event of the DFG Priority Program "Algorithm Engineering". The meeting is an open forum that gives an opportunity for a scientific community and industrial representatives to get to know the methodology, methods and tools used in algorithm engineering. The program includes talks of selected participants of the priority program and external experts in this field.



Begin: Wednesday September 17, at 09:45 a.m. (registration and coffee from 09:15 a.m.)
End: Wednesday September 17 around 17:00 p.m.

The PhD Students are highly encouraged to participate in the accompanying Summer School on Algorithm Engineering on 18-19 September.


Invited Speakers

Extended Talks

Lars ArgeMadalgo Aarhus University, Danemark

I/O-efficient algorithms for big terrain data analysis

Martin Grötschel, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Germany

Linear and Mixed Integer Optimization Solvers:
 Theoretical, Practical, and Software Engineering Aspects

Paolo Ferragina, University of Pisa, Italy
BiCriteria Data Compression
Dorothea Wagner, Karlsruhe Institute of Technology, Germany
Clustering Evolving Networks
Renato Werneck, Microsoft Research, USA
Building a Real-World Routing Engine

Short Talks

Stefan Edelkamp, University of Bremen, Germany

Traveling Salesmen in Logistics, Games and Robotics

Henning Meyerhenke, Karlsruhe Institute of Technology, Germany

Engineering Parallel Algorithms for Partitioning Problems in Graphs

Matthias Müller-Hannemann, University of Halle-Wittemberg, Germany

Real-Time Optimization Problems in Public Transport

Knut ReinertFreie Universität Berlin, Germany

Algorithm engineering in the SeqAn library



Karlsruhe Institute of Technology
Institute for Theoretical Computer Science

Am Fasanengarten 5
76131 Karlsruhe



Nachrichtentechnik Hörsal, building 30.10, see the location map and the  campus map



Prof. Peter Sanders
Dr. Vitaly Osipov
Anja Blancani



For any information about the meeting, please email:

Vitaly Osipov  This e-mail address is being protected from spambots. You need JavaScript enabled to view it