| 2008 |
|---|
| 11 | EE | Reinhard Bauer,
Daniel Delling,
Peter Sanders,
Dennis Schieferdecker,
Dominik Schultes,
Dorothea Wagner:
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm.
WEA 2008: 303-318 |
| 10 | EE | Robert Geisberger,
Peter Sanders,
Dominik Schultes,
Daniel Delling:
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.
WEA 2008: 319-333 |
| 9 | EE | Giacomo Nannicini,
Daniel Delling,
Leo Liberti,
Dominik Schultes:
Bidirectional A* Search for Time-Dependent Fast Paths.
WEA 2008: 334-346 |
| 2007 |
|---|
| 8 | EE | Sebastian Knopp,
Peter Sanders,
Dominik Schultes,
Frank Schulz,
Dorothea Wagner:
Computing Many-to-Many Shortest Paths Using Highway Hierarchies.
ALENEX 2007 |
| 7 | EE | Holger Bast,
Stefan Funke,
Domagoj Matijevic,
Peter Sanders,
Dominik Schultes:
In Transit to Constant Time Shortest-Path Queries in Road Networks.
ALENEX 2007 |
| 6 | EE | Peter Sanders,
Dominik Schultes:
Engineering Fast Route Planning Algorithms.
WEA 2007: 23-36 |
| 5 | EE | Dominik Schultes,
Peter Sanders:
Dynamic Highway-Node Routing.
WEA 2007: 66-79 |
| 2006 |
|---|
| 4 | EE | Peter Sanders,
Dominik Schultes:
Engineering Highway Hierarchies.
ESA 2006: 804-816 |
| 3 | EE | Dominik Schultes:
Rainbow Sort: Sorting at the Speed of Light.
Natural Computing 5(1): 67-82 (2006) |
| 2005 |
|---|
| 2 | EE | Peter Sanders,
Dominik Schultes:
Highway Hierarchies Hasten Exact Shortest Path Queries.
ESA 2005: 568-579 |
| 2004 |
|---|
| 1 | | Roman Dementiev,
Peter Sanders,
Dominik Schultes,
Jop F. Sibeyn:
Engineering an External Memory Minimum Spanning Tree Algorithm.
IFIP TCS 2004: 195-208 |
