Daniel Delling

According to our database1, Daniel Delling
  • authored at least 88 papers between 2006 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

Faster Transit Routing by Hyper Partitioning.
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

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

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

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

Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111).
Dagstuhl Reports, 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

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

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

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

On d-regular schematization of embedded paths.
Comput. Geom., 2014

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

Better transit routing by exploiting vehicle GPS data.
Proceedings of the IWCTS 2014, 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

From destination prediction to route prediction.
J. Location Based Services, 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
Bidirectional A* search on time-dependent road networks.
Networks, 2012

The Shortcut Problem - Complexity and Algorithms.
J. Graph Algorithms Appl., 2012

Parallel computation of best connections in public transportation networks.
ACM Journal of Experimental Algorithmics, 2012

Core Routing on Dynamic Time-Dependent Road Networks.
INFORMS Journal on Computing, 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
Experimental study of speed up techniques for timetable information systems.
Networks, 2011

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

Time-Dependent SHARC-Routing.
Algorithmica, 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

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

2010
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm.
ACM Journal of Experimental Algorithmics, 2010

Space-Efficient SHARC-Routing.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

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

Path Schematization for Route Sketches.
Proceedings of the Algorithm Theory, 2010

Parallel computation of best connections in public transportation networks.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

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

2009
Time-Dependent Route Planning.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Engineering Time-Expanded Graphs for Faster Timetable Information.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Engineering and Augmenting Route Planning Algorithms.
PhD thesis, 2009

SHARC: Fast and robust unidirectional routing.
ACM Journal of Experimental Algorithmics, 2009

Pareto Paths with SHARC.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

The Shortcut Problem - Complexity and Approximation.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Accelerating Multi-modal Route Planning by Access-Nodes.
Proceedings of the Algorithms, 2009

Engineering Route Planning Algorithms.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Efficient Route Planning in Flight Networks.
Proceedings of the ATMOS 2009, 2009

Arc-Flags in Dynamic Graphs.
Proceedings of the ATMOS 2009, 2009

Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected.
Proceedings of the ATMOS 2009, 2009

Time-Dependent Contraction Hierarchies.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

Orca Reduction and ContrAction Graph Clustering.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008
On Modularity Clustering.
IEEE Trans. Knowl. Data Eng., 2008

Bidirectional A* Search for Time-Dependent Fast Paths.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Time-Dependent SHARC-Routing.
Proceedings of the Algorithms, 2008

Bidirectional A* on Time-dependent Graphs.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Engineering Time-Expanded Graphs for Faster Timetable Information.
Proceedings of the ATMOS 2008, 2008

SHARC: Fast and Robust Unidirectional Routing.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

Engineering Comparators for Graph Clusterings.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
On Finding Graph Clusterings with Maximum Modularity.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Landmark-Based Routing in Dynamic Graphs.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Experimental Study on Speed-Up Techniques for Timetable Information Systems.
Proceedings of the ATMOS 2007, 2007

2006
Highway Hierarchies Star.
Proceedings of the Shortest Path Problem, 2006

High-Performance Multi-Level Routing.
Proceedings of the Shortest Path Problem, 2006


  Loading...