Renato F. Werneck

Computer Networks and Communications · 2004–2015

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

Subfields

• Computer Networks and Communications — 18 citations into it
• Signal Processing — 16 citations into it; #2,963 of 7,572 by trust here, #2,911 by citations
• Computational Theory and Mathematics — 12 citations into it; #5,831 of 12,182 by trust here, #7,142 by citations
• Computer Vision and Pattern Recognition — 11 citations into it

Whom Renato F. Werneck trusts overall

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

1. Gerhard Reinelt
2. Peter Sanders
3. Mikkel Thorup
4. Makoto Matsumoto
5. Andrew Vladislav Goldberg
6. Dominik Schultes
7. Daniel Delling
8. Pierre Hansen

Who trusts Renato F. Werneck overall

1. Maurício Resende
2. Daniel Delling
3. Robert Geisberger
4. Peter Sanders
5. Nenad Mladenovic
6. Celso C. Ribeiro
7. Dominik Schultes

Papers from Renato F. Werneck's perspective

Ordered by how strongly the researchers Renato F. Werneck 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. PHAST: Hardware-Accelerated Shortest Path Trees
5. Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
6. Highway Hierarchies Hasten Exact Shortest Path Queries (Embedded Systems and Applications)
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. Reachability and distance queries via 2-hop labels
10. ON A ROUTING PROBLEM (Probability in the engineering and informational sciences (Print))

Their papers

• A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks (2011) — 302 citations
• Reach for A*: Efficient Point-to-Point Shortest Path Algorithms (2006) — 310 citations
• Route Planning in Transportation Networks (2015) — 783 citations
• PHAST: Hardware-Accelerated Shortest Path Trees (2011) — 193 citations
• Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (2004) — 621 citations
• A Hybrid Heuristic for the p-Median Problem (2004) — 314 citations