Renato F. Werneck

Most-cited papers

Route Planning in Transportation Networks
H. Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann +4 more
2015Algorithm Engineering804 citations
Semantic Scholar
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Ricardo Fukasawa, Humberto J. Longo, Jens Lysgaard, M. P. de Aragão +3 more
2004Mathematical programming624 citations Open access
Semantic Scholar
A Hybrid Heuristic for the p-Median Problem
M. C. Resende, Renato F. Werneck
2004J. Heuristics315 citations
Semantic Scholar
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
2006Workshop on Algorithm Engineering and Experimentation311 citations
Semantic Scholar
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2011The Sea308 citations
Semantic Scholar
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees
E. Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014International Conference on Information and Knowledge Management280 citations Open access
Semantic Scholar
Highway dimension, shortest paths, and provably efficient algorithms
Ittai Abraham, A. Fiat, Andrew V. Goldberg, Renato F. Werneck
2010ACM-SIAM Symposium on Discrete Algorithms253 citations
Semantic Scholar
Hierarchical Hub Labelings for Shortest Paths
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2012Embedded Systems and Applications251 citations
Semantic Scholar
Round-Based Public Transit Routing
Daniel Delling, Thomas Pajor, Renato F. Werneck
2012Transportation Science249 citations Open access
Semantic Scholar
Customizable Route Planning
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
2011The Sea205 citations
Semantic Scholar
PHAST: Hardware-Accelerated Shortest Path Trees
Daniel Delling, Andrew V. Goldberg, A. Nowatzyk, Renato F. Werneck
2011IEEE International Parallel and Distributed Processing Symposium194 citations
Semantic Scholar
Fast local search for the maximum independent set problem
D. Andrade, Maurício Resende, Renato F. Werneck
2008Journal of Heuristics194 citations
Semantic Scholar
Computing Point-to-Point Shortest Paths from External Memory
Andrew V. Goldberg, Renato F. Werneck
2005ALENEX/ANALCO184 citations
Semantic Scholar
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
C. Ribeiro, Eduardo Uchoa, Renato F. Werneck
2002INFORMS journal on computing182 citations
Semantic Scholar
Customizable Route Planning in Road Networks
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
2017Transportation Science180 citations
Semantic Scholar
Alternative routes in road networks
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2010JEAL151 citations
Semantic Scholar
Graph Partitioning with Natural Cuts
Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck
2011IEEE International Parallel and Distributed Processing Symposium150 citations
Semantic Scholar
Finding near-optimal independent sets at scale
S. Lamm, P. Sanders, Christian Schulz, Darren Strash +1 more
2015Journal of Heuristics142 citations Open access
Semantic Scholar
A hybrid multistart heuristic for the uncapacitated facility location problem
M. C. Resende, Renato F. Werneck
2006European Journal of Operational Research135 citations
Semantic Scholar
Computing classic closeness centrality, at scale
E. Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014Conference on Online Social Networks114 citations Open access
Semantic Scholar
Maximum Flows by Incremental Breadth-First Search
Andrew V. Goldberg, Sagi Hed, Haim Kaplan, R. Tarjan +1 more
2011Embedded Systems and Applications96 citations
Semantic Scholar
Journal of Graph Algorithms and Applications Finding Dominators in Practice
Loukas Georgiadis, R. Tarjan, Renato F. Werneck
87 citations
Semantic Scholar
Computing Multimodal Journeys in Practice
Daniel Delling, Julian Dibbelt, Thomas Pajor, D. Wagner +1 more
2013The Sea83 citations
Semantic Scholar
VC-Dimension and Shortest Path Algorithms
Ittai Abraham, Daniel Delling, A. Fiat, Andrew V. Goldberg +1 more
2011International Colloquium on Automata, Languages and Programming83 citations
Semantic Scholar
Better Landmarks Within Reach
Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
2007Workshop on Engineering Applications82 citations
Semantic Scholar
A fast swap-based local search procedure for location problems
M. C. Resende, Renato F. Werneck
2007Annals of Operations Research79 citations
Semantic Scholar
Highway Dimension and Provably Efficient Shortest Path Algorithms
Ittai Abraham, Daniel Delling, A. Fiat, Andrew V. Goldberg +1 more
2016Journal of the ACM75 citations
Semantic Scholar
Reach for A*: Shortest Path Algorithms with Preprocessing
Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
2006The Shortest Path Problem73 citations Open access
Semantic Scholar
Robust Distance Queries on Massive Networks
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
2014Embedded Systems and Applications69 citations
Semantic Scholar
Self-adjusting top trees
R. Tarjan, Renato F. Werneck
2005ACM-SIAM Symposium on Discrete Algorithms63 citations
Semantic Scholar
On the implementation of a swap-based local search procedure for the p -median problem ∗
M. C. Resende, Renato F. Werneck
200261 citations
Semantic Scholar
On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs
M. P. de Aragão, Renato F. Werneck
2002Workshop on Algorithm Engineering and Experimentation56 citations
Semantic Scholar
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search
Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli +2 more
2015Embedded Systems and Applications53 citations
Semantic Scholar
Faster Batched Shortest Paths in Road Networks
Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2011Algorithmic Approaches for Transportation Modeling, Optimization, and Systems53 citations
Semantic Scholar
Navigation made personal: inferring driving preferences from GPS traces
Daniel Delling, Andrew V. Goldberg, M. Goldszmidt, J. Krumm +2 more
2015SIGSPATIAL/GIS52 citations
Semantic Scholar
Dual Heuristics on the Exact Solution of Large Steiner Problems
M. P. de Aragão, Eduardo Uchoa, Renato F. Werneck
2001Electron. Notes Discret. Math.52 citations
Semantic Scholar
Faster Customization of Road Networks
Daniel Delling, Renato F. Werneck
2013The Sea51 citations
Semantic Scholar
Dynamic trees in practice
R. Tarjan, Renato F. Werneck
2007JEAL50 citations
Semantic Scholar
Accelerating Local Search for the Maximum Independent Set Problem
Jakob Dahlum, S. Lamm, P. Sanders, Christian Schulz +2 more
2016The Sea46 citations
Semantic Scholar
HLDB: location-based services in databases
Ittai Abraham, Daniel Delling, A. Fiat, Andrew V. Goldberg +1 more
2012SIGSPATIAL/GIS46 citations
Semantic Scholar
Hub Label Compression
Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2013The Sea45 citations
Semantic Scholar
Hub Labels: Theory and Practice
Daniel Delling, Andrew V. Goldberg, R. Savchenko, Renato F. Werneck
2014The Sea41 citations
Semantic Scholar
A robust and scalable algorithm for the Steiner problem in graphs
Thomas Pajor, Eduardo Uchoa, Renato F. Werneck
2014Mathematical Programming Computation39 citations Open access
Semantic Scholar
Public Transit Labeling
Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck
2015The Sea37 citations
Semantic Scholar
Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths
E. Cohen, Daniel Delling, Fabian Fuchs, Andrew V. Goldberg +2 more
2013Conference on Online Social Networks33 citations
Semantic Scholar
Customizable Point-of-Interest Queries in Road Networks
Daniel Delling, Renato F. Werneck
2013IEEE Transactions on Knowledge and Data Engineering33 citations
Semantic Scholar
Shortest-path feasibility algorithms: An experimental evaluation
B. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, R. Tarjan +1 more
2008JEAL33 citations
Semantic Scholar
Mic'2001 -4th Metaheuristics International Conference New Benchmark Instances for the Steiner Problem in Graphs
Isabel Rosseti, Marcus V. Poggi de Aragão, C. Ribeiro, Eduardo Uchoa +1 more
33 citations
Semantic Scholar
An exact combinatorial algorithm for minimum graph bisection
Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn +1 more
2014Mathematical programming29 citations Open access
Semantic Scholar
Exact Combinatorial Branch-and-Bound for Graph Bisection
Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck
2012Workshop on Algorithm Engineering and Experimentation29 citations
Semantic Scholar