Presentations
-
Partially dynamic concurrent update of distributed shortest paths
International Conference on Computing: Theory and Applications (ICCTA'07)
Kolkata, India
PDF
-
On the dynamization of shortest path overlay graphs
Robust Planning and Rescheduling in Railways (R^3)
Utrecht, Netherlands
PDF
-
Dynamic multi-level overlay graphs for shortest paths
Summer School on Algorithmic Data Analysis (SADA07)
Helsinki, Finland
-
Maintenance of multi-level overlay graphs for timetable queries
Algorithmic Approaches for Transportation Modeling, Optimization, and Systems 2007 (ATMOS07)
Seville, Spain
PDF
-
On the Interaction between Robust Timetable Planning and Delay Management
2nd ARRIVAL Workshop
Rome, Italy
PDF
-
Delay Management Problem: Complexity Results and Robust Algorithms
2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA 2008)
St. John's, Canada
PDF
-
Recoverable-Robust Timetables for Trains on Single-Line Corridors
3rd International Seminar on Railway Operations Modelling and Analysis Engineering and Optimisation Approaches (RailZurich 2009)
Zurich, Switzerland
PDF
-
An Algorithmic Approach to Recoverable-robust Timetabling on Trees
Joint ARRIVAL/AEOLUS Workshop & School on Large-Scale Optimization: Robustness, Online and Offline Issues
Patras, Greece
PDF
-
Recoverable Robust Timetables on Trees
3rd Annual International Conference on Combinatorial Optimization and Applications (COCOA 2009)
Yellow Mountains, China
PDF
-
Evaluation of recoverable-robust timetables on tree networks
20th International Workshop on Combinatorial Algorithms (IWOCA 2009).
Hradec nad Moravicí, Czech Republic
PDF
-
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation
9th International Symposiom on Experimental Algorithms (SEA 2010).
Ischia Island, Italy
PDF