Renato Fonseca F. Werneck

Publication Activity (10 Years)

Years Active: 1999-2012
Publications (10 Years): 0

Top Topics

Top Venues

ACM J. Exp. Algorithmics

Publications

Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck
Fast local search for the maximum independent set problem. J. Heuristics 18 (4) (2012)
Daniel Delling, Renato Fonseca F. Werneck
Better Bounds for Graph Bisection. ESA (2012)
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
Hierarchical Hub Labelings for Shortest Paths. ESA (2012)
Eduardo Uchoa, Renato Fonseca F. Werneck
Fast local search for the steiner problem in graphs. ACM J. Exp. Algorithmics 17 (1) (2012)
Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX (2012)
Daniel Delling, Thomas Pajor, Renato Fonseca F. Werneck
Round-Based Public Transit Routing. ALENEX (2012)
Daniel Delling, Moritz Kobitzsch, Dennis Luxen, Renato Fonseca F. Werneck
Robust Mobile Route Planning with Limited Connectivity. ALENEX (2012)
Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
HLDB: location-based services in databases. SIGSPATIAL/GIS (2012)
Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
Faster Batched Shortest Paths in Road Networks. ATMOS (2011)
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck
Customizable Route Planning. SEA (2011)
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
Data structures for mergeable trees. ACM Trans. Algorithms 7 (2) (2011)
Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck
Maximum Flows by Incremental Breadth-First Search. ESA (2011)
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. SEA (2011)
Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
Graph Partitioning with Natural Cuts. IPDPS (2011)
Mihai Budiu, Daniel Delling, Renato Fonseca F. Werneck
DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines. IPDPS (2011)
Matthias Müller-Hannemann, Renato Fonseca F. Werneck
Introduction to special issue ALENEX'11. ACM J. Exp. Algorithmics 17 (1) (2011)
Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
Shortest Paths in Road Networks: From Practice to Theory and Back. it Inf. Technol. 53 (6) (2011)
Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato Fonseca F. Werneck
PHAST: Hardware-Accelerated Shortest Path Trees. IPDPS (2011)
Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
VC-Dimension and Shortest Path Algorithms. ICALP (1) (2011)
Eduardo Uchoa, Renato Fonseca F. Werneck
Fast Local Search for Steiner Trees in Graphs. ALENEX (2010)
Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. SODA (2010)
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
Alternative Routes in Road Networks. SEA (2010)
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
Shortest-path feasibility algorithms: An experimental evaluation. ACM J. Exp. Algorithmics 14 (2009)
Robert Endre Tarjan, Renato Fonseca F. Werneck
Dynamic trees in practice. ACM J. Exp. Algorithmics 14 (2009)
Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder
Virtual Ring Routing Trends. DISC (2009)
Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX (2009)
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
Shortest Path Feasibility Algorithms: An Experimental Evaluation. ALENEX (2008)
Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck
Fast Local Search for the Maximum Independent Set Problem. WEA (2008)
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
Data Structures for Mergeable Trees CoRR (2007)
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck
Better Landmarks Within Reach. WEA (2007)
Robert Endre Tarjan, Renato Fonseca F. Werneck
Dynamic Trees in Practice. WEA (2007)
Mauricio G. C. Resende, Renato Fonseca F. Werneck
A fast swap-based local search procedure for location problems. Ann. Oper. Res. 150 (1) (2007)
Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck
Finding Dominators in Practice. J. Graph Algorithms Appl. 10 (1) (2006)
Ricardo Fukasawa, Humberto J. Longo, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo L. Reis, Eduardo Uchoa, Renato Fonseca F. Werneck
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. Math. Program. 106 (3) (2006)
Mauricio G. C. Resende, Renato Fonseca F. Werneck
A hybrid multistart heuristic for the uncapacitated facility location problem. Eur. J. Oper. Res. 174 (1) (2006)
Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck
Design of data structures for mergeable trees. SODA (2006)
Robert Endre Tarjan, Renato Fonseca F. Werneck
Self-adjusting top trees. SODA (2005)
Andrew V. Goldberg, Renato Fonseca F. Werneck
Computing Point-to-Point Shortest Paths from External Memory. ALENEX/ANALCO (2005)
Loukas Georgiadis, Renato Fonseca F. Werneck, Robert Endre Tarjan, Spyridon Triantafyllis, David I. August
Finding Dominators in Practice. ESA (2004)
Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo L. Reis, Eduardo Uchoa, Renato Fonseca F. Werneck
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. IPCO (2004)
Mauricio G. C. Resende, Renato Fonseca F. Werneck
A Hybrid Heuristic for the p-Median Problem. J. Heuristics 10 (1) (2004)
Mauricio G. C. Resende, Renato Fonseca F. Werneck
On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem. ALENEX (2003)
Celso C. Ribeiro, Eduardo Uchoa, Renato Fonseca F. Werneck
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs. INFORMS J. Comput. 14 (3) (2002)
Marcus Poggi de Aragão, Renato Fonseca F. Werneck
On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs. ALENEX (2002)
Marcus Poggi de Aragão, Eduardo Uchoa, Renato Fonseca F. Werneck
Dual Heuristics on the Exact Solution of Large Steiner Problems. Electron. Notes Discret. Math. 7 (2001)
Renato Fonseca F. Werneck, João C. Setubal
Finding Minimum Congestion Spanning Trees. ACM J. Exp. Algorithmics 5 (2000)
Renato Fonseca F. Werneck, João C. Setubal, Arlindo Flávio da Conceição
Finding Minimum Congestion Spanning Trees. WAE (1999)