Author

Renato F. Werneck

Observed names: Renato F.Werneck, Renato Fonseca F. Werneck, Renato Werneck, Werneck, Renato, Werneck, Renato F.

Observed institutions: Karlsruhe Institute of Technology, Microsoft (United States), Google (United States), Amazon (United States), Tel Aviv University, Universidade Estadual de Campinas (UNICAMP), Princeton University, Pontifícia Universidade Católica do Rio de Janeiro

ORCID: 0009-0005-4656-7111

Observed ORCID: 0009-0005-4656-7111

OpenAlex ID: A5063407134

Route Planning in Transportation Networks

2016 · Hannah Bast, Daniel Delling, et al. · Lecture notes in computer science · 680

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

2005 · Ricardo Fukasawa, Humberto Longo, et al. · Mathematical Programming · 562

A Hybrid Heuristic for the p-Median Problem

2004 · Mauricio G.C. Resende, Renato F. Werneck · Journal of Heuristics · 296

A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks

2011 · Ittai Abraham, Daniel Delling, et al. · Lecture notes in computer science · 262

Reach for A*: Efficient Point-to-Point Shortest Path Algorithms

2006 · Andrew V. Goldberg, Haim Kaplan, et al. · Workshop on Algorithm Engineering and Experiments (ALENEX) · 251

Sketch-based Influence Maximization and Computation

2014 · Edith Cohen, Daniel Delling, et al. · ACM International Conference on Information and Knowledge Management (CIKM) · 248

PDF

Hierarchical Hub Labelings for Shortest Paths

2012 · Ittai Abraham, Daniel Delling, et al. · Lecture notes in computer science · 218

Round-Based Public Transit Routing

2014 · Daniel Delling, Thomas Pajor, et al. · Transportation Science · 210

Customizable Route Planning

2011 · Daniel Delling, Andrew V. Goldberg, et al. · Lecture notes in computer science · 174

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

2002 · Celso C. Ribeiro, Eduardo Uchoa, et al. · INFORMS journal on computing · 171

Fast local search for the maximum independent set problem

2012 · Diogo V. Andrade, Mauricio G. C. Resende, et al. · Journal of Heuristics · 170

Customizable Route Planning in Road Networks

2015 · Daniel Delling, Andrew V. Goldberg, et al. · Transportation Science · 164

Highway dimension, shortest paths, and provably efficient algorithms

2010 · Ittai Abraham, Amos Fiat, et al. · 147

Route Planning in Transportation Networks

2015 · Bast, Hannah, Delling, Daniel, et al. · arXiv (Cornell University) · 140

PDF

Graph Partitioning with Natural Cuts

2011 · Daniel Delling, Andrew V. Goldberg, et al. · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · 135

Finding Near-Optimal Independent Sets at Scale

2015 · Sebastian Lamm, Peter Sanders, et al. · Journal of Heuristics · 123

PDF

PHAST: Hardware-accelerated shortest path trees

2012 · Daniel Delling, Andrew V. Goldberg, et al. · Journal of Parallel and Distributed Computing · 123

Highway Dimension, Shortest Paths, and Provably Efficient Algorithms

2010 · Ittai Abraham, Amos Fiat, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 120

Alternative routes in road networks

2013 · Ittai Abraham, Daniel Delling, et al. · ACM Journal of Experimental Algorithmics · 118

A hybrid multistart heuristic for the uncapacitated facility location problem

2005 · Mauricio G.C. Resende, Renato F. Werneck · European Journal of Operational Research · 117

Computing classic closeness centrality, at scale

2014 · Edith Cohen, Daniel Delling, et al. · Conference on Online Social Networks · 92

PDF

Better Landmarks Within Reach

2007 · Andrew V. Goldberg, Haim Kaplan, et al. · Lecture notes in computer science · 79

A fast swap-based local search procedure for location problems

2007 · Mauricio G. C. Resende, Renato F. Werneck · Annals of Operations Research · 76

VC-Dimension and Shortest Path Algorithms

2011 · Ittai Abraham, Daniel Delling, et al. · Lecture notes in computer science · 73

Reach for A*: shortest path algorithms with preprocessing

2009 · Andrew Goldberg, Haim Kaplan, et al. · DIMACS series in discrete mathematics and theoretical computer science · 73

Works count: 119

Citation count: 6,641

H-index: 42

I10-index: 75