Peter Sanders
Peter Sanders
Professor of Computer Science, Karlsruhe Institute of Technology
Dirección de correo verificada de kit.edu
Título
Citado por
Citado por
Año
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
10742005
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
7572008
Simple linear work suffix array construction
J Kärkkäinen, P Sanders
International Colloquium on Automata, Languages, and Programming, 943-955, 2003
5952003
Engineering route planning algorithms
D Delling, P Sanders, D Schultes, D Wagner
Algorithmics of large and complex networks, 117-139, 2009
5682009
Route planning in transportation networks
H Bast, D Delling, A Goldberg, M Müller-Hannemann, T Pajor, P Sanders, ...
Algorithm Engineering, 19-80, 2016
4982016
Algorithms and data structures: The basic toolbox
K Mehlhorn, P Sanders
Springer Science & Business Media, 2008
4462008
Highway hierarchies hasten exact shortest path queries
P Sanders, D Schultes
European Symposium on Algorithms, 568-579, 2005
4292005
Linear work suffix array construction
J Kärkkäinen, P Sanders, S Burkhardt
Journal of the ACM (JACM) 53 (6), 918-936, 2006
4002006
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
4002003
Recent advances in graph partitioning
A Buluç, H Meyerhenke, I Safro, P Sanders, C Schulz
Algorithm Engineering, 117-158, 2016
2812016
Fast routing in road networks with transit nodes
H Bast, S Funke, P Sanders, D Schultes
Science 316 (5824), 566-566, 2007
2662007
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
2632007
Exact routing in large road networks using contraction hierarchies
R Geisberger, P Sanders, D Schultes, C Vetter
Transportation Science 46 (3), 388-404, 2012
2542012
Engineering highway hierarchies
P Sanders, D Schultes
European Symposium on Algorithms, 804-816, 2006
2502006
Better approximation of betweenness centrality
R Geisberger, P Sanders, D Schultes
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and …, 2008
2402008
Δ-stepping: a parallelizable shortest path algorithm
U Meyer, P Sanders
Journal of Algorithms 49 (1), 114-152, 2003
2242003
Dynamic highway-node routing
D Schultes, P Sanders
6th Workshop on Experimental Algorithms (WEA), 66-79, 2007
1952007
A parallelization of Dijkstra's shortest path algorithm
A Crauser, K Mehlhorn, U Meyer, P Sanders
International Symposium on Mathematical Foundations of Computer Science, 722-731, 1998
1951998
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.3, 2010
1692010
Graph partitioning and graph clustering, 10th DIMACS implementation challenge workshop
DA Bader, H Meyerhenke, P Sanders, D Wagner
168*2012
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20