Chris Harrelson
ACM-SIAM Symposium on Discrete Algorithms · 2005
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Chris Harrelson trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Chris Harrelson overall
- Andrew Vladislav Goldberg
- Hanan Samet
- Michalis Potamias
- Daniel Delling
- Vitaly Surazhsky
- Hannah Bast
- Christian Vetter
- Peter Sanders
Papers from Chris Harrelson's perspective
Ordered by how strongly the researchers Chris Harrelson trusts endorse each paper. Same corpus, a different order for every researcher.
- A Formal Basis for the Heuristic Determination of Minimum Cost Paths
- Linear Programming and Extensions
- Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks (ALENEX/ANALC)
- Introduction to algorithms
- Shakey the Robot
- Toward automatic program synthesis
- Principles of Artificial Intelligence
- The complexity of theorem-proving procedures
- Increasing Internet Capacity Using Local Search (Computational optimization and applications)
- Building a better NetFlow (Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication)
Their papers
- Computing the shortest path: A search meets graph theory (2005) — 998 citations