Daniel Delling

Daniel Delling, Andrew V. Goldberg, Renato F. Werneck: Hub Label Compression. SEA 2013: 18-29

Daniel Delling, Renato F. Werneck: Faster Customization of Road Networks. SEA 2013: 30-42

Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck: Computing Multimodal Journeys in Practice. SEA 2013: 260-271

Daniel Delling, Giacomo Nannicini: Core Routing on Dynamic Time-Dependent Road Networks. INFORMS Journal on Computing 24(2): 187-201 (2012)

Daniel Delling, Bastian Katz, Thomas Pajor: Parallel computation of best connections in public transportation networks. ACM Journal of Experimental Algorithmics 17(1) (2012)

Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Andrea Schumm, Dorothea Wagner: The Shortcut Problem - Complexity and Algorithms. J. Graph Algorithms Appl. 16(2): 447-481 (2012)

Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti: Bidirectional A* search on time-dependent road networks. Networks 59(2): 240-251 (2012)

Daniel Delling, Andrew V. Goldberg, Ilya Razenshteyn, Renato Fonseca F. Werneck: Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX 2012: 30-44

Daniel Delling, Thomas Pajor, Renato Fonseca F. Werneck: Round-Based Public Transit Routing. ALENEX 2012: 130-140

Daniel Delling, Moritz Kobitzsch, Dennis Luxen, Renato Fonseca F. Werneck: Robust Mobile Route Planning with Limited Connectivity. ALENEX 2012: 150-159

Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: Hierarchical Hub Labelings for Shortest Paths. ESA 2012: 24-35

Daniel Delling, Renato Fonseca F. Werneck: Better Bounds for Graph Bisection. ESA 2012: 407-418

Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck: HLDB: location-based services in databases. SIGSPATIAL/GIS 2012: 339-348

Daniel Delling, Leo Liberti (Eds.): 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2012, September 13, 2012, Ljubljana, Slovenia. OASICS 25, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2012, isbn 978-3-939897-45-3

Daniel Delling: Time-Dependent SHARC-Routing. Algorithmica 60(1): 60-94 (2011)

Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: Shortest Paths in Road Networks: From Practice to Theory and Back. it - Information Technology 53(6): 294-301 (2011)

Reinhard Bauer, Daniel Delling, Dorothea Wagner: Experimental study of speed up techniques for timetable information systems. Networks 57(1): 38-52 (2011)

Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: Faster Batched Shortest Paths in Road Networks. ATMOS 2011: 52-63

Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck: VC-Dimension and Shortest Path Algorithms. ICALP (1) 2011: 690-699

Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato Fonseca F. Werneck: PHAST: Hardware-Accelerated Shortest Path Trees. IPDPS 2011: 921-931

Daniel Delling, Andrew V. Goldberg, Ilya Razenshteyn, Renato Fonseca F. Werneck: Graph Partitioning with Natural Cuts. IPDPS 2011: 1135-1146

Mihai Budiu, Daniel Delling, Renato Fonseca F. Werneck: DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines. IPDPS 2011: 1278-1289

Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. SEA 2011: 230-241

Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck: Customizable Route Planning. SEA 2011: 376-387

Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner: Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. ACM Journal of Experimental Algorithmics 15 (2010)

Daniel Delling, Roberto Hoffmann, Maria Kandyba, Anna Schulze: Case Studies. Algorithm Engineering 2010: 389-445

Daniel Delling, Bastian Katz, Thomas Pajor: Parallel computation of best connections in public transportation networks. IPDPS 2010: 1-12

Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor: Path Schematization for Route Sketches. SWAT 2010: 285-296

Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: Alternative Routes in Road Networks. SEA 2010: 23-34

Edith Brunel, Daniel Delling, Andreas Gemsa, Dorothea Wagner: Space-Efficient SHARC-Routing. SEA 2010: 47-58

Daniel Delling: Engineering and Augmenting Route Planning Algorithms. Karlsruhe Institute of Technology 2009

Reinhard Bauer, Daniel Delling: SHARC: Fast and robust unidirectional routing. ACM Journal of Experimental Algorithmics 14 (2009)

Daniel Delling, Robert Görke, Christian Schulz, Dorothea Wagner: Orca Reduction and ContrAction Graph Clustering. AAIM 2009: 152-165

Gernot Veit Batz, Daniel Delling, Peter Sanders, Christian Vetter: Time-Dependent Contraction Hierarchies. ALENEX 2009: 97-105

Annabell Berger, Daniel Delling, Andreas Gebhardt, Matthias Müller-Hannemann: Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. ATMOS 2009

Emanuele Berrettini, Gianlorenzo D'Angelo, Daniel Delling: Arc-Flags in Dynamic Graphs. ATMOS 2009

Daniel Delling, Thomas Pajor, Dorothea Wagner, Christos D. Zaroliagis: Efficient Route Planning in Flight Networks. ATMOS 2009

Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner: Engineering Route Planning Algorithms. Algorithmics of Large and Complex Networks 2009: 117-139

Daniel Delling, Thomas Pajor, Dorothea Wagner: Accelerating Multi-modal Route Planning by Access-Nodes. ESA 2009: 587-598

Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner: The Shortcut Problem - Complexity and Approximation. SOFSEM 2009: 105-116

Daniel Delling, Dorothea Wagner: Pareto Paths with SHARC. SEA 2009: 125-136

Daniel Delling, Thomas Pajor, Dorothea Wagner: Engineering Time-Expanded Graphs for Faster Timetable Information. Robust and Online Large-Scale Optimization 2009: 182-206

Daniel Delling, Dorothea Wagner: Time-Dependent Route Planning. Robust and Online Large-Scale Optimization 2009: 207-230

Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner: On Modularity Clustering. IEEE Trans. Knowl. Data Eng. 20(2): 172-188 (2008)

Daniel Delling, Marco Gaertler, Robert Görke, Dorothea Wagner: Engineering Comparators for Graph Clusterings. AAIM 2008: 131-142

Reinhard Bauer, Daniel Delling: SHARC: Fast and Robust Unidirectional Routing. ALENEX 2008: 13-26

Daniel Delling, Thomas Pajor, Dorothea Wagner: Engineering Time-Expanded Graphs for Faster Timetable Information. ATMOS 2008

Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes: Bidirectional A^* on Time-dependent Graphs. CTW 2008: 132-135

Daniel Delling: Time-Dependent SHARC-Routing. ESA 2008: 332-343

Daniel Delling, Giacomo Nannicini: Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. ISAAC 2008: 812-823

Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. WEA 2008: 303-318

Robert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. WEA 2008: 319-333

Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes: Bidirectional A^* Search for Time-Dependent Fast Paths. WEA 2008: 334-346

Reinhard Bauer, Daniel Delling, Dorothea Wagner: Experimental Study on Speed-Up Techniques for Timetable Information Systems. ATMOS 2007

Daniel Delling, Dorothea Wagner: Landmark-Based Routing in Dynamic Graphs. WEA 2007: 52-65

Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner: On Finding Graph Clusterings with Maximum Modularity. WG 2007: 121-132