Daniel Delling
Titolo
Citata da
Citata da
Anno
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
1554*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
7562008
Engineering route planning algorithms
D Delling, P Sanders, D Schultes, D Wagner
Algorithmics of large and complex networks, 117-139, 2009
5642009
Route planning in transportation networks
H Bast, D Delling, A Goldberg, M Mller-Hannemann, T Pajor, P Sanders, ...
Algorithm engineering, 19-80, 2016
4982016
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
R Bauer, D Delling, P Sanders, D Schieferdecker, D Schultes, D Wagner
Journal of Experimental Algorithmics (JEA) 15, 2.1-2.31, 2010
2522010
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
2352011
SHARC: Fast and robust unidirectional routing
R Bauer, D Delling
Journal of Experimental Algorithmics (JEA) 14, 2.4-2.29, 2010
2232010
Bidirectional A* search on time‐dependent road networks
G Nannicini, D Delling, D Schultes, L Liberti
Networks 59 (2), 240-251, 2012
193*2012
Customizable route planning
D Delling, AV Goldberg, T Pajor, RF Werneck
International Symposium on Experimental Algorithms, 376-387, 2011
1872011
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
1862014
Hierarchical hub labelings for shortest paths
I Abraham, D Delling, AV Goldberg, RF Werneck
European Symposium on Algorithms, 24-35, 2012
1762012
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
1572013
Round-based public transit routing
D Delling, T Pajor, RF Werneck
Transportation Science 49 (3), 591-604, 2015
1552015
Landmark-based routing in dynamic graphs
D Delling, D Wagner
International Workshop on Experimental and Efficient Algorithms, 52-65, 2007
1452007
Time-dependent route planning
D Delling, D Wagner
Robust and online large-scale optimization, 207-230, 2009
1342009
Graph partitioning with natural cuts
D Delling, AV Goldberg, I Razenshteyn, RF Werneck
2011 IEEE International Parallel & Distributed Processing Symposium, 1135-1146, 2011
1242011
Time-dependent contraction hierarchies
GV Batz, D Delling, P Sanders, C Vetter
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and…, 2009
1162009
Core routing on dynamic time-dependent road networks
D Delling, G Nannicini
INFORMS Journal on Computing 24 (2), 187-201, 2012
111*2012
Alternative routes in road networks
I Abraham, D Delling, AV Goldberg, RF Werneck
Journal of Experimental Algorithmics (JEA) 18, 1.1-1.17, 2013
1092013
Customizable route planning in road networks
D Delling, AV Goldberg, T Pajor, RF Werneck
Transportation Science 51 (2), 566-591, 2017
1012017
Il sistema al momento non pu eseguire l'operazione. Riprova pi tardi.
Articoli 1–20