| Publication | Date of Publication | Type |
|---|
Robustness generalizations of the shortest feasible path problem for electric vehicles
| 2024-08-13 | Paper |
Fast and exact public transit routing with restricted Pareto sets
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Exact combinatorial branch-and-bound for graph bisection
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Round-Based Public Transit Routing
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Robust mobile route planning with limited connectivity
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Time-dependent contraction hierarchies
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
SHARC: fast and robust unidirectional routing
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Highway dimension and provably efficient shortest path algorithms
Journal of the ACM | 2018-08-02 | Paper |
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Core routing on dynamic time-dependent road networks
INFORMS Journal on Computing | 2016-06-29 | Paper |
An exact combinatorial algorithm for minimum graph bisection
Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
Alternative routes in road networks
ACM Journal of Experimental Algorithmics | 2015-03-16 | Paper |
Robust distance queries on massive networks
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
SHARC, fast and robust unidirectional routing
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Parallel computation of best connections in public transportation networks
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
On \(d\)-regular schematization of embedded paths
Computational Geometry | 2014-01-22 | Paper |
Computing multimodal journeys in practice
| 2014-01-21 | Paper |
The shortcut problem - complexity and algorithms
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
Accelerating time-dependent multi-criteria timetable information is harder than expected
| 2012-09-28 | Paper |
Arc-flags in dynamic graphs
| 2012-09-28 | Paper |
Engineering time-expanded graphs for faster timetable information
| 2012-09-28 | Paper |
Hierarchical hub labelings for shortest paths
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Better Bounds for Graph Bisection
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Bidirectional \(A^*\) search on time-dependent road networks
Networks | 2012-06-18 | Paper |
VC-dimension and shortest path algorithms
Automata, Languages and Programming | 2011-07-06 | Paper |
Time-dependent SHARC-routing
Algorithmica | 2011-07-01 | Paper |
scientific article; zbMATH DE number 5734725 (Why is no real title available?)
| 2010-07-09 | Paper |
High-performance multi-level routing
| 2010-07-09 | Paper |
Path Schematization for Route Sketches
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Time-dependent route planning
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Engineering Time-Expanded Graphs for Faster Timetable Information
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
The Shortcut Problem – Complexity and Approximation
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
Algorithms and Computation | 2009-01-29 | Paper |
Time-Dependent SHARC-Routing
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Engineering Comparators for Graph Clusterings
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
On Finding Graph Clusterings with Maximum Modularity
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Bidirectional A ∗ Search for Time-Dependent Fast Paths
Experimental Algorithms | 2008-06-13 | Paper |
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Experimental Algorithms | 2008-06-13 | Paper |
