Renato Werneck
RESEARCHER
.
I joined Microsoft Research in 2006. I work mostly on Algorithms, Algorithm Engineering and Combinatorial Optimization.
A more complete list of publications can be found here.
Publications
- 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
- 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
- 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
- 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
- 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
- Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Werneck, and Udi Wieder, Virtual Ring Routing Trends, in DISC 2009, Springer Verlag, 23 September 2009
- 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
