Daniel Delling

Computational Theory and Mathematics · 2008–2015

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

Subfields

Whom Daniel Delling trusts overall

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

  1. Peter Sanders
  2. Andrew Vladislav Goldberg
  3. Mikkel Thorup
  4. Dominik Schultes
  5. Haim Kaplan
  6. Robert Geisberger
  7. Mark Newman
  8. Renato F. Werneck
  9. T. Lindvall
  10. John Douglas Owens

Who trusts Daniel Delling overall

  1. Robert Geisberger
  2. Peter Sanders
  3. Ekim Yurtsever
  4. Ittai Abraham
  5. Hannah Bast
  6. Andrew Vladislav Goldberg
  7. Dominik Schultes
  8. Christian Vetter
  9. Claudine Santos Badue
  10. Jacob Lambert

Papers from Daniel Delling's perspective

Ordered by how strongly the researchers Daniel Delling 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. Highway Hierarchies Hasten Exact Shortest Path Queries (Embedded Systems and Applications)
  4. PHAST: Hardware-Accelerated Shortest Path Trees
  5. Distance labeling in graphs (ACM-SIAM Symposium on Discrete Algorithms)
  6. Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
  7. Heuristic shortest path algorithms for transportation applications: State of the art (Computers & Operations Research)
  8. Compact oracles for reachability and approximate distances in planar digraphs (Proceedings IEEE International Conference on Cluster Computing)
  9. Reach for A*: Efficient Point-to-Point Shortest Path Algorithms (Workshop on Algorithm Engineering and Experimentation)
  10. Reachability and distance queries via 2-hop labels

Their papers