☰

Renato F. Werneck, Ph.D. - Publications

Affiliations: 
2006 Princeton University, Princeton, NJ 
Area:
Data structures; graph algorithms; combinatorial optimization; computational complexity; computational geometry; parallel algorithms.
Tree Info Similar researchers PubMed Report error

51 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2018 Pajor T, Uchoa E, Werneck RF. A robust and scalable algorithm for the Steiner problem in graphs Mathematical Programming Computation. 10: 69-118. DOI: 10.1007/S12532-017-0123-4  0.626
2017 Delling D, Goldberg AV, Pajor T, Werneck RF. Customizable Route Planning in Road Networks Transportation Science. 51: 566-591. DOI: 10.1287/Trsc.2014.0579  0.383
2016 Abraham I, Delling D, Fiat A, Goldberg AV, Werneck RF. Highway Dimension and Provably Efficient Shortest Path Algorithms Journal of the Acm. 63: 41. DOI: 10.1145/2985473  0.587
2016 Lamm S, Sanders P, Schulz C, Strash D, Werneck RF. Finding near-optimal independent sets at scale Proceedings of the Workshop On Algorithm Engineering and Experiments. 2016: 138-150. DOI: 10.1007/S10732-017-9337-X  0.56
2016 Abraham I, Chechik S, Delling D, Goldberg AV, Werneck RF. On dynamic approximate shortest paths for planar graphs with worst-case costs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2: 740-753.  0.344
2015 Delling D, Pajor T, Werneck RF. Round-based public transit routing Transportation Science. 49: 591-604. DOI: 10.1287/Trsc.2014.0534  0.543
2015 Delling D, Werneck RF. Customizable point-of-interest queries in road networks Ieee Transactions On Knowledge and Data Engineering. 27: 686-698. DOI: 10.1109/Tkde.2014.2345386  0.381
2015 Delling D, Fleischman D, Goldberg AV, Razenshteyn I, Werneck RF. An exact combinatorial algorithm for minimum graph bisection Mathematical Programming. 153: 417-458. DOI: 10.1007/S10107-014-0811-Z  0.59
2015 Goldberg AV, Hed S, Kaplan H, Kohli P, Tarjan RE, Werneck RF. Faster and more dynamic maximum flow by incremental breadth-first search Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9294: 619-630. DOI: 10.1007/978-3-662-48350-3_52  0.504
2015 Delling D, Dibbelt J, Pajor T, Werneck RF. Public transit labeling Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9125: 273-285. DOI: 10.1007/978-3-319-20086-6_21  0.355
2014 Cohen E, Delling D, Pajor T, Werneck RF. Sketch-based influence maximization and computation: Scaling up with guarantees Cikm 2014 - Proceedings of the 2014 Acm International Conference On Information and Knowledge Management. 629-638. DOI: 10.1145/2661829.2662077  0.394
2014 Cohen E, Delling D, Pajor T, Werneck RF. Computing classic closeness centrality, at scale Cosn 2014 - Proceedings of the 2014 Acm Conference On Online Social Networks. 37-49. DOI: 10.1145/2660460.2660465  0.395
2014 Delling D, Goldberg AV, Pajor T, Werneck RF. Robust distance queries on massive networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8737: 321-333. DOI: 10.1007/978-3-662-44777-2_27  0.371
2014 Delling D, Goldberg AV, Savchenko R, Werneck RF. Hub labels: Theory and practice Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8504: 259-270. DOI: 10.1007/978-3-319-07959-2_22  0.435
2013 Abraham I, Delling D, Goldberg AV, Werneck RF. Alternative routes in road networks Journal of Experimental Algorithmics. 18. DOI: 10.1145/2444016.2444019  0.512
2013 Delling D, Goldberg AV, Nowatzyk A, Werneck RF. PHAST: Hardware-accelerated shortest path trees Journal of Parallel and Distributed Computing. 73: 940-952. DOI: 10.1016/J.Jpdc.2012.02.007  0.614
2013 Delling D, Werneck RF. Faster customization of road networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7933: 30-42. DOI: 10.1007/978-3-642-38527-8_5  0.3
2013 Delling D, Dibbelt J, Pajor T, Wagner D, Werneck RF. Computing multimodal journeys in practice Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7933: 260-271. DOI: 10.1007/978-3-642-38527-8_24  0.332
2012 Abraham I, Delling D, Fiat A, Goldberg AV, Werneck RF. HLDB: Location-based services in databases Gis: Proceedings of the Acm International Symposium On Advances in Geographic Information Systems. 339-348. DOI: 10.1145/2424321.2424365  0.439
2012 Uchoa E, Werneck RF. Fast local search for the steiner problem in graphs Journal of Experimental Algorithmics. 17. DOI: 10.1145/2133803.2184448  0.528
2012 Andrade DV, Resende MGC, Werneck RF. Fast local search for the maximum independent set problem Journal of Heuristics. 18: 525-547. DOI: 10.1007/S10732-012-9196-4  0.479
2012 Abraham I, Delling D, Goldberg AV, Werneck RF. Hierarchical hub labelings for shortest paths Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7501: 24-35. DOI: 10.1007/978-3-642-33090-2_4  0.34
2012 Delling D, Werneck RF. Better bounds for graph bisection Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7501: 407-418. DOI: 10.1007/978-3-642-33090-2_36  0.446
2012 Delling D, Goldberg AV, Razenshteyn I, Werneck RF. Exact combinatorial branch-and-bound for graph bisection Proceedings of the Workshop On Algorithm Engineering and Experiments. 30-44.  0.48
2011 Delling D, Goldberg AV, Werneck RF. Faster batched shortest paths in road networks Openaccess Series in Informatics. 20: 52-63. DOI: 10.4230/OASIcs.ATMOS.2011.52  0.366
2011 Georgiadis L, Kaplan H, Shafrir N, Tarjan RE, Werneck RF. Data structures for mergeable trees Acm Transactions On Algorithms. 7. DOI: 10.1145/1921659.1921660  0.689
2011 Budiu M, Delling D, Werneck RF. DryadOpt: Branch-and-bound on distributed data-parallel execution engines Proceedings - 25th Ieee International Parallel and Distributed Processing Symposium, Ipdps 2011. 1278-1289. DOI: 10.1109/IPDPS.2011.121  0.306
2011 Delling D, Goldberg AV, Razenshteyn I, Werneck RF. Graph partitioning with natural cuts Proceedings - 25th Ieee International Parallel and Distributed Processing Symposium, Ipdps 2011. 1135-1146. DOI: 10.1109/IPDPS.2011.108  0.423
2011 Goldberg AV, Hed S, Kaplan H, Tarjan RE, Werneck RF. Maximum flows by incremental breadth-First search Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6942: 457-468. DOI: 10.1007/978-3-642-23719-5_39  0.655
2011 Abraham I, Delling D, Fiat A, Goldberg AV, Werneck RF. VC-dimension and shortest path algorithms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6755: 690-699. DOI: 10.1007/978-3-642-22006-7_58  0.442
2011 Delling D, Goldberg AV, Pajor T, Werneck RF. Customizable route planning Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6630: 376-387. DOI: 10.1007/978-3-642-20662-7_32  0.346
2011 Abraham I, Delling D, Goldberg AV, Werneck RF. A hub-based labeling algorithm for shortest paths in road networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6630: 230-241. DOI: 10.1007/978-3-642-20662-7_20  0.488
2010 Abraham I, Fiat A, Goldberg AV, Werneck RF. Highway dimension, shortest paths, and provably efficient algorithms Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 782-793.  0.467
2010 Uchoa E, Werneck RF. Fast local search for Steiner trees in graphs 2010 Proceedings of the 12th Workshop On Algorithm Engineering and Experiments, Alenex 2010. 1-10.  0.453
2009 Tarjan RE, Werneck RF. Dynamic trees in practice Journal of Experimental Algorithmics. 14. DOI: 10.1145/1498698.1594231  0.632
2009 Georgiadis L, Goldberg AV, Tarjan RE, Werneck RF. An experimental study of minimum mean cycle algorithms 2009 Proceedings of the 11th Workshop On Algorithm Engineering and Experiments, Alenex 2009. 1-13.  0.733
2009 Georgiadis L, Goldberg AV, Tarjan RE, Werneck RF. An experimental study of minimum mean cycle algorithms 2009 Proceedings of the 11th Workshop On Algorithm Engineering and Experiments, Alenex 2009. 1-13.  0.548
2008 Cherkassky BV, Georgiadis L, Goldberg AV, Tarjan RE, Werneck RF. Shortest path feasibility algorithms: An experimental evaluation Proceedings of the 10th Workshop On Algorithm Engineering and Experiments and the 5th Workshop On Analytic Algorithmics and Combinatorics. 118-132. DOI: 10.1145/1498698.1537602  0.743
2007 Goldberg AV, Kaplan H, Werneck RF. Better landmarks within reach Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4525: 38-51.  0.48
2006 Georgiadis L, Tarjan RE, Werneck RF. Finding dominators in practice Journal of Graph Algorithms and Applications. 10: 69-94. DOI: 10.7155/Jgaa.00119  0.737
2006 Georgiadis L, Tarjan RE, Werneck RF. Design of data structures for mergeable trees Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 394-403. DOI: 10.1145/1109557.1109602  0.717
2006 Resende MGC, Werneck RF. A hybrid multistart heuristic for the uncapacitated facility location problem European Journal of Operational Research. 174: 54-68. DOI: 10.1016/J.Ejor.2005.02.046  0.434
2006 Fukasawa R, Longo H, Lysgaard J, De Aragão MP, Reis M, Uchoa E, Werneck RF. Robust branch-and-cut-and-price for the capacitated vehicle routing problem Mathematical Programming. 106: 491-511. DOI: 10.1007/S10107-005-0644-X  0.562
2006 Goldberg AV, Kaplan H, Werneck RF. Reach for A*: Efficient point-to-point shortest path algorithms Proceedings of the 8th Workshop On Algorithm Engineering and Experiments and the 3rd Workshop On Analytic Algorithms and Combinatorics. 2006: 129-143.  0.52
2005 Goldberg AV, Werneck RF. Computing point-to-point shortest paths from external memory Proceedings of the Seventh Workshop On Algorithm Engineering and Experiments and the Second Workshop On Analytic Algorithms and Combinatorics. 26-40.  0.418
2005 Tarjan RE, Werneck RF. Self-adjusting top trees Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 813-822.  0.656
2004 Resende MGC, Werneck RF. A Hybrid Heuristic for the p-Median Problem Journal of Heuristics. 10: 59-88. DOI: 10.1023/B:Heur.0000019986.96257.50  0.398
2004 Georgiadis L, Werneck RF, Tarjan RE, Triantafyllis S, August DI. Finding dominators in practice Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3221: 677-688.  0.737
2002 Ribeiro CC, Uchoa E, Werneck RF. A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs Informs Journal On Computing. 14: 228-246. DOI: 10.1287/Ijoc.14.3.228.116  0.493
2002 de Aragão MP, Werneck RF. On the implementation of mst-based heuristics for the steiner problem in graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2409: 1-15.  0.568
2001 de Aragão MP, Uchoa E, Werneck RF. Dual Heuristics on the Exact Solution of Large Steiner Problems Electronic Notes in Discrete Mathematics. 7: 150-153. DOI: 10.1016/S1571-0653(04)00247-1  0.471
Show low-probability matches.