Renato Werneck
RESEARCHER
.
I joined Microsoft Research in 2006. I work mostly on Algorithms, Algorithm Engineering and Combinatorial Optimization.
News: I'm an organizer of the 11th DIMACS Implementation Challenge, on Steiner Tree problems.
A more complete list of publications can be found here.
Publications
- Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck, Hub Label Compression, in Proc. 12th International Symposium on Experimental Algorithms, Springer Verlag, 2013
- Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, and Renato F. Werneck, HLDB: Location-Based Services in Databases, in SIGSPATIAL GIS, ACM, November 2012
- Diogo V. Andrade, Mauricio G. C. Resende, and Renato F. Werneck, Fast Local Search for the Maximum Independent Set Problem, in Journal of Heuristics, vol. 18, no. 4, pp. 525-547, Springer, August 2012
- Daniel Delling and Renato Werneck, Better Bounds for Graph Bisection, no. MSR-TR-2012-69, July 2012
- Eduardo Uchoa and Renato F. Werneck, Fast Local Search for the Steiner Problem in Graphs, in ACM Journal of Experimental Algorithmics, vol. 17, no. 1, pp. 2.2, ACM, July 2012
- Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, and Renato F. Werneck, HLDB: Location-Based Services in Databases, no. MSR-TR-2012-59, June 2012
- Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck, Hierarchical Hub Labelings for Shortest Paths, no. MSR-TR-2012-46, April 2012
- Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, and Renato F. Werneck, PHAST: Hardware-accelerated shortest path trees, in Journal of Parallel and Distributed Computing, Elsevier, 2012
- Daniel Delling, Andrew V. Goldberg, Ilya Razenshteyn, and Renato F. Werneck, Exact Combinatorial Branch-and-Bound for Graph Bisection, in Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12), Society for Industrial and Applied Mathematics, 2012
- Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck, Hierarchical Hub Labelings for Shortest Paths, in Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12), Springer, 2012
- Daniel Delling, Moritz Kobitzsch, Dennis Luxen, and Renato F. Werneck, Robust Mobile Route Planning with Limited Connectivity, in Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12), Society for Industrial and Applied Mathematics, 2012
- Daniel Delling, Thomas Pajor, and Renato F. Werneck, Round-Based Public Transit Routing, in Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12), Society for Industrial and Applied Mathematics, 2012
- Daniel Delling and Renato F. Werneck, Better Bounds for Graph Bisection, in Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12), Springer, 2012
- Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck, A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks, in Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11), Springer Verlag, May 2011
- Daniel Delling, Andrew V. Goldberg, Thomas Pajor, and Renato F. Werneck, Customizable Route Planning, in Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11), Springer Verlag, May 2011
- Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert E. Tarjan, and Renato F. Werneck, Data Structures for Mergeable Trees, in ACM Transaction on Algorithms, vol. 7, no. 2, pp. 14:1-14:30, ACM, March 2011
- D. Delling, A.V. Goldberg, and R.F. Werneck, Shortest Paths in Road Networks: From Practice to Theory and Back, in Information Technology, vol. 53, no. 6, pp. 294-301, 2011
- Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, and Renato F. Werneck, VC-Dimension and Shortest Path Algorithms, in Proc. ICALP 2011, Springer Verlag, 2011
- Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, and Renato F. Werneck, PHAST: Hardware-Accelerated Shortest Path Trees, in 25th International Parallel and Distributed Processing Symposium (IPDPS'11), IEEE, 2011
- Daniel Delling, Andrew V. Goldberg, Ilya Razenshteyn, and Renato F. Werneck, Graph Partitioning with Natural Cuts, in 25th International Parallel and Distributed Processing Symposium (IPDPS'11), IEEE, 2011
- A. V. Goldberg, S. Hed, H. Kaplan, R. E. Tarjan, and R. F. Werneck, Maximum Flows by Incremental Breadth-First Search, in 19th European Symposium on Algorithms (ESA 2011), Springer Verlag, 2011
- Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck, Faster Batched Shortest Paths in Road Networks, in Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11), OpenAccess Series in Informatics, 2011
- Mihai Budiu, Daniel Delling, and Renato F. Werneck, DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines, in 25th International Parallel and Distributed Processing Symposium (IPDPS'11), IEEE, 2011
- Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck, A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks, no. MSR-TR-2010-165, December 2010
- Daniel Delling, Andrew V. Goldberg, Ilya Razenshteyn, and Renato F. Werneck, Graph Partitioning with Natural Cuts, no. MSR-TR-2010-164, December 2010