Polynomial time algorithms for multicast network code construction S Jaggi, P Sanders, PA Chou, M Effros, S Egner, K Jain, LMGM Tolhuizen IEEE Transactions on Information Theory 51 (6), 1973-1982, 2005 | 1192 | 2005 |
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 | 1086 | 2008 |
Route planning in transportation networks H Bast, D Delling, A Goldberg, M Müller-Hannemann, T Pajor, P Sanders, ... Algorithm Engineering, 19-80, 2016 | 960 | 2016 |
Engineering route planning algorithms D Delling, P Sanders, D Schultes, D Wagner Algorithmics of large and complex networks, 117-139, 2009 | 774 | 2009 |
Simple linear work suffix array construction J Kärkkäinen, P Sanders International Colloquium on Automata, Languages, and Programming, 943-955, 2003 | 686 | 2003 |
Algorithms and data structures: The basic toolbox K Mehlhorn, P Sanders Springer Science & Business Media, 2008 | 664 | 2008 |
Recent advances in graph partitioning A Buluç, H Meyerhenke, I Safro, P Sanders, C Schulz Algorithm engineering: selected results and surveys, 117-158, 2016 | 621 | 2016 |
Linear work suffix array construction J Kärkkäinen, P Sanders, S Burkhardt Journal of the ACM (JACM) 53 (6), 918-936, 2006 | 518 | 2006 |
Highway hierarchies hasten exact shortest path queries P Sanders, D Schultes European Symposium on Algorithms, 568-579, 2005 | 507 | 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 | 451 | 2012 |
Polynomial time algorithms for network information flow P Sanders, S Egner, L Tolhuizen Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and …, 2003 | 426 | 2003 |
Δ-stepping: a parallelizable shortest path algorithm U Meyer, P Sanders Journal of Algorithms 49 (1), 114-152, 2003 | 361 | 2003 |
Δ-stepping: a parallelizable shortest path algorithm U Meyer, P Sanders Journal of Algorithms 49 (1), 114-152, 2003 | 361 | 2003 |
Better approximation of betweenness centrality R Geisberger, P Sanders, D Schultes 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and …, 2008 | 331 | 2008 |
Graph partitioning and graph clustering, 10th DIMACS implementation challenge postworkshop proceedings DA Bader, H Meyerhenke, P Sanders, D Wagner | 323* | 2012 |
Fast routing in road networks with transit nodes H Bast, S Funke, P Sanders, D Schultes Science 316 (5824), 566-566, 2007 | 322 | 2007 |
In transit to constant time shortest-path queries in road networks H Bast, S Funke, D Matijevic, P Sanders, D Schultes Proceedings of the Meeting on Algorithm Engineering & Expermiments, 46-59, 2007 | 305 | 2007 |
Engineering highway hierarchies P Sanders, D Schultes European Symposium on Algorithms, 804-816, 2006 | 290 | 2006 |
Think locally, act globally: Highly balanced graph partitioning P Sanders, C Schulz International Symposium on Experimental Algorithms, 164-175, 2013 | 279 | 2013 |
A parallelization of Dijkstra's shortest path algorithm A Crauser, K Mehlhorn, U Meyer, P Sanders Mathematical Foundations of Computer Science 1998: 23rd International …, 1998 | 251 | 1998 |