Renato F. Werneck

42 papers A* 1A 5B 8C 1Journal 17Unranked 7
YearRankTypeTitle / Venue / Authors
2018 J jnl
A robust and scalable algorithm for the Steiner problem in graphs.
Math. Program. Comput.
Thomas Pajor, Eduardo Uchoa, Renato F. Werneck
2017 J jnl
Customizable Route Planning in Road Networks.
Transp. Sci.
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
2017 J jnl
Finding near-optimal independent sets at scale.
J. Heuristics
Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
2016 C ed.
16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2016, Aarhus, Denmark, August 25, 2016
ATMOS
Marc Goerigk, Renato F. Werneck
2016 B conf
Accelerating Local Search for the Maximum Independent Set Problem.
SEA
Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
2016 J jnl
Accelerating Local Search for the Maximum Independent Set Problem.
CoRR
Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
2016 — ch.
Dynamic Trees.
Encyclopedia of Algorithms
Renato F. Werneck
2016 A conf
Finding Near-Optimal Independent Sets at Scale.
ALENEX
Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
2016 J jnl
Highway Dimension and Provably Efficient Shortest Path Algorithms.
J. ACM
Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck
2016 — ch.
Hub Labeling (2-Hop Labeling).
Encyclopedia of Algorithms
Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2016 A* conf
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs.
SODA
Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2016 — ch.
Route Planning in Transportation Networks.
Algorithm Engineering
Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2015 J jnl
An exact combinatorial algorithm for minimum graph bisection.
Math. Program.
Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck
2015 J jnl
Customizable Point-of-Interest Queries in Road Networks.
IEEE Trans. Knowl. Data Eng.
Daniel Delling, Renato F. Werneck
2015 A conf
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search.
ESA
Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck
2015 J jnl
Finding Near-Optimal Independent Sets at Scale.
CoRR
Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
2015 — conf
Navigation made personal: inferring driving preferences from GPS traces.
SIGSPATIAL/GIS
Daniel Delling, Andrew V. Goldberg, Moisés Goldszmidt, John Krumm, Kunal Talwar, Renato F. Werneck
2015 B conf
Public Transit Labeling.
SEA
Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck
2015 J jnl
Public Transit Labeling.
CoRR
Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck
2015 J jnl
Round-Based Public Transit Routing.
Transp. Sci.
Daniel Delling, Thomas Pajor, Renato F. Werneck
2015 J jnl
Route Planning in Transportation Networks.
CoRR
Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2014 J jnl
A Robust and Scalable Algorithm for the Steiner Problem in Graphs.
CoRR
Thomas Pajor, Eduardo Uchoa, Renato F. Werneck
2014 J jnl
Computing Classic Closeness Centrality, at Scale.
CoRR
Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014 — conf
Computing classic closeness centrality, at scale.
COSN
Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014 — conf
Customizing Driving Directions with GPUs.
Euro-Par
Daniel Delling, Moritz Kobitzsch, Renato F. Werneck
2014 B conf
Hub Labels: Theory and Practice.
SEA
Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck
2014 A conf
Robust Distance Queries on Massive Networks.
ESA
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
2014 A conf
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees.
CIKM
Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014 J jnl
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees.
CoRR
Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014 J jnl
Timed Influence: Computation and Maximization.
CoRR
Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2013 J jnl
Alternative routes in road networks.
ACM J. Exp. Algorithmics
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2013 B conf
Computing Multimodal Journeys in Practice.
SEA
Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck
2013 B conf
Customizable Route Planning in Road Networks (Extended Abstract).
SOCS
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
2013 — conf
Customizable point-of-interest queries in road networks.
SIGSPATIAL/GIS
Daniel Delling, Renato F. Werneck
2013 B conf
Faster Customization of Road Networks.
SEA
Daniel Delling, Renato F. Werneck
2013 B conf
Hub Label Compression.
SEA
Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2013 J jnl
PHAST: Hardware-accelerated shortest path trees.
J. Parallel Distributed Comput.
Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato F. Werneck
2013 B conf
Round-Based Public Transit Routing (Extended Abstract).
SOCS
Daniel Delling, Thomas Pajor, Renato F. Werneck
2013 — conf
Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths.
COSN
Edith Cohen, Daniel Delling, Fabian Fuchs, Andrew V. Goldberg, Moisés Goldszmidt, Renato F. Werneck
2012 — conf
Real-world route planning.
CTS@SIGSPATIAL
Renato F. Werneck
2006 A conf
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms.
ALENEX
Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
2006 — conf
Reach for A*: Shortest Path Algorithms with Preprocessing.
The Shortest Path Problem
Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck