Renato F. Werneck

According to our database1, Renato F. Werneck
  • authored at least 88 papers between 1999 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Customizable Route Planning in Road Networks.
Transportation Science, 2017

Finding near-optimal independent sets at scale.
J. Heuristics, 2017

2016
Route Planning in Transportation Networks.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Dynamic Trees.
Encyclopedia of Algorithms, 2016

Hub Labeling (2-Hop Labeling).
Encyclopedia of Algorithms, 2016

Highway Dimension and Provably Efficient Shortest Path Algorithms.
J. ACM, 2016

Accelerating Local Search for the Maximum Independent Set Problem.
CoRR, 2016

Accelerating Local Search for the Maximum Independent Set Problem.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Finding Near-Optimal Independent Sets at Scale.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
Round-Based Public Transit Routing.
Transportation Science, 2015

Customizable Point-of-Interest Queries in Road Networks.
IEEE Trans. Knowl. Data Eng., 2015

An exact combinatorial algorithm for minimum graph bisection.
Math. Program., 2015

Finding Near-Optimal Independent Sets at Scale.
CoRR, 2015

Public Transit Labeling.
CoRR, 2015

Route Planning in Transportation Networks.
CoRR, 2015

Public Transit Labeling.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Navigation made personal: inferring driving preferences from GPS traces.
Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search.
Proceedings of the Algorithms - ESA 2015, 2015

2014
A Robust and Scalable Algorithm for the Steiner Problem in Graphs.
CoRR, 2014

Timed Influence: Computation and Maximization.
CoRR, 2014

Computing Classic Closeness Centrality, at Scale.
CoRR, 2014

Sketch-based Influence Maximization and Computation: Scaling up with Guarantees.
CoRR, 2014

Hub Labels: Theory and Practice.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Customizing Driving Directions with GPUs.
Proceedings of the Euro-Par 2014 Parallel Processing, 2014

Robust Distance Queries on Massive Networks.
Proceedings of the Algorithms - ESA 2014, 2014

Computing classic closeness centrality, at scale.
Proceedings of the second ACM conference on Online social networks, 2014

Sketch-based Influence Maximization and Computation: Scaling up with Guarantees.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

2013
PHAST: Hardware-accelerated shortest path trees.
J. Parallel Distrib. Comput., 2013

Alternative routes in road networks.
ACM Journal of Experimental Algorithmics, 2013

Faster Customization of Road Networks.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Hub Label Compression.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Computing Multimodal Journeys in Practice.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Round-Based Public Transit Routing (Extended Abstract).
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Customizable Route Planning in Road Networks (Extended Abstract).
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Customizable point-of-interest queries in road networks.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths.
Proceedings of the Conference on Online Social Networks, 2013

2012
Fast local search for the steiner problem in graphs.
ACM Journal of Experimental Algorithmics, 2012

Fast local search for the maximum independent set problem.
J. Heuristics, 2012

Real-world route planning.
Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science 2011, 2012

HLDB: location-based services in databases.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Better Bounds for Graph Bisection.
Proceedings of the Algorithms - ESA 2012, 2012

Hierarchical Hub Labelings for Shortest Paths.
Proceedings of the Algorithms - ESA 2012, 2012

Round-Based Public Transit Routing.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

Robust Mobile Route Planning with Limited Connectivity.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

Exact Combinatorial Branch-and-Bound for Graph Bisection.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011
Data structures for mergeable trees.
ACM Trans. Algorithms, 2011

Introduction to special issue ALENEX'11.
ACM Journal of Experimental Algorithmics, 2011

Shortest Paths in Road Networks: From Practice to Theory and Back.
it - Information Technology, 2011

Customizable Route Planning.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Graph Partitioning with Natural Cuts.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

PHAST: Hardware-Accelerated Shortest Path Trees.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

VC-Dimension and Shortest Path Algorithms.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Maximum Flows by Incremental Breadth-First Search.
Proceedings of the Algorithms - ESA 2011, 2011

Faster Batched Shortest Paths in Road Networks.
Proceedings of the ATMOS 2011, 2011

2010
Alternative Routes in Road Networks.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Highway Dimension, Shortest Paths, and Provably Efficient Algorithms.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Fast Local Search for Steiner Trees in Graphs.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009
Dynamic trees in practice.
ACM Journal of Experimental Algorithmics, 2009

Shortest-path feasibility algorithms: An experimental evaluation.
ACM Journal of Experimental Algorithmics, 2009

Virtual Ring Routing Trends.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

An Experimental Study of Minimum Mean Cycle Algorithms.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008
Dynamic Trees.
Proceedings of the Encyclopedia of Algorithms, 2008

Fast Local Search for the Maximum Independent Set Problem.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Shortest Path Feasibility Algorithms: An Experimental Evaluation.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007
Data Structures for Mergeable Trees
CoRR, 2007

A fast swap-based local search procedure for location problems.
Annals OR, 2007

Dynamic Trees in Practice.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Better Landmarks Within Reach.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

2006
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.
Math. Program., 2006

Finding Dominators in Practice.
J. Graph Algorithms Appl., 2006

A hybrid multistart heuristic for the uncapacitated facility location problem.
European Journal of Operational Research, 2006

Design of data structures for mergeable trees.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Reach for A*: Shortest Path Algorithms with Preprocessing.
Proceedings of the Shortest Path Problem, 2006

Reach for A*: Efficient Point-to-Point Shortest Path Algorithms.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005
Self-adjusting top trees.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

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 Algorithmics and Combinatorics, 2005

2004
A Hybrid Heuristic for the p-Median Problem.
J. Heuristics, 2004

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Finding Dominators in Practice.
Proceedings of the Algorithms, 2004

2003
On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

2002
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs.
INFORMS Journal on Computing, 2002

On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs.
Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001
Dual Heuristics on the Exact Solution of Large Steiner Problems.
Electronic Notes in Discrete Mathematics, 2001

2000
Finding Minimum Congestion Spanning Trees.
ACM Journal of Experimental Algorithmics, 2000

1999
Finding Minimum Congestion Spanning Trees.
Proceedings of the Algorithm Engineering, 1999


  Loading...