| 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 | 957 | 2008 |
| Engineering route planning algorithms D Delling, P Sanders, D Schultes, D Wagner Algorithmics of large and complex networks, 117-139, 2009 | 705 | 2009 |
| Highway hierarchies hasten exact shortest path queries P Sanders, D Schultes European Symposium on Algorithms, 568-579, 2005 | 476 | 2005 |
| Exact routing in large road networks using contraction hierarchies R Geisberger, P Sanders, D Schultes, C Vetter Transportation Science 46 (3), 388-404, 2012 | 364 | 2012 |
| Fast routing in road networks with transit nodes H Bast, S Funke, P Sanders, D Schultes Science 316 (5824), 566-566, 2007 | 301 | 2007 |
| Better approximation of betweenness centrality R Geisberger, P Sanders, D Schultes 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and …, 2008 | 295 | 2008 |
| 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 | 294 | 2007 |
| Engineering highway hierarchies P Sanders, D Schultes European Symposium on Algorithms, 804-816, 2006 | 274 | 2006 |
| Route planning in road networks D Schultes Karlsruhe, Univ., Diss., 2008, 2008 | 219 | 2008 |
| Dynamic highway-node routing D Schultes, P Sanders International Workshop on Experimental and Efficient Algorithms, 66-79, 2007 | 215 | 2007 |
| Dynamic highway-node routing D Schultes, P Sanders International Workshop on Experimental and Efficient Algorithms, 66-79, 2007 | 215 | 2007 |
| 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 | 204 | 2010 |
| Engineering fast route planning algorithms P Sanders, D Schultes International workshop on experimental and efficient algorithms, 23-36, 2007 | 170 | 2007 |
| 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 | 146 | 2008 |
| 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 | 127 | 2007 |
| 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 | 118 | 2008 |
| Bidirectional A* search on time‐dependent road networks G Nannicini, D Delling, D Schultes, L Liberti Networks 59 (2), 240-251, 2012 | 115 | 2012 |
| Highway Hierarchies Star. D Delling, P Sanders, D Schultes, D Wagner The shortest path problem, 141-174, 2006 | 99 | 2006 |
| Mobile route planning P Sanders, D Schultes, C Vetter European Symposium on Algorithms, 732-743, 2008 | 77 | 2008 |
| 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 | 63 | 2004 |
