default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRenato F. Werneck
Renato Fonseca F. Werneck
Person information
- affiliation: Amazon, USA
- affiliation (former): Microsoft Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2018
[j24]Thomas Pajor, Eduardo Uchoa
, Renato F. Werneck:
A robust and scalable algorithm for the Steiner problem in graphs. Math. Program. Comput. 10(1): 69-118 (2018)- 2017
- [j23]Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding near-optimal independent sets at scale. J. Heuristics 23(4): 207-229 (2017) - [j22]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks. Transp. Sci. 51(2): 566-591 (2017) - 2016
- [j21]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck:
Highway Dimension and Provably Efficient Shortest Path Algorithms. J. ACM 63(5): 41:1-41:26 (2016) - [c52]Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding Near-Optimal Independent Sets at Scale. ALENEX 2016: 138-150 - [c51]Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. SODA 2016: 740-753 - [c50]Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Accelerating Local Search for the Maximum Independent Set Problem. SEA 2016: 118-133 - [p1]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. Algorithm Engineering 2016: 19-80 - [e2]Marc Goerigk, Renato F. Werneck:
16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2016, August 25, 2016, Aarhus, Denmark. OASIcs 54, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-021-7 [contents] - [r3]Renato F. Werneck:
Dynamic Trees. Encyclopedia of Algorithms 2016: 605-609 - [r2]Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Hub Labeling (2-Hop Labeling). Encyclopedia of Algorithms 2016: 932-938 - [i9]Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Accelerating Local Search for the Maximum Independent Set Problem. CoRR abs/1602.01659 (2016) - 2015
- [j20]Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck:
An exact combinatorial algorithm for minimum graph bisection. Math. Program. 153(2): 417-458 (2015) - [j19]Daniel Delling, Renato F. Werneck:
Customizable Point-of-Interest Queries in Road Networks. IEEE Trans. Knowl. Data Eng. 27(3): 686-698 (2015) - [j18]Daniel Delling, Thomas Pajor, Renato F. Werneck:
Round-Based Public Transit Routing. Transp. Sci. 49(3): 591-604 (2015) - [c49]Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck:
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. ESA 2015: 619-630 - [c48]Daniel Delling, Andrew V. Goldberg, Moisés Goldszmidt, John Krumm, Kunal Talwar, Renato F. Werneck:
Navigation made personal: inferring driving preferences from GPS traces. SIGSPATIAL/GIS 2015: 31:1-31:9 - [c47]Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck:
Public Transit Labeling. SEA 2015: 273-285 - [i8]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. CoRR abs/1504.05140 (2015) - [i7]Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck:
Public Transit Labeling. CoRR abs/1505.01446 (2015) - [i6]Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding Near-Optimal Independent Sets at Scale. CoRR abs/1509.00764 (2015) - 2014
- [c46]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CIKM 2014: 629-638 - [c45]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Computing classic closeness centrality, at scale. COSN 2014: 37-50 - [c44]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Robust Distance Queries on Massive Networks. ESA 2014: 321-333 - [c43]Daniel Delling, Moritz Kobitzsch, Renato F. Werneck:
Customizing Driving Directions with GPUs. Euro-Par 2014: 728-739 - [c42]Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck:
Hub Labels: Theory and Practice. SEA 2014: 259-270 - [i5]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CoRR abs/1408.6282 (2014) - [i4]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Computing Classic Closeness Centrality, at Scale. CoRR abs/1409.0035 (2014) - [i3]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Timed Influence: Computation and Maximization. CoRR abs/1410.6976 (2014) - [i2]Thomas Pajor, Eduardo Uchoa, Renato F. Werneck:
A Robust and Scalable Algorithm for the Steiner Problem in Graphs. CoRR abs/1412.2787 (2014) - 2013
- [j17]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013) - [j16]Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato F. Werneck:
PHAST: Hardware-accelerated shortest path trees. J. Parallel Distributed Comput. 73(7): 940-952 (2013) - [c41]Edith Cohen, Daniel Delling, Fabian Fuchs, Andrew V. Goldberg, Moisés Goldszmidt, Renato F. Werneck:
Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths. COSN 2013: 131-142 - [c40]Daniel Delling, Renato F. Werneck:
Customizable point-of-interest queries in road networks. SIGSPATIAL/GIS 2013: 490-493 - [c39]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks (Extended Abstract). SOCS 2013: 212 - [c38]Daniel Delling, Thomas Pajor, Renato F. Werneck:
Round-Based Public Transit Routing (Extended Abstract). SOCS 2013: 213 - [c37]Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Hub Label Compression. SEA 2013: 18-29 - [c36]Daniel Delling, Renato F. Werneck:
Faster Customization of Road Networks. SEA 2013: 30-42 - [c35]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 J. Exp. Algorithmics 17(1) (2012) - [c34]Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck:
Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX 2012: 30-44 - [c33]Daniel Delling, Thomas Pajor, Renato Fonseca F. Werneck:
Round-Based Public Transit Routing. ALENEX 2012: 130-140 - [c32]Daniel Delling, Moritz Kobitzsch, Dennis Luxen, Renato Fonseca F. Werneck:
Robust Mobile Route Planning with Limited Connectivity. ALENEX 2012: 150-159 - [c31]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Hierarchical Hub Labelings for Shortest Paths. ESA 2012: 24-35 - [c30]Daniel Delling, Renato Fonseca F. Werneck:
Better Bounds for Graph Bisection. ESA 2012: 407-418 - [c29]Renato F. Werneck:
Real-world route planning. CTS@SIGSPATIAL 2012: 1 - [c28]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 Inf. Technol. 53(6): 294-301 (2011) - [j12]Matthias Müller-Hannemann, Renato Fonseca F. Werneck:
Introduction to special issue ALENEX'11. ACM J. Exp. Algorithmics 17(1) (2011) - [j11]Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Data structures for mergeable trees. ACM Trans. Algorithms 7(2): 14:1-14:30 (2011) - [c27]Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Faster Batched Shortest Paths in Road Networks. ATMOS 2011: 52-63 - [c26]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 - [c25]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
VC-Dimension and Shortest Path Algorithms. ICALP (1) 2011: 690-699 - [c24]Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato Fonseca F. Werneck:
PHAST: Hardware-Accelerated Shortest Path Trees. IPDPS 2011: 921-931 - [c23]Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck:
Graph Partitioning with Natural Cuts. IPDPS 2011: 1135-1146 - [c22]Mihai Budiu, Daniel Delling, Renato Fonseca F. Werneck:
DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines. IPDPS 2011: 1278-1289 - [c21]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 - [c20]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:
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, ISBN 978-1-61197-291-7 [contents] - 2010
- [c19]Eduardo Uchoa, Renato Fonseca F. Werneck:
Fast Local Search for Steiner Trees in Graphs. ALENEX 2010: 1-10 - [c18]Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. SODA 2010: 782-793 - [c17]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 J. Exp. Algorithmics 14 (2009) - [j9]Robert Endre Tarjan, Renato Fonseca F. Werneck:
Dynamic trees in practice. ACM J. Exp. Algorithmics 14 (2009) - [c16]Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck:
An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX 2009: 1-13 - [c15]Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder:
Virtual Ring Routing Trends. DISC 2009: 392-406 - 2008
- [c14]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 - [c13]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]Renato Fonseca F. Werneck:
Dynamic Trees. Encyclopedia of Algorithms 2008 - 2007
- [j8]Mauricio G. C. Resende, Renato Fonseca F. Werneck:
A fast swap-based local search procedure for location problems. Ann. Oper. Res. 150(1): 205-230 (2007) - [c12]Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck:
Better Landmarks Within Reach. WEA 2007: 38-51 - [c11]Robert Endre Tarjan, Renato Fonseca F. Werneck:
Dynamic Trees in Practice. WEA 2007: 80-93 - [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. Eur. J. Oper. Res. 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 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): 491-511 (2006) - [c10]Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck:
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. ALENEX 2006: 129-143 - [c9]Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck:
Reach for A*: Shortest Path Algorithms with Preprocessing. The Shortest Path Problem 2006: 93-139 - [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]Robert Endre Tarjan, Renato Fonseca F. Werneck:
Self-adjusting top trees. SODA 2005: 813-822 - 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 J. Comput. 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. Electron. Notes Discret. Math. 7: 150-153 (2001) - 2000
- [j1]Renato Fonseca F. Werneck, João C. Setubal:
Finding Minimum Congestion Spanning Trees. ACM J. Exp. 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. WAE 1999: 60-71
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-17 00:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
