Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Renato F. Werneck
Renato Fonseca F. Werneck
Author information
- affiliation: Microsoft Research
2010 – today
- 2013
[c35]- [c34]
- [c33]Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck: Computing Multimodal Journeys in Practice. SEA 2013: 260-271
- 2012
- [j15]Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck: Fast local search for the maximum independent set problem. J. Heuristics 18(4): 525-547 (2012)
- [j14]Eduardo Uchoa, Renato Fonseca F. Werneck: Fast local search for the steiner problem in graphs. ACM Journal of Experimental Algorithmics 17(1) (2012)
- [c32]Daniel Delling, Andrew V. Goldberg, Ilya Razenshteyn, Renato Fonseca F. Werneck: Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX 2012: 30-44
- [c31]Daniel Delling, Thomas Pajor, Renato Fonseca F. Werneck: Round-Based Public Transit Routing. ALENEX 2012: 130-140
- [c30]Daniel Delling, Moritz Kobitzsch, Dennis Luxen, Renato Fonseca F. Werneck: Robust Mobile Route Planning with Limited Connectivity. ALENEX 2012: 150-159
- [c29]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: Hierarchical Hub Labelings for Shortest Paths. ESA 2012: 24-35
- [c28]
- [c27]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck: HLDB: location-based services in databases. SIGSPATIAL/GIS 2012: 339-348
- 2011
- [j13]Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: Shortest Paths in Road Networks: From Practice to Theory and Back. it - Information Technology 53(6): 294-301 (2011)
- [j12]Matthias Müller-Hannemann, Renato Fonseca F. Werneck: Introduction to special issue ALENEX'11. ACM Journal of Experimental Algorithmics 17(1) (2011)
- [j11]Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck: Data structures for mergeable trees. ACM Transactions on Algorithms 7(2): 14 (2011)
- [c26]Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: Faster Batched Shortest Paths in Road Networks. ATMOS 2011: 52-63
- [c25]Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck: Maximum Flows by Incremental Breadth-First Search. ESA 2011: 457-468
- [c24]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck: VC-Dimension and Shortest Path Algorithms. ICALP (1) 2011: 690-699
- [c23]Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato Fonseca F. Werneck: PHAST: Hardware-Accelerated Shortest Path Trees. IPDPS 2011: 921-931
- [c22]Daniel Delling, Andrew V. Goldberg, Ilya Razenshteyn, Renato Fonseca F. Werneck: Graph Partitioning with Natural Cuts. IPDPS 2011: 1135-1146
- [c21]Mihai Budiu, Daniel Delling, Renato Fonseca F. Werneck: DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines. IPDPS 2011: 1278-1289
- [c20]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. SEA 2011: 230-241
- [c19]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck: Customizable Route Planning. SEA 2011: 376-387
- [e1]Matthias Müller-Hannemann, Renato Fonseca F. Werneck (Eds.): Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2011, Holiday Inn San Francisco Golden Gateway, San Francisco, California, USA, January 22, 2011. SIAM 2011
- 2010
- [c18]Eduardo Uchoa, Renato Fonseca F. Werneck: Fast Local Search for Steiner Trees in Graphs. ALENEX 2010: 1-10
- [c17]Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck: Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. SODA 2010: 782-793
- [c16]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: Alternative Routes in Road Networks. SEA 2010: 23-34
2000 – 2009
- 2009
- [j10]Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck: Shortest-path feasibility algorithms: An experimental evaluation. ACM Journal of Experimental Algorithmics 14 (2009)
- [j9]Robert Endre Tarjan, Renato Fonseca F. Werneck: Dynamic trees in practice. ACM Journal of Experimental Algorithmics 14 (2009)
- [c15]Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck: An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX 2009: 1-13
- [c14]Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder: Virtual Ring Routing Trends. DISC 2009: 392-406
- 2008
- [c13]Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck: Shortest Path Feasibility Algorithms: An Experimental Evaluation. ALENEX 2008: 118-132
- [c12]Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck: Fast Local Search for the Maximum Independent Set Problem. WEA 2008: 220-234
- [r1]
- 2007
- [j8]Mauricio G. C. Resende, Renato Fonseca F. Werneck: A fast swap-based local search procedure for location problems. Annals OR 150(1): 205-230 (2007)
- [c11]Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck: Better Landmarks Within Reach. WEA 2007: 38-51
- [c10]
- [i1]Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck: Data Structures for Mergeable Trees. CoRR abs/0711.1682 (2007)
- 2006
- [j7]Mauricio G. C. Resende, Renato Fonseca F. Werneck: A hybrid multistart heuristic for the uncapacitated facility location problem. European Journal of Operational Research 174(1): 54-68 (2006)
- [j6]Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck: Finding Dominators in Practice. J. Graph Algorithms Appl. 10(1): 69-94 (2006)
- [j5]Ricardo Fukasawa, Humberto 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): 491-511 (2006)
- [c9]Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck: Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. ALENEX 2006: 129-143
- [c8]Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck: Design of data structures for mergeable trees. SODA 2006: 394-403
- 2005
- [c7]Andrew V. Goldberg, Renato Fonseca F. Werneck: Computing Point-to-Point Shortest Paths from External Memory. ALENEX/ANALCO 2005: 26-40
- [c6]
- 2004
- [j4]Mauricio G. C. Resende, Renato Fonseca F. Werneck: A Hybrid Heuristic for the p-Median Problem. J. Heuristics 10(1): 59-88 (2004)
- [c5]Loukas Georgiadis, Renato Fonseca F. Werneck, Robert Endre Tarjan, Spyridon Triantafyllis, David I. August: Finding Dominators in Practice. ESA 2004: 677-688
- [c4]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: 1-15
- 2003
- [c3]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: 119-127
- 2002
- [j3]Celso C. Ribeiro, Eduardo Uchoa, Renato Fonseca F. Werneck: A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs. INFORMS Journal on Computing 14(3): 228-246 (2002)
- [c2]Marcus Poggi de Aragão, Renato Fonseca F. Werneck: On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs. ALENEX 2002: 1-15
- 2001
- [j2]Marcus Poggi de Aragão, Eduardo Uchoa, Renato Fonseca F. Werneck: Dual Heuristics on the Exact Solution of Large Steiner Problems. Electronic Notes in Discrete Mathematics 7: 150-153 (2001)
- 2000
- [j1]Renato Fonseca F. Werneck, João C. Setubal: Finding Minimum Congestion Spanning Trees. ACM Journal of Experimental Algorithmics 5: 11 (2000)
1990 – 1999
- 1999
- [c1]Renato Fonseca F. Werneck, João C. Setubal, Arlindo Flávio da Conceição: Finding Minimum Congestion Spanning Trees. Algorithm Engineering 1999: 60-71
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-23 22:16 CEST by the dblp team