Schedule (Thursday, 9th September)

8:30 - 9:00 Morning Coffee
09:00 - 9:50 Invited Speaker: Alberto Caprara
Almost 20 Years of Combinatorial Optimization for Railway Planning: From Lagrangian Relaxation to Column Generation
Marco Lübbecke
10:00 - 10:20 Coffee Break
10:20 - 12:00 Session 1 (ATMOS)
Alberto Marchetti-Spaccamela
Session 1 (WAOA)
Roberto Solis-Oba
Engineering Time-Dependent Many-to-Many Shortest Paths Computation
R. Geisberger and P. Sanders
An FPTAS for Flows over Time with Aggregate Arc Capacities
D. Dressler and M. Skutella
Fast Detour Computation for Ride Sharing
D. Luxen, P. Sanders, R. Geisberger, S. Neubauer and L. Volker
Throughput Maximization for Periodic Packet Routing on Trees and Grids
B. Peis and A. Wiese
An Empirical Analysis of Robustness Concepts for Timetabling
M. Goerigk and A. Schöbel
Densest k-Subgraph Approximation on Intersection Graphs
D. Z. Chen, R. Fleischer and J. Li
Robust Train Routing and Online Re-scheduling
A. Caprara, L. Galli, L. Kroon, G. Maroti and P. Toth
Approximating Directed Buy-at-bulk Network Design
S. Antonakopoulos
12:00 - 13:30 Lunch
13:30 - 15:10 Session 2 (ATMOS)
Thomas Erlebach
Session 2 (WAOA)
Piotr Krysta
Vertex Disjoint Paths for Dispatching in Railways
H. Flier, M. Mihalak, A. Schöbel, P. Widmayer and A. Zych
An improved algorithm for online rectangle filling
R. van Stee
Heuristics for the Traveling Repairman Problem with Profits
T. Dewilde, D. Cattrysse, S. Coene, F. Spieksma and P. Vansteenwegen
List Factoring and Relative Worst Order Analysis
M. R. Ehmsen, J. S. Kohrt and K. S. Larsen
The complexity of integrating routing decisions in public transportation models
M. Schmidt and A. Schöbel
Online Tracking of the Dominance Online Ranking for Tournament Graphs
T.-W. Lam, C.-M. Liu and H.-F. Ting
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
F. Fischer and C. Helmberg
Online Ranking for Tournament Graphs
C. Mathieu and A. Vladu
15:10 - 15:30 Coffee Break
15:30 - 17:10 Session 3 (ATMOS)
Marco Lübbecke
Session 3 (WAOA)
Ulrich Meyer
Traffic signal optimization using cyclically expanded networks
E. Köhler and M. Strehler
On the approximation complexity hierarchy
M. Bordewich
Railway Track Allocation by Rapid Branching
R. Borndörfer, T. Schlechte and S. Weider
Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
T. Yamakami
Column generation heuristic for a rich arc routing problem
S. Lannez, C. Artigues, J. Damay and M. Gendreau
How to Play Unique Games on Expanders
K. Makarychev and Y. Makarychev
The Team Orienteering Problem: Formulations and Branch-Cut and Price
M. Poggi, H. Viana and E. Uchoa
Strategic Multiway Cut and Multicut Games
E. Anshelevich, B. Caskurlu and A. Hate