Daniel Delling
TitleCited byYear
On modularity clustering
U Brandes, D Delling, M Gaertler, R Gorke, M Hoefer, Z Nikoloski, ...
IEEE transactions on knowledge and data engineering 20 (2), 172-188, 2007
1464*2007
Contraction hierarchies: Faster and simpler hierarchical routing in road networks
R Geisberger, P Sanders, D Schultes, D Delling
International Workshop on Experimental and Efficient Algorithms, 319-333, 2008
7042008
Engineering route planning algorithms
D Delling, P Sanders, D Schultes, D Wagner
Algorithmics of large and complex networks, 117-139, 2009
5352009
Route planning in transportation networks
H Bast, D Delling, A Goldberg, M Müller-Hannemann, T Pajor, P Sanders, ...
Algorithm engineering, 19-80, 2016
4462016
A hub-based labeling algorithm for shortest paths in road networks
I Abraham, D Delling, AV Goldberg, RF Werneck
International Symposium on Experimental Algorithms, 230-241, 2011
2252011
SHARC: Fast and robust unidirectional routing
R Bauer, D Delling
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and …, 2008
2192008
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
R Bauer, D Delling, P Sanders, D Schieferdecker, D Schultes, D Wagner
ACM Journal of Experimental Algorithmics 15 (2.3), 2010
2042010
Bidirectional A* search on time‐dependent road networks
G Nannicini, D Delling, D Schultes, L Liberti
Networks 59 (2), 240-251, 2012
184*2012
Customizable route planning
D Delling, AV Goldberg, T Pajor, RF Werneck
International Symposium on Experimental Algorithms, 376-387, 2011
1792011
Sketch-based influence maximization and computation: Scaling up with guarantees
E Cohen, D Delling, T Pajor, RF Werneck
Proceedings of the 23rd ACM International Conference on Conference on …, 2014
1682014
Hierarchical hub labelings for shortest paths
I Abraham, D Delling, AV Goldberg, RF Werneck
European Symposium on Algorithms, 24-35, 2012
1642012
PHAST: Hardware-accelerated shortest path trees
D Delling, AV Goldberg, A Nowatzyk, RF Werneck
Journal of Parallel and Distributed Computing 73 (7), 940-952, 2013
1522013
Round-based public transit routing
D Delling, T Pajor, RF Werneck
Transportation Science 49 (3), 591-604, 2014
1482014
Landmark-based routing in dynamic graphs
D Delling, D Wagner
International Workshop on Experimental and Efficient Algorithms, 52-65, 2007
1482007
Time-dependent route planning
D Delling, D Wagner
Robust and online large-scale optimization, 207-230, 2009
1262009
Graph partitioning with natural cuts
D Delling, AV Goldberg, I Razenshteyn, RF Werneck
2011 IEEE International Parallel & Distributed Processing Symposium, 1135-1146, 2011
1172011
Time-dependent contraction hierarchies
GV Batz, D Delling, P Sanders, C Vetter
Proceedings of the Meeting on Algorithm Engineering & Expermiments, 97-105, 2009
1102009
Core routing on dynamic time-dependent road networks
D Delling, G Nannicini
INFORMS Journal on Computing 24 (2), 187-201, 2012
109*2012
Alternative routes in road networks
I Abraham, D Delling, AV Goldberg, RF Werneck
Journal of Experimental Algorithmics (JEA) 18, 1.3, 2013
1002013
Highway Hierarchies Star.
D Delling, P Sanders, D Schultes, D Wagner
The Shortest Path Problem, 141-174, 2006
982006
The system can't perform the operation now. Try again later.
Articles 1–20