Publications
Journal Articles
- A.V. Goldberg, H. Kaplan, and R.F. Werneck, Reach for A*: Shortest Path Algorithms with Preprocessing, in The Shortest Path Problem: Ninth DIMACS Implementation Challenge, pp. 93–140, AMS, 2009
- Ricardo Fukasawa, Humberto Longo, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo Reis, Eduardo Uchoa, and Renato F. Werneck, Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem, in Mathematical Programming, vol. 106, no. 3, pp. 491–511, Springer-Verlag, May 2006
- Loukas Georgiadis, Robert E. Tarjan, and Renato F. Werneck, Finding Dominators in Practice, in Journal of Graph Algorithms and Applications, vol. 10, no. 1, pp. 69-94, 2006
- Mauricio G. C. Resende and Renato F. Werneck, A hybrid heuristic for the p-median problem, in Journal of Heuristics, vol. 10, no. 1, pp. 59–88, 2004
- Celso C. Ribeiro, Eduardo Uchoa, and Renato F. Werneck, A hybrid GRASP with perturbations for the Steiner problem in graphs, in INFORMS Journal on Computing, vol. 14, no. 3, pp. 228–246, 2002
- Renato F. Werneck and J. C. Setubal, Finding Minimum Congestion Spanning Trees, in ACM Journal of Experimental Algorithmics, vol. 5, 2000
Book Chapters
- A.V. Goldberg, H. Kaplan, and R.F. Werneck, Reach for A*: Shortest Path Algorithms with Preprocessing, in The Shortest Path Problem: Ninth DIMACS Implementation Challenge, pp. 93–140, AMS, 2009
Proceedings
- Ittai Abraham, Amos Fiat, Andrew V. Goldberg, and Renato F. Werneck, Highway Dimension, Shortest Paths, and Provably Efficient Algorithms, in Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA10), Society for Industrial and Applied Mathematics, 2010
- Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Werneck, and Udi Wieder, Virtual Ring Routing Trends, in DISC 2009, Springer Verlag, 23 September 2009
- L. Georgiadis, A.V. Goldberg, R.E. Tarjan, and R.F. Werneck, An Experimental Study of Minimum Mean Cycle Algorithms, in Proc. 6th International Workshop on Algorithm Engineering and Experiments, SIAM, 2009
- Diogo V. Andrade, Mauricio G. C. Resende, and Renato F. Werneck, Fast Local Search for the Maximum Independent Set Problem, in International Workshop on Experimental Algorithms (WEA), Springer, Provincetown, MA, May 2008
- B.V. Cherkassky, L. Georgiadis, A.V. Goldberg, R.E. Tarjan, and Renato F. Werneck, Shortest Path Feasibility Algorithms: an Experimental Evaluation, in Proc. 6th International Workshop on Algorithm Engineering and Experiments, SIAM, 2008
- Andrew V. Goldberg, Haim Kaplan, and Renato F. Werneck, Better Landmarks within Reach, in Workshop on Experimental Algorithms (WEA), Rome, Italy, June 2007
- Robert E. Tarjan and Renato F. Werneck, Dynamic Trees in Practice, in International Workshop on Experimental Algorithms (WEA), Springer, Rome, Italy, June 2007
- A.V. Goldberg, Haim Kaplan, and Renato F. Werneck, Reach for A*: Efficient Point-to-Point Shortest Path Algorithms, in SIAM Workshop on Algorithms Engineering and Experimentation (ALENEX 06), Society for Industrial and Applied Mathematics, Miami, FL, January 2006
- Robert E. Tarjan, Renato F. Werneck, and Loukas Georgiadis, Design of Data Structures for Mergeable Trees, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, January 2006
- Robert E. Tarjan and Renato F. Werneck, Self-Adjusting Top Trees, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005
- A. V. Goldberg and R. Werneck, Computing Point-to-Point Shortest Paths from External Memory, in SIAM Workshop on Algorithms Engineering and Experimentation (ALENEX '05), Vancouver, Canada, 2005
- Mauricio G. C. Resende and Renato F. Werneck, On the implementation of a swap-based local search procedure for the p-median problem, in Proceedings of the 5th Workshop on Algorithm Engineering and Experiments (ALENEX), SIAM, 2003
- M. Poggi de Aragão and Renato F. Werneck, On the Implementation of MST-based heuristics for the Steiner problem in graphs, in Proceedings of the Fourth International Workshop on Algorithm Engineering and Experiments (ALENEX'02), Springer-Verlag, 2002
- M. Poggi de Aragão, Eduardo Uchoa, and Renato F. Werneck, Dual Heuristics on the Exact Solution of Large Steiner Problems, in Proceedings of the Brazilian Symposium on Graphs, Algoritms and Combinatorics, Fortaleza, Brazil, 2001
- M. Poggi de Aragão, Celso C. Ribeiro, Eduardo Uchoa, and Renato F. Werneck, Hybrid Local Search for the Steiner problem in graphs, in Extended Abstracts of the 4th Metaheuristics International Conference, Porto, Portugal, 2001
- I. Rosseti, M. Poggi de Aragão, Celso C. Ribeiro, Eduardo Uchoa, and Renato F. Werneck, New benchmark instances for the Steiner problem in graphs, in Extended Abstracts of the 4th Metaheuristics International Conference, Porto, Portugal, 2001
- Celso C. Ribeiro, Eduardo Uchoa, and Renato F. Werneck, A hybrid GRASP with perturbations and adaptive path-relinking for the Steiner problem in graphs, in Proceedings of the Workshop on Algorithm Engineering as a New Paradigm, 2000
Other Publications
- Mauricio G. C. Resende and Renato F. Werneck, A fast swap-based local search procedure for location problems, no. TD-5R3KBH, 2003
- Renato F. Werneck, Steiner Problem in Graphs: Primal, Dual, and Exact Algorithms, 2001
- Renato F. Werneck and João C. Setubal, A program for building contig scaffolds in double-barrelled shotgun genome sequencing, no. IC–01-005, 2001
- Renato F. Werneck and Celso C. Ribeiro, Sorting Methods for Small Arrays, no. MCC 23-00, 2000
