Matthias Müller-Hannemann

Signal Processing · 2010–2015

A researcher in the Science corpus: 2 papers; trusts 4 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Matthias Müller-Hannemann trusts overall

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

  1. Darko Butina
  2. Peter Sanders

Who trusts Matthias Müller-Hannemann overall

  1. Felicity Allen

Papers from Matthias Müller-Hannemann's perspective

Ordered by how strongly the researchers Matthias Müller-Hannemann 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. Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
  4. Highway Hierarchies Hasten Exact Shortest Path Queries (Embedded Systems and Applications)
  5. PHAST: Hardware-Accelerated Shortest Path Trees
  6. Heuristic shortest path algorithms for transportation applications: State of the art (Computers & Operations Research)
  7. Distance labeling in graphs (ACM-SIAM Symposium on Discrete Algorithms)
  8. Reachability and distance queries via 2-hop labels
  9. ON A ROUTING PROBLEM (Probability in the engineering and informational sciences (Print))
  10. Compact oracles for reachability and approximate distances in planar digraphs (Proceedings IEEE International Conference on Cluster Computing)

Their papers