Daniel Delling

Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020

Fast and Stable Repartitioning of Road Networks.

[BibT_eX]

[DOI]

Valentin Buchhold

Michael Wegner

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

2019

Fast and Exact Public Transit Routing with Restricted Pareto Sets.

[BibT_eX]

[DOI]

Julian Dibbelt

Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018

Traffic-Aware Routing in Road Networks.

[BibT_eX]

[DOI]

Christian Sommer

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Route planning in transportation networks: from research to practice.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

2017

Customizable Route Planning in Road Networks.

[BibT_eX]

[DOI]

Transp. Sci., 2017

Faster Transit Routing by Hyper Partitioning.

[BibT_eX]

[DOI]

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 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

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

Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111).

[BibT_eX]

[DOI]

Dagstuhl Reports, 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

2014

Timed Influence: Computation and Maximization.

[BibT_eX]

[DOI]

CoRR, 2014

On d-regular schematization of embedded paths.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Hub Labels: Theory and Practice.

[BibT_eX]

[DOI]

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

Better transit routing by exploiting vehicle GPS data.

[BibT_eX]

[DOI]

Proceedings of the IWCTS 2014, 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

From destination prediction to route prediction.

[BibT_eX]

[DOI]

John Krumm

Robert Gruen

J. Locat. Based Serv., 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

Bidirectional A* search on time-dependent road networks.

[BibT_eX]

[DOI]

Networks, 2012

The Shortcut Problem - Complexity and Algorithms.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Parallel computation of best connections in public transportation networks.

[BibT_eX]

[DOI]

Bastian Katz

ACM J. Exp. Algorithmics, 2012

Core Routing on Dynamic Time-Dependent Road Networks.

[BibT_eX]

[DOI]

Giacomo Nannicini

INFORMS J. Comput., 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

Experimental study of speed up techniques for timetable information systems.

[BibT_eX]

[DOI]

Reinhard Bauer

Networks, 2011

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

[BibT_eX]

[DOI]

it Inf. Technol., 2011

Time-Dependent SHARC-Routing.

[BibT_eX]

[DOI]

Algorithmica, 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

Faster Batched Shortest Paths in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2011, 2011

2010

Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm.

[BibT_eX]

[DOI]

Reinhard Bauer

Peter Sanders

Dominik Schultes

ACM J. Exp. Algorithmics, 2010

Space-Efficient SHARC-Routing.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Path Schematization for Route Sketches.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Case Studies.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

2009

Time-Dependent Route Planning.

[BibT_eX]

[DOI]

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Engineering Time-Expanded Graphs for Faster Timetable Information.

[BibT_eX]

[DOI]

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Engineering and Augmenting Route Planning Algorithms.

[BibT_eX]

[DOI]

PhD thesis, 2009

SHARC: Fast and robust unidirectional routing.

[BibT_eX]

[DOI]

Reinhard Bauer

ACM J. Exp. Algorithmics, 2009

Pareto Paths with SHARC.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

The Shortcut Problem - Complexity and Approximation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Accelerating Multi-modal Route Planning by Access-Nodes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

Engineering Route Planning Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Efficient Route Planning in Flight Networks.

[BibT_eX]

[DOI]

Christos D. Zaroliagis

Proceedings of the ATMOS 2009, 2009

Arc-Flags in Dynamic Graphs.

[BibT_eX]

[DOI]

Emanuele Berrettini

Gianlorenzo D'Angelo

Proceedings of the ATMOS 2009, 2009

Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected.

[BibT_eX]

[DOI]

Annabell Berger

Matthias Müller-Hannemann

Andreas Gebhardt

Proceedings of the ATMOS 2009, 2009

Time-Dependent Contraction Hierarchies.

[BibT_eX]

[DOI]

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

Orca Reduction and ContrAction Graph Clustering.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

On Modularity Clustering.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2008

Bidirectional A* Search for Time-Dependent Fast Paths.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks.

[BibT_eX]

[DOI]

Giacomo Nannicini

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Bidirectional A* on Time-dependent Graphs.

[BibT_eX]

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Engineering Time-Expanded Graphs for Faster Timetable Information.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2008, 2008

Engineering Comparators for Graph Clusterings.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

On Finding Graph Clusterings with Maximum Modularity.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Landmark-Based Routing in Dynamic Graphs.

[BibT_eX]

[DOI]