Renato F. Werneck

Math. Program. Comput., 2018

2017

Customizable Route Planning in Road Networks.

[BibT_eX]

[DOI]

Transp. Sci., 2017

Finding near-optimal independent sets at scale.

[BibT_eX]

[DOI]

J. Heuristics, 2017

2016

Route Planning in Transportation Networks.

[BibT_eX]

[DOI]

Hannah Bast

Matthias Müller-Hannemann

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Dynamic Trees.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Hub Labeling (2-Hop Labeling).

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Highway Dimension and Provably Efficient Shortest Path Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2016

Accelerating Local Search for the Maximum Independent Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Round-Based Public Transit Routing.

[BibT_eX]

[DOI]

Transp. Sci., 2015

Customizable Point-of-Interest Queries in Road Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2015

An exact combinatorial algorithm for minimum graph bisection.

[BibT_eX]

[DOI]

Math. Program., 2015

Route Planning in Transportation Networks.

[BibT_eX]

[DOI]

Hannah Bast

Matthias Müller-Hannemann

CoRR, 2015

Public Transit Labeling.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Navigation made personal: inferring driving preferences from GPS traces.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Timed Influence: Computation and Maximization.

[BibT_eX]

[DOI]

CoRR, 2014

Hub Labels: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Customizing Driving Directions with GPUs.

[BibT_eX]

[DOI]

Moritz Kobitzsch

Proceedings of the Euro-Par 2014 Parallel Processing, 2014

Robust Distance Queries on Massive Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

Computing classic closeness centrality, at scale.

[BibT_eX]

[DOI]

Proceedings of the second ACM conference on Online social networks, 2014

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

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

2013

PHAST: Hardware-accelerated shortest path trees.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2013

Alternative routes in road networks.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2013

Faster Customization of Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Hub Label Compression.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Computing Multimodal Journeys in Practice.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Round-Based Public Transit Routing (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Customizable Route Planning in Road Networks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths.

[BibT_eX]

[DOI]

Proceedings of the Conference on Online Social Networks, 2013

2012

Fast local search for the steiner problem in graphs.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2012

Fast local search for the maximum independent set problem.

[BibT_eX]

[DOI]

Diogo Vieira Andrade

J. Heuristics, 2012

Real-world route planning.

[BibT_eX]

[DOI]

Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science 2011, 2012

HLDB: location-based services in databases.

[BibT_eX]

[DOI]

Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Better Bounds for Graph Bisection.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

Hierarchical Hub Labelings for Shortest Paths.

[BibT_eX]

[DOI]

Ittai Abraham

Proceedings of the Algorithms - ESA 2012, 2012

Robust Mobile Route Planning with Limited Connectivity.

[BibT_eX]

[DOI]

Moritz Kobitzsch

Dennis Luxen

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

Exact Combinatorial Branch-and-Bound for Graph Bisection.

[BibT_eX]

[DOI]

Ilya P. Razenshteyn

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011

Data structures for mergeable trees.

[BibT_eX]

[DOI]

Matthias Müller-Hannemann

ACM Trans. Algorithms, 2011

Introduction to special issue ALENEX'11.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2011

Shortest Paths in Road Networks: From Practice to Theory and Back.

[BibT_eX]

[DOI]

it Inf. Technol., 2011

Customizable Route Planning.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks.

[BibT_eX]

[DOI]

Ittai Abraham

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Graph Partitioning with Natural Cuts.

[BibT_eX]

[DOI]

Ilya P. Razenshteyn

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines.

[BibT_eX]

[DOI]

Mihai Budiu

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

VC-Dimension and Shortest Path Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Maximum Flows by Incremental Breadth-First Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

Faster Batched Shortest Paths in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2011, 2011

2010

Highway Dimension, Shortest Paths, and Provably Efficient Algorithms.

[BibT_eX]

[DOI]

Ittai Abraham

Amos Fiat

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Fast Local Search for Steiner Trees in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009

Dynamic trees in practice.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Shortest-path feasibility algorithms: An experimental evaluation.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Virtual Ring Routing Trends.

[BibT_eX]

[DOI]

Dahlia Malkhi

Siddhartha Sen

Kunal Talwar

Udi Wieder

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

An Experimental Study of Minimum Mean Cycle Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008

Dynamic Trees.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2007

A fast swap-based local search procedure for location problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2007

Better Landmarks Within Reach.

[BibT_eX]

[DOI]

Haim Kaplan

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

2006

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.

[BibT_eX]

[DOI]

Ricardo Fukasawa

Humberto J. Longo

Jens Lysgaard

Marcelo L. Reis

Math. Program., 2006

Finding Dominators in Practice.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2006

A hybrid multistart heuristic for the uncapacitated facility location problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

Design of data structures for mergeable trees.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Reach for A*: Shortest Path Algorithms with Preprocessing.

[BibT_eX]

[DOI]

Haim Kaplan

Proceedings of the Shortest Path Problem, 2006

Reach for A*: Efficient Point-to-Point Shortest Path Algorithms.

[BibT_eX]

[DOI]

Haim Kaplan

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005

Self-adjusting top trees.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Computing Point-to-Point Shortest Paths from External Memory.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Heuristics, 2004

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.

[BibT_eX]

[DOI]

Ricardo Fukasawa

Jens Lysgaard

Marcelo L. Reis

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Finding Dominators in Practice.

[BibT_eX]

[DOI]

Spyridon Triantafyllis

David I. August

Proceedings of the Algorithms, 2004

2003

On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem.

[BibT_eX]

Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

2002

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs.

[BibT_eX]

[DOI]

Celso C. Ribeiro

INFORMS J. Comput., 2002

On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001

Dual Heuristics on the Exact Solution of Large Steiner Problems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

2000

Finding Minimum Congestion Spanning Trees.

[BibT_eX]

[DOI]

João C. Setubal

ACM J. Exp. Algorithmics, 2000

1999

Finding Minimum Congestion Spanning Trees.

[BibT_eX]

[DOI]