Dominik Schultes
Dominik Schultes
Professor für Informatik, Technische Hochschule Mittelhessen
Verified email at iem.thm.de
TitleCited byYear
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
7292008
Engineering route planning algorithms
D Delling, P Sanders, D Schultes, D Wagner
Algorithmics of large and complex networks, 117-139, 2009
5462009
Highway hierarchies hasten exact shortest path queries
P Sanders, D Schultes
European Symposium on Algorithms, 568-579, 2005
4282005
In transit to constant time shortest-path queries in road networks
H Bast, S Funke, D Matijevic, P Sanders, D Schultes
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and …, 2007
2702007
Fast routing in road networks with transit nodes
H Bast, S Funke, P Sanders, D Schultes
Science 316 (5824), 566-566, 2007
2602007
Engineering highway hierarchies
P Sanders, D Schultes
European Symposium on Algorithms, 804-816, 2006
2512006
Exact routing in large road networks using contraction hierarchies
R Geisberger, P Sanders, D Schultes, C Vetter
Transportation Science 46 (3), 388-404, 2012
2392012
Better approximation of betweenness centrality
R Geisberger, P Sanders, D Schultes
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and …, 2008
2262008
Dynamic highway-node routing
D Schultes, P Sanders
International Workshop on Experimental and Efficient Algorithms, 66-79, 2007
2012007
Dynamic highway-node routing
D Schultes, P Sanders
International Workshop on Experimental and Efficient Algorithms, 66-79, 2007
2012007
Route Planning in Road Networks.
D Schultes
Ausgezeichnete Informatikdissertationen, 271-280, 2008
1982008
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
1662010
Engineering fast route planning algorithms
P Sanders, D Schultes
International Workshop on Experimental and Efficient Algorithms, 23-36, 2007
1442007
Bidirectional A  ∗  Search for Time-Dependent Fast Paths
G Nannicini, D Delling, L Liberti, D Schultes
International Workshop on Experimental and Efficient Algorithms, 334-346, 2008
1232008
Computing many-to-many shortest paths using highway hierarchies
S Knopp, P Sanders, D Schultes, F Schulz, D Wagner
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and …, 2007
972007
Combining hierarchical and goal-directed speed-up techniques for Dijkstra’s algorithm
R Bauer, D Delling, P Sanders, D Schieferdecker, D Schultes, D Wagner
International Workshop on Experimental and Efficient Algorithms, 303-318, 2008
952008
Highway Hierarchies Star.
D Delling, P Sanders, D Schultes, D Wagner
The Shortest Path Problem, 141-174, 2006
932006
Bidirectional A* search on time‐dependent road networks
G Nannicini, D Delling, D Schultes, L Liberti
Networks 59 (2), 240-251, 2012
832012
Mobile route planning
P Sanders, D Schultes, C Vetter
European Symposium on Algorithms, 732-743, 2008
712008
Engineering an external memory minimum spanning tree algorithm
R Dementiev, P Sanders, D Schultes, J Sibeyn
Exploring New Frontiers of Theoretical Informatics, 195-208, 2004
572004
The system can't perform the operation now. Try again later.
Articles 1–20