Renato F. Werneck

Publication Activity (10 Years)

Years Active: 2006-2018
Publications (10 Years): 17

Top Topics

Independent Set

Top Venues

Publications

Thomas Pajor, Eduardo Uchoa, Renato F. Werneck
A robust and scalable algorithm for the Steiner problem in graphs. Math. Program. Comput. 10 (1) (2018)
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
Customizable Route Planning in Road Networks. Transp. Sci. 51 (2) (2017)
Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
Finding near-optimal independent sets at scale. J. Heuristics 23 (4) (2017)
Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck
Highway Dimension and Provably Efficient Shortest Path Algorithms. J. ACM 63 (5) (2016)
Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
Accelerating Local Search for the Maximum Independent Set Problem. CoRR (2016)
Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
Finding Near-Optimal Independent Sets at Scale. ALENEX (2016)
Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
Accelerating Local Search for the Maximum Independent Set Problem. SEA (2016)
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)
Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
Finding Near-Optimal Independent Sets at Scale. CoRR (2015)
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)
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) (2015)
Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck
Public Transit Labeling. CoRR (2015)
Daniel Delling, Renato F. Werneck
Customizable Point-of-Interest Queries in Road Networks. IEEE Trans. Knowl. Data Eng. 27 (3) (2015)
Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck
Public Transit Labeling. SEA (2015)
Daniel Delling, Thomas Pajor, Renato F. Werneck
Round-Based Public Transit Routing. Transp. Sci. 49 (3) (2015)
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 (2015)
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)
Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CIKM (2014)
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
Robust Distance Queries on Massive Networks. ESA (2014)
Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck
Hub Labels: Theory and Practice. SEA (2014)
Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
Timed Influence: Computation and Maximization. CoRR (2014)
Thomas Pajor, Eduardo Uchoa, Renato F. Werneck
A Robust and Scalable Algorithm for the Steiner Problem in Graphs. CoRR (2014)
Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
Computing classic closeness centrality, at scale. COSN (2014)
Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
Computing Classic Closeness Centrality, at Scale. CoRR (2014)
Daniel Delling, Moritz Kobitzsch, Renato F. Werneck
Customizing Driving Directions with GPUs. Euro-Par (2014)
Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CoRR (2014)
Daniel Delling, Renato F. Werneck
Faster Customization of Road Networks. SEA (2013)
Daniel Delling, Renato F. Werneck
Customizable point-of-interest queries in road networks. SIGSPATIAL/GIS (2013)
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)
Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck
Computing Multimodal Journeys in Practice. SEA (2013)
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
Customizable Route Planning in Road Networks (Extended Abstract). SOCS (2013)
Daniel Delling, Thomas Pajor, Renato F. Werneck
Round-Based Public Transit Routing (Extended Abstract). SOCS (2013)
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013)
Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato F. Werneck
PHAST: Hardware-accelerated shortest path trees. J. Parallel Distributed Comput. 73 (7) (2013)
Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
Hub Label Compression. SEA (2013)
Renato F. Werneck
Real-world route planning. CTS@SIGSPATIAL (2012)
Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. ALENEX (2006)
Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
Reach for A*: Shortest Path Algorithms with Preprocessing. The Shortest Path Problem (2006)