default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Delling
Person information
- affiliation: Microsoft Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c64]Alex Zhai, Dee Guo, Sreenivas Gollapudi, Kostas Kollias, Daniel Delling:
Deep Learning-Based Alternative Route Computation. AISTATS 2024: 4078-4086- 2021
- [c63]Payas Rajan
, Moritz Baum, Michael Wegner, Tobias Zündorf, Christian J. West, Dennis Schieferdecker, Daniel Delling:
Robustness Generalizations of the Shortest Feasible Path Problem for Electric Vehicles. ATMOS 2021: 11:1-11:18 - 2020
- [c62]Valentin Buchhold, Daniel Delling, Dennis Schieferdecker, Michael Wegner:
Fast and Stable Repartitioning of Road Networks. SEA 2020: 26:1-26:15
2010 – 2019
- 2019
- [c61]Daniel Delling, Julian Dibbelt, Thomas Pajor:
Fast and Exact Public Transit Routing with Restricted Pareto Sets. ALENEX 2019: 54-65 - 2018
- [c60]Daniel Delling:
Route planning in transportation networks: from research to practice. SIGSPATIAL/GIS 2018: 2 - [c59]Daniel Delling, Dennis Schieferdecker, Christian Sommer:
Traffic-Aware Routing in Road Networks. ICDE 2018: 1543-1548 - 2017
- [j19]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks. Transp. Sci. 51(2): 566-591 (2017) - [c58]Daniel Delling, Julian Dibbelt, Thomas Pajor, Tobias Zündorf:
Faster Transit Routing by Hyper Partitioning. ATMOS 2017: 8:1-8:14 - 2016
- [j18]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck:
Highway Dimension and Provably Efficient Shortest Path Algorithms. J. ACM 63(5): 41:1-41:26 (2016) - [c57]Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. SODA 2016: 740-753 - [p3]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. Algorithm Engineering 2016: 19-80 - [r1]Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Hub Labeling (2-Hop Labeling). Encyclopedia of Algorithms 2016: 932-938 - [i6]Daniel Delling, Camil Demetrescu, David S. Johnson, Jan Vitek:
Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111). Dagstuhl Reports 6(3): 24-43 (2016) - 2015
- [j17]Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck:
An exact combinatorial algorithm for minimum graph bisection. Math. Program. 153(2): 417-458 (2015) - [j16]Daniel Delling, Renato F. Werneck:
Customizable Point-of-Interest Queries in Road Networks. IEEE Trans. Knowl. Data Eng. 27(3): 686-698 (2015) - [j15]Daniel Delling, Thomas Pajor, Renato F. Werneck:
Round-Based Public Transit Routing. Transp. Sci. 49(3): 591-604 (2015) - [c56]Daniel Delling, Andrew V. Goldberg, Moisés Goldszmidt, John Krumm, Kunal Talwar, Renato F. Werneck:
Navigation made personal: inferring driving preferences from GPS traces. SIGSPATIAL/GIS 2015: 31:1-31:9 - [c55]Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck:
Public Transit Labeling. SEA 2015: 273-285 - [i5]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. CoRR abs/1504.05140 (2015) - [i4]Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck:
Public Transit Labeling. CoRR abs/1505.01446 (2015) - 2014
- [j14]Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
On d-regular schematization of embedded paths. Comput. Geom. 47(3): 381-406 (2014) - [c54]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CIKM 2014: 629-638 - [c53]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Computing classic closeness centrality, at scale. COSN 2014: 37-50 - [c52]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Robust Distance Queries on Massive Networks. ESA 2014: 321-333 - [c51]Daniel Delling, Moritz Kobitzsch, Renato F. Werneck:
Customizing Driving Directions with GPUs. Euro-Par 2014: 728-739 - [c50]Daniel Delling, Giuseppe F. Italiano, Thomas Pajor, Federico Santaroni:
Better transit routing by exploiting vehicle GPS data. IWCTS@SIGSPATIAL 2014: 31-40 - [c49]Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck:
Hub Labels: Theory and Practice. SEA 2014: 259-270 - [i3]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CoRR abs/1408.6282 (2014) - [i2]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Computing Classic Closeness Centrality, at Scale. CoRR abs/1409.0035 (2014) - [i1]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Timed Influence: Computation and Maximization. CoRR abs/1410.6976 (2014) - 2013
- [j13]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013) - [j12]John Krumm, Robert Gruen, Daniel Delling:
From destination prediction to route prediction. J. Locat. Based Serv. 7(2): 98-120 (2013) - [j11]Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato F. Werneck:
PHAST: Hardware-accelerated shortest path trees. J. Parallel Distributed Comput. 73(7): 940-952 (2013) - [c48]Edith Cohen, Daniel Delling, Fabian Fuchs, Andrew V. Goldberg, Moisés Goldszmidt, Renato F. Werneck:
Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths. COSN 2013: 131-142 - [c47]Daniel Delling, Renato F. Werneck:
Customizable point-of-interest queries in road networks. SIGSPATIAL/GIS 2013: 490-493 - [c46]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks (Extended Abstract). SOCS 2013: 212 - [c45]Daniel Delling, Thomas Pajor, Renato F. Werneck:
Round-Based Public Transit Routing (Extended Abstract). SOCS 2013: 213 - [c44]Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Hub Label Compression. SEA 2013: 18-29 - [c43]Daniel Delling, Renato F. Werneck:
Faster Customization of Road Networks. SEA 2013: 30-42 - [c42]Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck:
Computing Multimodal Journeys in Practice. SEA 2013: 260-271 - 2012
- [j10]Daniel Delling, Giacomo Nannicini:
Core Routing on Dynamic Time-Dependent Road Networks. INFORMS J. Comput. 24(2): 187-201 (2012) - [j9]Daniel Delling, Bastian Katz, Thomas Pajor:
Parallel computation of best connections in public transportation networks. ACM J. Exp. Algorithmics 17(1) (2012) - [j8]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) - [j7]Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti:
Bidirectional A* search on time-dependent road networks. Networks 59(2): 240-251 (2012) - [c41]Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck:
Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX 2012: 30-44 - [c40]Daniel Delling, Thomas Pajor, Renato Fonseca F. Werneck:
Round-Based Public Transit Routing. ALENEX 2012: 130-140 - [c39]Daniel Delling, Moritz Kobitzsch, Dennis Luxen, Renato Fonseca F. Werneck:
Robust Mobile Route Planning with Limited Connectivity. ALENEX 2012: 150-159 - [c38]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Hierarchical Hub Labelings for Shortest Paths. ESA 2012: 24-35 - [c37]Daniel Delling, Renato Fonseca F. Werneck:
Better Bounds for Graph Bisection. ESA 2012: 407-418 - [c36]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
HLDB: location-based services in databases. SIGSPATIAL/GIS 2012: 339-348 - [e1]Daniel Delling, Leo Liberti:
12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2012, September 13, 2012, Ljubljana, Slovenia. OASIcs 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2012, ISBN 978-3-939897-45-3 [contents] - 2011
- [j6]Daniel Delling:
Time-Dependent SHARC-Routing. Algorithmica 60(1): 60-94 (2011) - [j5]Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Shortest Paths in Road Networks: From Practice to Theory and Back. it Inf. Technol. 53(6): 294-301 (2011) - [j4]Reinhard Bauer, Daniel Delling, Dorothea Wagner:
Experimental study of speed up techniques for timetable information systems. Networks 57(1): 38-52 (2011) - [c35]Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Faster Batched Shortest Paths in Road Networks. ATMOS 2011: 52-63 - [c34]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
VC-Dimension and Shortest Path Algorithms. ICALP (1) 2011: 690-699 - [c33]Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato Fonseca F. Werneck:
PHAST: Hardware-Accelerated Shortest Path Trees. IPDPS 2011: 921-931 - [c32]Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck:
Graph Partitioning with Natural Cuts. IPDPS 2011: 1135-1146 - [c31]Mihai Budiu, Daniel Delling, Renato Fonseca F. Werneck:
DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines. IPDPS 2011: 1278-1289 - [c30]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 - [c29]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck:
Customizable Route Planning. SEA 2011: 376-387 - 2010
- [j3]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 J. Exp. Algorithmics 15 (2010) - [c28]Daniel Delling, Roberto Hoffmann, Maria Kandyba, Anna Schulze:
Case Studies. Algorithm Engineering 2010: 389-445 - [c27]Daniel Delling, Bastian Katz, Thomas Pajor:
Parallel computation of best connections in public transportation networks. IPDPS 2010: 1-12 - [c26]Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor:
Path Schematization for Route Sketches. SWAT 2010: 285-296 - [c25]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Alternative Routes in Road Networks. SEA 2010: 23-34 - [c24]Edith Brunel, Daniel Delling, Andreas Gemsa, Dorothea Wagner:
Space-Efficient SHARC-Routing. SEA 2010: 47-58
2000 – 2009
- 2009
- [b1]Daniel Delling:
Engineering and Augmenting Route Planning Algorithms. Karlsruhe Institute of Technology, 2009 - [j2]Reinhard Bauer, Daniel Delling:
SHARC: Fast and robust unidirectional routing. ACM J. Exp. Algorithmics 14 (2009) - [c23]Daniel Delling, Robert Görke, Christian Schulz, Dorothea Wagner:
Orca Reduction and ContrAction Graph Clustering. AAIM 2009: 152-165 - [c22]Gernot Veit Batz, Daniel Delling, Peter Sanders, Christian Vetter:
Time-Dependent Contraction Hierarchies. ALENEX 2009: 97-105 - [c21]Annabell Berger, Daniel Delling, Andreas Gebhardt, Matthias Müller-Hannemann:
Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. ATMOS 2009 - [c20]Emanuele Berrettini, Gianlorenzo D'Angelo, Daniel Delling:
Arc-Flags in Dynamic Graphs. ATMOS 2009 - [c19]Daniel Delling, Thomas Pajor, Dorothea Wagner, Christos D. Zaroliagis:
Efficient Route Planning in Flight Networks. ATMOS 2009 - [c18]Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner:
Engineering Route Planning Algorithms. Algorithmics of Large and Complex Networks 2009: 117-139 - [c17]Daniel Delling, Thomas Pajor, Dorothea Wagner:
Accelerating Multi-modal Route Planning by Access-Nodes. ESA 2009: 587-598 - [c16]Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner:
The Shortcut Problem - Complexity and Approximation. SOFSEM 2009: 105-116 - [c15]Daniel Delling, Dorothea Wagner:
Pareto Paths with SHARC. SEA 2009: 125-136 - [p2]Daniel Delling, Thomas Pajor, Dorothea Wagner:
Engineering Time-Expanded Graphs for Faster Timetable Information. Robust and Online Large-Scale Optimization 2009: 182-206 - [p1]Daniel Delling, Dorothea Wagner:
Time-Dependent Route Planning. Robust and Online Large-Scale Optimization 2009: 207-230 - 2008
- [j1]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) - [c14]Daniel Delling, Marco Gaertler, Robert Görke, Dorothea Wagner:
Engineering Comparators for Graph Clusterings. AAIM 2008: 131-142 - [c13]Reinhard Bauer, Daniel Delling:
SHARC: Fast and Robust Unidirectional Routing. ALENEX 2008: 13-26 - [c12]Daniel Delling, Thomas Pajor, Dorothea Wagner:
Engineering Time-Expanded Graphs for Faster Timetable Information. ATMOS 2008 - [c11]Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes:
Bidirectional A* on Time-dependent Graphs. CTW 2008: 132-135 - [c10]Daniel Delling:
Time-Dependent SHARC-Routing. ESA 2008: 332-343 - [c9]Daniel Delling, Giacomo Nannicini:
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. ISAAC 2008: 812-823 - [c8]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 - [c7]Robert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling:
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. WEA 2008: 319-333 - [c6]Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes:
Bidirectional A* Search for Time-Dependent Fast Paths. WEA 2008: 334-346 - 2007
- [c5]Reinhard Bauer, Daniel Delling, Dorothea Wagner:
Experimental Study on Speed-Up Techniques for Timetable Information Systems. ATMOS 2007 - [c4]Daniel Delling, Dorothea Wagner:
Landmark-Based Routing in Dynamic Graphs. WEA 2007: 52-65 - [c3]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 - 2006
- [c2]Daniel Delling, Martin Holzer, Kirill Müller, Frank Schulz, Dorothea Wagner:
High-Performance Multi-Level Routing. The Shortest Path Problem 2006: 73-91 - [c1]Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner:
Highway Hierarchies Star. The Shortest Path Problem 2006: 141-174
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-14 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
