Peter Sanders - Google Scholar

Cited by

	All	Since 2015
Citations	16087	7620
h-index	65	45
i10-index	194	135

1500

750

375

1125

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202045 36 72 100 137 168 230 367 460 600 707 863 883 972 1259 1219 1343 1379 1320 1280 1471 817

Co-authors

Christian SchulzUniversity ViennaVerified email at informatik.uni-heidelberg.de
Dominik SchultesProfessor für Informatik, Technische Hochschule MittelhessenVerified email at iem.thm.de
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Dorothea WagnerProfessor of Computer Science, Karlsruhe Institute of Technology (KIT)Verified email at kit.edu
Robert GeisbergerGoogleVerified email at google.com
Roman DementievIntelVerified email at intel.com
Johannes SinglerVerified email at singler.name
Ulrich MeyerProfessor of Algorithm Engineering, Goethe University FrankfurtVerified email at cs.uni-frankfurt.de
Henning MeyerhenkeProfessor of Computer Science, HU BerlinVerified email at hu-berlin.de
Daniel DellingAppleVerified email at apple.com
Juha KärkkäinenDepartment of Computer scienceVerified email at cs.helsinki.fi
Stefan FunkeUniversität Stuttgart, GermanyVerified email at fmi.uni-stuttgart.de
Dennis LuxenBloomberg L.P.Verified email at bloomberg.net
Dennis SchieferdeckerKarlsruhe Institute of Technology Verified email at kit.edu
Gernot Veit BatzMeandairVerified email at meandair.com
Ilya SafroAssociate Professor of Computer Science, Clemson UniversityVerified email at clemson.edu
Timo BingmannKarlsruhe Institute of TechnologyVerified email at kit.edu
Hannah BastProfessor of Computer Science, University of FreiburgVerified email at informatik.uni-freiburg.de
Renato WerneckAmazonVerified email at cs.princeton.edu
Michael AxtmannPhD Candidate, Karlsruhe Institute of Technology (KIT)Verified email at kit.edu

Peter Sanders

Professor of Computer Science, Karlsruhe Institute of Technology

Verified email at kit.edu

algorithm engineering graph algorithms data structures parallel algorithms algorithms for big data


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	1079	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	766	2008
Simple linear work suffix array construction J Kärkkäinen, P Sanders International Colloquium on Automata, Languages, and Programming, 943-955, 2003	599	2003
Engineering route planning algorithms D Delling, P Sanders, D Schultes, D Wagner Algorithmics of large and complex networks, 117-139, 2009	574	2009
Route planning in transportation networks H Bast, D Delling, A Goldberg, M Müller-Hannemann, T Pajor, P Sanders, ... Algorithm Engineering, 19-80, 2016	505	2016
Algorithms and data structures: The basic toolbox K Mehlhorn, P Sanders Springer Science & Business Media, 2008	453	2008
Highway hierarchies hasten exact shortest path queries P Sanders, D Schultes European Symposium on Algorithms, 568-579, 2005	432	2005
Linear work suffix array construction J Kärkkäinen, P Sanders, S Burkhardt Journal of the ACM (JACM) 53 (6), 918-936, 2006	405	2006
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	402	2003
Recent advances in graph partitioning A Buluç, H Meyerhenke, I Safro, P Sanders, C Schulz Algorithm Engineering, 117-158, 2016	292	2016
Fast routing in road networks with transit nodes H Bast, S Funke, P Sanders, D Schultes Science 316 (5824), 566-566, 2007	266	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	265	2007
Exact routing in large road networks using contraction hierarchies R Geisberger, P Sanders, D Schultes, C Vetter Transportation Science 46 (3), 388-404, 2012	256	2012
Engineering highway hierarchies P Sanders, D Schultes European Symposium on Algorithms, 804-816, 2006	252	2006
Better approximation of betweenness centrality R Geisberger, P Sanders, D Schultes 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and …, 2008	241	2008
Δ-stepping: a parallelizable shortest path algorithm U Meyer, P Sanders Journal of Algorithms 49 (1), 114-152, 2003	226	2003
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	197	1998
Dynamic highway-node routing D Schultes, P Sanders 6th Workshop on Experimental Algorithms (WEA), 66-79, 2007	196	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.3, 2010	173	2010
Graph partitioning and graph clustering, 10th DIMACS implementation challenge postworkshop proceedings DA Bader, H Meyerhenke, P Sanders, D Wagner	171*	2012

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors