Peter Sanders

Computational Theory and Mathematics · 2003–2015

A researcher in the Science corpus: 13 papers; trusts 19 researchers and is trusted by 34 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 32 citations into it
• Computer Networks and Communications — 24 citations into it; #1,090 of 9,886 by trust here, #1,297 by citations
• Artificial Intelligence — 19 citations into it; #11,101 of 35,345 by trust here, #23,077 by citations
• Computer Vision and Pattern Recognition — 17 citations into it; #6,036 of 21,575 by trust here, #12,689 by citations
• Algorithms & Complexity — 16 citations into it; #242 of 516 by trust here, #352 by citations
• Electrical and Electronic Engineering — 13 citations into it; #6,705 of 16,539 by trust here, #7,308 by citations
• Signal Processing — 12 citations into it; #1,191 of 7,572 by trust here, #1,748 by citations
• Hardware and Architecture — 11 citations into it; #248 of 1,551 by trust here, #868 by citations

Whom Peter Sanders trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Mikkel Thorup
2. Andrew Vladislav Goldberg
3. Daniel Delling
4. Dominik Schultes
5. Don Coppersmith
6. Haim Kaplan
7. Daniel Fernholz
8. Renato F. Werneck
9. Dorit Ron
10. M. Burrows

Who trusts Peter Sanders overall

1. Daniel Delling
2. Robert Geisberger
3. Andrew Vladislav Goldberg
4. Ittai Abraham
5. Dominik Schultes
6. Hannah Bast
7. Simon J. Puglisi
8. Renato F. Werneck
9. Yunnan Wu
10. Sidharth Jaggi

Papers from Peter Sanders's perspective

Ordered by how strongly the researchers Peter Sanders trusts endorse each paper. Same corpus, a different order for every researcher.

1. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks (ALENEX/ANALC)
2. A Formal Basis for the Heuristic Determination of Minimum Cost Paths
3. Distance labeling in graphs (ACM-SIAM Symposium on Discrete Algorithms)
4. Highway Hierarchies Hasten Exact Shortest Path Queries (Embedded Systems and Applications)
5. Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
6. PHAST: Hardware-Accelerated Shortest Path Trees
7. Heuristic shortest path algorithms for transportation applications: State of the art (Computers & Operations Research)
8. ON A ROUTING PROBLEM (Probability in the engineering and informational sciences (Print))
9. Compact oracles for reachability and approximate distances in planar digraphs (Proceedings IEEE International Conference on Cluster Computing)
10. Reachability and distance queries via 2-hop labels

Their papers

• Polynomial time algorithms for network information flow (2003) — 308 citations
• Polynomial time algorithms for multicast network code construction (2005) — 993 citations
• Simple Linear Work Suffix Array Construction (2003) — 481 citations
• Advanced Coarsening Schemes for Graph Partitioning (2012) — 114 citations
• Linear work suffix array construction (2006) — 427 citations
• Recent Advances in Graph Partitioning (2013) — 614 citations
• Route Planning in Transportation Networks (2015) — 783 citations
• Exact Routing in Large Road Networks Using Contraction Hierarchies (2012) — 393 citations
• Engineering Route Planning Algorithms (2009) — 540 citations
• Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm (2008) — 263 citations
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks (2008) — 855 citations
• The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation (2007) — 73 citations
• Highway Hierarchies Hasten Exact Shortest Path Queries (2005) — 421 citations