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
- Signal Processing — 9 citations into it
- Computer Networks and Communications — 7 citations into it
- Computational Theory and Mathematics — 6 citations into it
- Computer Vision and Pattern Recognition — 6 citations into it
Whom Matthias Müller-Hannemann trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Matthias Müller-Hannemann overall
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.
- Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks (ALENEX/ANALC)
- A Formal Basis for the Heuristic Determination of Minimum Cost Paths
- Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
- Highway Hierarchies Hasten Exact Shortest Path Queries (Embedded Systems and Applications)
- PHAST: Hardware-Accelerated Shortest Path Trees
- Heuristic shortest path algorithms for transportation applications: State of the art (Computers & Operations Research)
- Distance labeling in graphs (ACM-SIAM Symposium on Discrete Algorithms)
- Reachability and distance queries via 2-hop labels
- ON A ROUTING PROBLEM (Probability in the engineering and informational sciences (Print))
- Compact oracles for reachability and approximate distances in planar digraphs (Proceedings IEEE International Conference on Cluster Computing)
Their papers
- In silico fragmentation for computer assisted identification of metabolite mass spectra (2010) — 659 citations
- Route Planning in Transportation Networks (2015) — 783 citations