Follow
Dominik Schultes
Dominik Schultes
Professor für Informatik, Technische Hochschule Mittelhessen
Verified email at iem.thm.de
Title
Cited by
Cited by
Year
Contraction hierarchies: Faster and simpler hierarchical routing in road networks
R Geisberger, P Sanders, D Schultes, D Delling
Experimental Algorithms: 7th International Workshop, WEA 2008 Provincetown …, 2008
10592008
Engineering route planning algorithms
D Delling, P Sanders, D Schultes, D Wagner
Algorithmics of large and complex networks: design, analysis, and simulation …, 2009
7582009
Highway hierarchies hasten exact shortest path queries
P Sanders, D Schultes
European Symposium on Algorithms, 568-579, 2005
5032005
Exact routing in large road networks using contraction hierarchies
R Geisberger, P Sanders, D Schultes, C Vetter
Transportation Science 46 (3), 388-404, 2012
4352012
Better approximation of betweenness centrality
R Geisberger, P Sanders, D Schultes
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and …, 2008
3282008
Fast routing in road networks with transit nodes
H Bast, S Funke, P Sanders, D Schultes
Science 316 (5824), 566-566, 2007
3202007
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
3052007
Engineering highway hierarchies
P Sanders, D Schultes
European Symposium on Algorithms, 804-816, 2006
2892006
Dynamic highway-node routing
D Schultes, P Sanders
International Workshop on Experimental and Efficient Algorithms, 66-79, 2007
2282007
Dynamic highway-node routing
D Schultes, P Sanders
International Workshop on Experimental and Efficient Algorithms, 66-79, 2007
2282007
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
2272010
Route planning in road networks
D Schultes
Karlsruhe, Univ., Diss., 2008, 2008
2182008
Engineering fast route planning algorithms
P Sanders, D Schultes
International workshop on experimental and efficient algorithms, 23-36, 2007
1762007
Bidirectional A  ∗  Search for Time-Dependent Fast Paths
G Nannicini, D Delling, L Liberti, D Schultes
Experimental Algorithms: 7th International Workshop, WEA 2008 Provincetown …, 2008
1612008
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
1362007
Bidirectional A* search on time‐dependent road networks
G Nannicini, D Delling, D Schultes, L Liberti
Networks 59 (2), 240-251, 2012
1322012
Combining hierarchical and goal-directed speed-up techniques for Dijkstra’s algorithm
R Bauer, D Delling, P Sanders, D Schieferdecker, D Schultes, D Wagner
Experimental Algorithms: 7th International Workshop, WEA 2008 Provincetown …, 2008
1232008
Highway Hierarchies Star.
D Delling, P Sanders, D Schultes, D Wagner
The shortest path problem, 141-174, 2006
992006
Mobile route planning
P Sanders, D Schultes, C Vetter
European Symposium on Algorithms, 732-743, 2008
792008
Engineering an external memory minimum spanning tree algorithm
R Dementiev, P Sanders, D Schultes, J Sibeyn
Exploring New Frontiers of Theoretical Informatics: IFIP 18th World Computer …, 2004
682004
The system can't perform the operation now. Try again later.
Articles 1–20