Renato Fonseca F. Werneck

49 papers A* 3A 17B 4C 1Journal 16Unranked 7

Year	Rank	Type	Title / Venue / Authors
2012	A	`conf`	Better Bounds for Graph Bisection. ESA Daniel Delling, Renato Fonseca F. Werneck
2012	A	`conf`	Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
2012	J	`jnl`	Fast local search for the maximum independent set problem. J. Heuristics Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck
2012	J	`jnl`	Fast local search for the steiner problem in graphs. ACM J. Exp. Algorithmics Eduardo Uchoa, Renato Fonseca F. Werneck
2012	—	`conf`	HLDB: location-based services in databases. SIGSPATIAL/GIS Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
2012	A	`conf`	Hierarchical Hub Labelings for Shortest Paths. ESA Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2012	A	`conf`	Robust Mobile Route Planning with Limited Connectivity. ALENEX Daniel Delling, Moritz Kobitzsch, Dennis Luxen, Renato Fonseca F. Werneck
2012	A	`conf`	Round-Based Public Transit Routing. ALENEX Daniel Delling, Thomas Pajor, Renato Fonseca F. Werneck
2011	B	`conf`	A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. SEA Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2011	B	`conf`	Customizable Route Planning. SEA Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck
2011	J	`jnl`	Data structures for mergeable trees. ACM Trans. Algorithms Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
2011	A	`conf`	DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines. IPDPS Mihai Budiu, Daniel Delling, Renato Fonseca F. Werneck
2011	C	`conf`	Faster Batched Shortest Paths in Road Networks. ATMOS Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2011	A	`conf`	Graph Partitioning with Natural Cuts. IPDPS Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
2011	J	`jnl`	Introduction to special issue ALENEX'11. ACM J. Exp. Algorithmics Matthias Müller-Hannemann, Renato Fonseca F. Werneck
2011	A	`conf`	Maximum Flows by Incremental Breadth-First Search. ESA Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck
2011	A	`conf`	PHAST: Hardware-Accelerated Shortest Path Trees. IPDPS Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato Fonseca F. Werneck
2011	A	`ed.`	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 ALENEX Matthias Müller-Hannemann, Renato Fonseca F. Werneck
2011	J	`jnl`	Shortest Paths in Road Networks: From Practice to Theory and Back. it Inf. Technol. Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2011	—	`conf`	VC-Dimension and Shortest Path Algorithms. ICALP (1) Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
2010	B	`conf`	Alternative Routes in Road Networks. SEA Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2010	A	`conf`	Fast Local Search for Steiner Trees in Graphs. ALENEX Eduardo Uchoa, Renato Fonseca F. Werneck
2010	A*	`conf`	Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. SODA Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
2009	A	`conf`	An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2009	J	`jnl`	Dynamic trees in practice. ACM J. Exp. Algorithmics Robert Endre Tarjan, Renato Fonseca F. Werneck
2009	J	`jnl`	Shortest-path feasibility algorithms: An experimental evaluation. ACM J. Exp. Algorithmics Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2009	A	`conf`	Virtual Ring Routing Trends. DISC Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder
2008	—	`ch.`	Dynamic Trees. Encyclopedia of Algorithms Renato Fonseca F. Werneck
2008	—	`conf`	Fast Local Search for the Maximum Independent Set Problem. WEA Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck
2008	A	`conf`	Shortest Path Feasibility Algorithms: An Experimental Evaluation. ALENEX Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2007	J	`jnl`	A fast swap-based local search procedure for location problems. Ann. Oper. Res. Mauricio G. C. Resende, Renato Fonseca F. Werneck
2007	—	`conf`	Better Landmarks Within Reach. WEA Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck
2007	J	`jnl`	Data Structures for Mergeable Trees CoRR Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
2007	—	`conf`	Dynamic Trees in Practice. WEA Robert Endre Tarjan, Renato Fonseca F. Werneck
2006	J	`jnl`	A hybrid multistart heuristic for the uncapacitated facility location problem. Eur. J. Oper. Res. Mauricio G. C. Resende, Renato Fonseca F. Werneck
2006	A*	`conf`	Design of data structures for mergeable trees. SODA Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck
2006	J	`jnl`	Finding Dominators in Practice. J. Graph Algorithms Appl. Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck
2006	J	`jnl`	Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. Math. Program. Ricardo Fukasawa, Humberto J. Longo, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo L. Reis, Eduardo Uchoa, Renato Fonseca F. Werneck
2005	—	`conf`	Computing Point-to-Point Shortest Paths from External Memory. ALENEX/ANALCO Andrew V. Goldberg, Renato Fonseca F. Werneck
2005	A*	`conf`	Self-adjusting top trees. SODA Robert Endre Tarjan, Renato Fonseca F. Werneck
2004	J	`jnl`	A Hybrid Heuristic for the p-Median Problem. J. Heuristics Mauricio G. C. Resende, Renato Fonseca F. Werneck
2004	A	`conf`	Finding Dominators in Practice. ESA Loukas Georgiadis, Renato Fonseca F. Werneck, Robert Endre Tarjan, Spyridon Triantafyllis, David I. August
2004	B	`conf`	Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. IPCO Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo L. Reis, Eduardo Uchoa, Renato Fonseca F. Werneck
2003	A	`conf`	On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem. ALENEX Mauricio G. C. Resende, Renato Fonseca F. Werneck
2002	J	`jnl`	A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs. INFORMS J. Comput. Celso C. Ribeiro, Eduardo Uchoa, Renato Fonseca F. Werneck
2002	A	`conf`	On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs. ALENEX Marcus Poggi de Aragão, Renato Fonseca F. Werneck
2001	J	`jnl`	Dual Heuristics on the Exact Solution of Large Steiner Problems. Electron. Notes Discret. Math. Marcus Poggi de Aragão, Eduardo Uchoa, Renato Fonseca F. Werneck
2000	J	`jnl`	Finding Minimum Congestion Spanning Trees. ACM J. Exp. Algorithmics Renato Fonseca F. Werneck, João C. Setubal
1999	—	`conf`	Finding Minimum Congestion Spanning Trees. WAE Renato Fonseca F. Werneck, João C. Setubal, Arlindo Flávio da Conceição