Monday 
9.3011.00 
Short presentation of the following projects (plenary) 

Algorithm Engineering for RealTime Scheduling and Routing 

RoboRithmics: algorithmic and technical methods for controlling an autonomousexploration robot 

StructureBased Algorithm Engineering for SAT Solving 

Planarization Practices in Automatic Graph Drawing 

UseOriented Index Structures for Approximate Pattern Matching 
11.0011.30 
Coffee break 
11.3013.00 
Session 1 
Session 2


Routing RealTime Messages on Communication Networks 
Stephan Kottler Progress of engineering a SAT Solver 

Thomas Rothvoß Tractability of Realtime Scheduling with fixed priorities 
Michael Schulz Simutaneous Embedding 

Christiane Schmidt RoboRithmics: algorithmic and technical methods for controlling an autonomous exploration robot 
HoiMing Wong Layerfree upward crossing minimization 
13.0014.30 
Lunch break 
14.3016.00 
Short presentation of the following projects (plenary) 

Algorithms for Complex Scheduling Problems 

Algorithm Engineering for Networkproblems 

Algorithm Engineering for Dynamic Graph Optimization Problems in Concrete Applications 

Algorithm Engineering for Developing Methods in Randomized Rounding 

Engineering of Randomized Algorithms for Optimization Problems in Hypergraphs 
16.0016.30 
Coffee break 

Session 1 
Session 2


Wiebke Höhn MultiStage Paint Shop Scheduling with History Dependent SetUp Times

Magnus Wahlström Algorithm Engineering for Developing Methods in Randomized Rounding


Tobias Jacobs Making Hierarchical Indexes Adaptive with Hotlinks

Benjamin Doerr Quasirandom Rumor Spreading


Annabell Berger Delay Propagation in Railway Networks andMultiCriteria TimeDependent Timetable Information

Lasse Kliemann Approximation Algorithms for bMatching in Hypergraphs: Theory and Experiment

20.00xx.xx

Dinner 
Tuesday 
9.0010.30 
Short presentation of the following projects (plenary) 

Disturbed Diffusion for Partitioning and Clustering Graphs 

Clustering of Static and Temporal Graphs 

Algorithm Engineering for the Basic Toolbox 

Development of a Practical Theory for Clustering Algorihtms through DataDriven Modeling and Analysis 

Design and Analysis of UseOriented Geometric Algorithms 

Algorithm Engineering for Problems in Computer Graphics 
10.3011.00 
Coffee break 

Session 1

Session 2 

Diffusionbased (Re)Partitioning of Graphs 
Daniel Kuntze Towards experimental and theoretical evaluation of old and new clustering algorithms 

Robert Görke Clustering Updates vs. Preservation of the Mental Map 
Shortest Path in Three Dimensions Touching a Set of Lines / Ant Colony Optimization Ludmila Scharf Shape Matching by Random Sampling 

Peter Sanders The Basic Algorithmic Toolbox: Challenge session

Claudius Jähn 3DScene Classification for Visibility Algorithms 
12.3014.00 
Lunch break 
14.0015.30 
Short presentation of the following projects (plenary) 

Exact Integer Programming 

Simple and Fast Implementation of Exact Optimization Algorithms with SCIL 

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

Algorithms for Modern Hardware: Flash Memory 

External GoalDirected Search in Implicit Graphs 
15.3016.00 
Coffee break 

Session 1 
Session 2


Kati Wolter Exact Integer Programming 
Holger Bast Efficient Search in Very Large Collections of Text, Databases and Ontologies 

Frank Baumann Simple and Fast Implementation of Exact Optimization Algorithms with SCIL 
Deepak Ajwani Algorithms for Modern Hardware: Flash Memory 

Daniel Delling Clustering of Static and Temporal Graphs 
Ulrich Meyer On TradeOffs in ExternalMemory DiameterApproximation 