Program

 

 

Monday
09:45 Peter Sanders
Introduction and Organization
10:10 Pino Italiano
Algorithm Engineering – A Personal and Historical Perspective
10:55 Coffee Break
11:15 Stephan Kottler
Structure-Based Algorithm Engineering for SAT Solving
11:40 Ulrich Meyer
Algorithms for Modern Hardware: Flash Memory
12:05 Peter Sanders
Algorithm Engineering for the Basic Toolbox
12:30 Lunch Break
14:20 Kati Wolter
Exact Integer Programming
14:45 Ernst Althaus
Simple and Fast Implementation of Exact Optimization Algorithms with SCIL
15:10 Benjamin Dörr
Algorithm Engineering for Developing Methods in Randomized Rounding
15:35 Anand Srivastav
Engineering of Randomized Algorithms for Optimization Problems in Hypergraphs
16:00 Coffee Break
16:30 Christiane Schmidt
RoboRithmics: Algorithmical and Technical Methods for Controlling an Autonomous Exploration Robot
16:55 Matthias Müller-Hannemann
Algorithm Engineering for Dynamic Graph Optimization Problems in Concrete Applications
17:20 Johannes Nowak
Use-Oriented Index Structures for Approximate Pattern Matching
17:45 Holger Bast
Efficient Search in Very Large Collections of Text, Databases and Ontologies
19:30 Dinner

Tuesday

09:00 Lutz Kettner
Software in Geometry
09:45 Wiebke Höhn
Algorithms for Complex Scheduling Problems
10:10 Britta Peis
Algorithm Engineering for Real-Time Scheduling and Routing
10:35 Coffee Break
10:55 Petra Mutzel
Planarization Practices in Automatic Graph Drawing
11:20 Helmut Alt
Design and Analysis of Use-Oriented Geometric Algorithms
11:45 Martin Ziegler
Algorithm Engineering for Problems in Computer Graphics
12:10 Lunch Break
14:00 Christian Sohler
Engineering Clustering Algorithms
14:25 Henning Meyerhenke
Disturbed Diffusion for Partitioning and Clustering Graphs
14:50 Dorothea Wagner
Clustering of Static and Temporal Graphs
15:15 Coffee Break
15:35 Tobias Jacobs
Algorithm Engineering for Network Problems
16:00 Stefan Edelkamp
External Goal-Directed Search in Implicit Graphs
16:25 Discussion Session