Algorithm Engineering for Dynamic Graph Optimization Problems in Concrete Applications

Prof. Matthias Müller-Hannemann; Martin-Luther-Universität Halle-Wittenberg;

Prof. Dr. Karsten Weihe; Technische Universität Darmstadt

Algorithm Engineering for Efficient Genome Comparison

Prof. Dr. Knut Reinert; Freie Universität Berlin

Algorithm Engineering for MONET and related covering problems

Prof. Dr. Martin Mundhenk; University of Jena

Algorithm Engineering for Randomized Rounding Procedures

Prof. Dr. Benjamin Doerr; Max-Planck-Institut für Informatik, Saarbrücken

Algorithm Engineering for the Basic Toolbox

Prof. Dr. Peter Sanders; Karlsruhe Institute of Technology

Algorithm Engineering for Network Problems

Prof. Dr. Susanne Albers; Albert-Ludwigs-Universität Freiburg

Algorithm Engineering for Problems in Computer Graphics

Prof. Dr. math. Friedhelm Meyer auf der Heide

Dr. rer. nat. Matthias Fischer; Universität Paderborn

Algorithm Engineering for Real-time Scheduling and Routing

Prof. Dr. Friedrich Eisenbrand; École Polytechnique Fédérale de Lausanne
Prof. Dr. Martin Skutella; Technische Unversität Berlin

Algorithms for Complex Scheduling Problems

Prof. Dr. Rolf H. Möhring; Technische Universität Berlin

Algorithms for Modern Hardware: Flash Memory

Prof. Dr. Ulrich Meyer; Universität Frankfurt

Clustering of Static and Temporal Graphs

Prof. Dr. Dorothea Wagner; Karlsruhe Institute of Technology

Design and Analysis of Application-Oriented Geometric Algorithms

Prof. Dr. Helmut Alt; Freie Universität Berlin

Prof. Dr. Christian Knauer; Universität Bayreuth

Disturbed Diffusion for Partitioning and Clustering Graphs

Prof. Dr. Burkhard Monien; Universität Paderborn

Engineering of Approximation Algorithms for Matching and Covering in Hypergraphs and Large Graphs

Prof. Dr. rer. nat. Anand Srivastav; Christian-Albrechts-Universität Kiel

Exact Integer Programming

Prof. Dr. Dr. h. c. Martin Grötschel; Zuse Institut Berlin


External Goal-Directed Search in Implicit Graphs

PD Dr. Stefan Edelkamp; Universität Dortmund

Efficient Search in Very Large Collections of Text, Databases and Ontologies

Prof. Dr. Hannah Bast; Universität Freiburg

Generic Decomposition Algorithms for Integer Programs

Prof. Dr. Marco Lübbecke; RWTH Aachen University

Kunst! - Exact Algorithms for Art Gallery Variants

Dr. Alexander Kröller; Braunschweig Institute of Technology

Planarization Approaches in Automatic Graph Drawing

Prof. Dr. Michael Jünger; Universität zu Köln
Prof. Dr. Petra Mutzel; Universität Dortmund

Practical Approximate Pattern Matching with Index Structures

Prof. Dr. Ernst W. Mayr, Technische Universität München

Practical theory for clustering algorithms

Prof. Dr. rer. nat. Johannes Blömer, Universität Paderborn

Prof. Dr. rer. nat. Christian Sohler, TU Dortmund

Representation Solving
Prof. Dr. Alexander May, Ruhr Universität Bochum

RoboRithmics: Algorithmical and Technical Methods for Controlling an Autonomous Exploration Robot

Prof. Dr. Sándor Fekete; TU Braunschweig

Robust Optimization Algorithms

Prof. Dr. Anita Schöbel; Georg-August-Universität Göttingen

Simple and Fast Implementation of Exact Optimization Algorithms with SCIL

Prof. Dr. Ernst Althaus; Universität Mainz

Prof. Dr. Christoph Buchheim; Technische Universität Dortmund

Structure Based Algorithm Engineering for SAT Solving

Prof. Dr. Michael Kaufmann, Prof. Dr. sc. techn. Wolfgang Küchlin; Universität Tübingen


Associated Projects


Modern Hashing: Space- and Time-Efficient Search Structures and Simulation of Randomness using the Multiple Function Paradigm

Prof. Dr. rer. nat. (USA) Martin Dietzfelbinger; Technische Universität Ilmenau


Route Planning in Transportation Networks

Prof. Dr. Dorothea Wagner; Karlsruhe Institute of Technology


Fast and Exact Route Planning

Prof. Dr. Peter Sanders; Karlsruhe Institute of Technology

Algorithm Engineering for High Troughput Sequencing Data

Prof. Dr. Knut Reinert; Freie Universität Berlin


Design of Efficient Polynomial Time Approximation Schemes for Scheduling and Related Optimization Problems

Prof. Dr. Klaus Jansen; University of Kiel


Algorithm Engineering for Graph Partitioning
Prof. Dr. Dorothea Wagner, Prof. Dr. Peter Sanders; Karlsruhe Institute of Technology