| 2009 |
|---|
| 15 | EE | Gernot Veit Batz,
Daniel Delling,
Peter Sanders,
Christian Vetter:
Time-Dependent Contraction Hierarchies.
ALENEX 2009: 97-105 |
| 14 | EE | Reinhard Bauer,
Gianlorenzo D'Angelo,
Daniel Delling,
Dorothea Wagner:
The Shortcut Problem - Complexity and Approximation.
SOFSEM 2009: 105-116 |
| 2008 |
|---|
| 13 | EE | Daniel Delling,
Marco Gaertler,
Robert Görke,
Dorothea Wagner:
Engineering Comparators for Graph Clusterings.
AAIM 2008: 131-142 |
| 12 | EE | Reinhard Bauer,
Daniel Delling:
SHARC: Fast and Robust Unidirectional Routing.
ALENEX 2008: 13-26 |
| 11 | EE | Daniel Delling,
Thomas Pajor,
Dorothea Wagner:
Engineering Time-Expanded Graphs for Faster Timetable Information.
ATMOS 2008 |
| 10 | | Giacomo Nannicini,
Daniel Delling,
Leo Liberti,
Dominik Schultes:
Bidirectional A* on Time-dependent Graphs.
CTW 2008: 132-135 |
| 9 | EE | Daniel Delling:
Time-Dependent SHARC-Routing.
ESA 2008: 332-343 |
| 8 | EE | Daniel Delling,
Giacomo Nannicini:
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks.
ISAAC 2008: 812-823 |
| 7 | 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 |
| 6 | EE | Robert Geisberger,
Peter Sanders,
Dominik Schultes,
Daniel Delling:
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.
WEA 2008: 319-333 |
| 5 | EE | Giacomo Nannicini,
Daniel Delling,
Leo Liberti,
Dominik Schultes:
Bidirectional A* Search for Time-Dependent Fast Paths.
WEA 2008: 334-346 |
| 4 | EE | Ulrik Brandes,
Daniel Delling,
Marco Gaertler,
Robert Görke,
Martin Hoefer,
Zoran Nikoloski,
Dorothea Wagner:
On Modularity Clustering.
IEEE Trans. Knowl. Data Eng. 20(2): 172-188 (2008) |
| 2007 |
|---|
| 3 | EE | Reinhard Bauer,
Daniel Delling,
Dorothea Wagner:
Experimental Study on Speed-Up Techniques for Timetable Information Systems.
ATMOS 2007 |
| 2 | EE | Daniel Delling,
Dorothea Wagner:
Landmark-Based Routing in Dynamic Graphs.
WEA 2007: 52-65 |
| 1 | EE | Ulrik Brandes,
Daniel Delling,
Marco Gaertler,
Robert Görke,
Martin Hoefer,
Zoran Nikoloski,
Dorothea Wagner:
On Finding Graph Clusterings with Maximum Modularity.
WG 2007: 121-132 |
