Daniel Delling

96 papers A* 3A 17B 16C 12Journal 25Unranked 18

Year	Rank	Type	Title / Venue / Authors
2024	A	`conf`	Deep Learning-Based Alternative Route Computation. AISTATS Alex Zhai, Dee Guo, Sreenivas Gollapudi, Kostas Kollias, Daniel Delling
2024	A*	`conf`	Semantic Routing via Autoregressive Modeling. NeurIPS Eric Zhao, Pranjal Awasthi, Zhengdao Chen, Sreenivas Gollapudi, Daniel Delling
2021	C	`conf`	Robustness Generalizations of the Shortest Feasible Path Problem for Electric Vehicles. ATMOS Payas Rajan, Moritz Baum, Michael Wegner, Tobias Zündorf, Christian J. West, Dennis Schieferdecker, Daniel Delling
2020	B	`conf`	Fast and Stable Repartitioning of Road Networks. SEA Valentin Buchhold, Daniel Delling, Dennis Schieferdecker, Michael Wegner
2019	A	`conf`	Fast and Exact Public Transit Routing with Restricted Pareto Sets. ALENEX Daniel Delling, Julian Dibbelt, Thomas Pajor
2018	—	`conf`	Route planning in transportation networks: from research to practice. SIGSPATIAL/GIS Daniel Delling
2018	A*	`conf`	Traffic-Aware Routing in Road Networks. ICDE Daniel Delling, Dennis Schieferdecker, Christian Sommer
2017	J	`jnl`	Customizable Route Planning in Road Networks. Transp. Sci. Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
2017	C	`conf`	Faster Transit Routing by Hyper Partitioning. ATMOS Daniel Delling, Julian Dibbelt, Thomas Pajor, Tobias Zündorf
2016	J	`jnl`	Highway Dimension and Provably Efficient Shortest Path Algorithms. J. ACM Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck
2016	—	`ch.`	Hub Labeling (2-Hop Labeling). Encyclopedia of Algorithms Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2016	A*	`conf`	On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. SODA Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2016	J	`jnl`	Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111). Dagstuhl Reports Daniel Delling, Camil Demetrescu, David S. Johnson, Jan Vitek
2016	—	`ch.`	Route Planning in Transportation Networks. Algorithm Engineering Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2015	J	`jnl`	An exact combinatorial algorithm for minimum graph bisection. Math. Program. Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck
2015	J	`jnl`	Customizable Point-of-Interest Queries in Road Networks. IEEE Trans. Knowl. Data Eng. Daniel Delling, Renato F. Werneck
2015	—	`conf`	Navigation made personal: inferring driving preferences from GPS traces. SIGSPATIAL/GIS Daniel Delling, Andrew V. Goldberg, Moisés Goldszmidt, John Krumm, Kunal Talwar, Renato F. Werneck
2015	B	`conf`	Public Transit Labeling. SEA Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck
2015	J	`jnl`	Public Transit Labeling. CoRR Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck
2015	J	`jnl`	Round-Based Public Transit Routing. Transp. Sci. Daniel Delling, Thomas Pajor, Renato F. Werneck
2015	J	`jnl`	Route Planning in Transportation Networks. CoRR Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2014	—	`conf`	Better transit routing by exploiting vehicle GPS data. IWCTS@SIGSPATIAL Daniel Delling, Giuseppe F. Italiano, Thomas Pajor, Federico Santaroni
2014	J	`jnl`	Computing Classic Closeness Centrality, at Scale. CoRR Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014	—	`conf`	Computing classic closeness centrality, at scale. COSN Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014	—	`conf`	Customizing Driving Directions with GPUs. Euro-Par Daniel Delling, Moritz Kobitzsch, Renato F. Werneck
2014	B	`conf`	Hub Labels: Theory and Practice. SEA Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck
2014	J	`jnl`	On d-regular schematization of embedded paths. Comput. Geom. Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter
2014	A	`conf`	Robust Distance Queries on Massive Networks. ESA Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
2014	A	`conf`	Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CIKM Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014	J	`jnl`	Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CoRR Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2014	J	`jnl`	Timed Influence: Computation and Maximization. CoRR Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck
2013	J	`jnl`	Alternative routes in road networks. ACM J. Exp. Algorithmics Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2013	B	`conf`	Computing Multimodal Journeys in Practice. SEA Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck
2013	B	`conf`	Customizable Route Planning in Road Networks (Extended Abstract). SOCS Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
2013	—	`conf`	Customizable point-of-interest queries in road networks. SIGSPATIAL/GIS Daniel Delling, Renato F. Werneck
2013	B	`conf`	Faster Customization of Road Networks. SEA Daniel Delling, Renato F. Werneck
2013	J	`jnl`	From destination prediction to route prediction. J. Locat. Based Serv. John Krumm, Robert Gruen, Daniel Delling
2013	B	`conf`	Hub Label Compression. SEA Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2013	J	`jnl`	PHAST: Hardware-accelerated shortest path trees. J. Parallel Distributed Comput. Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato F. Werneck
2013	B	`conf`	Round-Based Public Transit Routing (Extended Abstract). SOCS Daniel Delling, Thomas Pajor, Renato F. Werneck
2013	—	`conf`	Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths. COSN Edith Cohen, Daniel Delling, Fabian Fuchs, Andrew V. Goldberg, Moisés Goldszmidt, Renato F. Werneck
2012	C	`ed.`	12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2012, Ljubljana, Slovenia, September 13, 2012 ATMOS Daniel Delling, Leo Liberti
2012	A	`conf`	Better Bounds for Graph Bisection. ESA Daniel Delling, Renato Fonseca F. Werneck
2012	J	`jnl`	Bidirectional Networks Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti
2012	J	`jnl`	Core Routing on Dynamic Time-Dependent Road Networks. INFORMS J. Comput. Daniel Delling, Giacomo Nannicini
2012	A	`conf`	Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
2012	—	`conf`	HLDB: location-based services in databases. SIGSPATIAL/GIS Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
2012	A	`conf`	Hierarchical Hub Labelings for Shortest Paths. ESA Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2012	J	`jnl`	Parallel computation of best connections in public transportation networks. ACM J. Exp. Algorithmics Daniel Delling, Bastian Katz, Thomas Pajor
2012	A	`conf`	Robust Mobile Route Planning with Limited Connectivity. ALENEX Daniel Delling, Moritz Kobitzsch, Dennis Luxen, Renato Fonseca F. Werneck
2012	A	`conf`	Round-Based Public Transit Routing. ALENEX Daniel Delling, Thomas Pajor, Renato Fonseca F. Werneck
2012	J	`jnl`	The Shortcut Problem - Complexity and Algorithms. J. Graph Algorithms Appl. Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Andrea Schumm, Dorothea Wagner
2011	B	`conf`	A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. SEA Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2011	B	`conf`	Customizable Route Planning. SEA Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck
2011	A	`conf`	DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines. IPDPS Mihai Budiu, Daniel Delling, Renato Fonseca F. Werneck
2011	J	`jnl`	Experimental study of speed up techniques for timetable information systems. Networks Reinhard Bauer, Daniel Delling, Dorothea Wagner
2011	C	`conf`	Faster Batched Shortest Paths in Road Networks. ATMOS Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2011	A	`conf`	Graph Partitioning with Natural Cuts. IPDPS Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
2011	A	`conf`	PHAST: Hardware-Accelerated Shortest Path Trees. IPDPS Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato Fonseca F. Werneck
2011	J	`jnl`	Shortest Paths in Road Networks: From Practice to Theory and Back. it Inf. Technol. Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2011	J	`jnl`	Time-Dependent SHARC-Routing. Algorithmica Daniel Delling
2011	—	`conf`	VC-Dimension and Shortest Path Algorithms. ICALP (1) Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
2010	B	`conf`	Alternative Routes in Road Networks. SEA Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2010	—	`conf`	Case Studies. Algorithm Engineering Daniel Delling, Roberto Hoffmann, Maria Kandyba, Anna Schulze
2010	J	`jnl`	Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. ACM J. Exp. Algorithmics Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner
2010	A	`conf`	Parallel computation of best connections in public transportation networks. IPDPS Daniel Delling, Bastian Katz, Thomas Pajor
2010	—	`conf`	Path Schematization for Route Sketches. SWAT Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor
2010	B	`conf`	Space-Efficient SHARC-Routing. SEA Edith Brunel, Daniel Delling, Andreas Gemsa, Dorothea Wagner
2009	A	`conf`	Accelerating Multi-modal Route Planning by Access-Nodes. ESA Daniel Delling, Thomas Pajor, Dorothea Wagner
2009	C	`conf`	Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. ATMOS Annabell Berger, Daniel Delling, Andreas Gebhardt, Matthias Müller-Hannemann
2009	C	`conf`	Arc-Flags in Dynamic Graphs. ATMOS Emanuele Berrettini, Gianlorenzo D'Angelo, Daniel Delling
2009	C	`conf`	Efficient Route Planning in Flight Networks. ATMOS Daniel Delling, Thomas Pajor, Dorothea Wagner, Christos D. Zaroliagis
2009	—	`conf`	Engineering Route Planning Algorithms. Algorithmics of Large and Complex Networks Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner
2009	—	`ch.`	Engineering Time-Expanded Graphs for Faster Timetable Information. Robust and Online Large-Scale Optimization Daniel Delling, Thomas Pajor, Dorothea Wagner
2009	—	`—`	Engineering and Augmenting Route Planning Algorithms. Daniel Delling
2009	C	`conf`	Orca Reduction and ContrAction Graph Clustering. AAIM Daniel Delling, Robert Görke, Christian Schulz, Dorothea Wagner
2009	B	`conf`	Pareto Paths with SHARC. SEA Daniel Delling, Dorothea Wagner
2009	J	`jnl`	SHARC: Fast and robust unidirectional routing. ACM J. Exp. Algorithmics Reinhard Bauer, Daniel Delling
2009	B	`conf`	The Shortcut Problem - Complexity and Approximation. SOFSEM Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner
2009	A	`conf`	Time-Dependent Contraction Hierarchies. ALENEX Gernot Veit Batz, Daniel Delling, Peter Sanders, Christian Vetter
2009	—	`ch.`	Time-Dependent Route Planning. Robust and Online Large-Scale Optimization Daniel Delling, Dorothea Wagner
2008	C	`conf`	Bidirectional CTW Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes
2008	—	`conf`	Bidirectional A WEA Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes
2008	B	`conf`	Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. ISAAC Daniel Delling, Giacomo Nannicini
2008	—	`conf`	Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. WEA Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner
2008	—	`conf`	Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. WEA Robert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling
2008	C	`conf`	Engineering Comparators for Graph Clusterings. AAIM Daniel Delling, Marco Gaertler, Robert Görke, Dorothea Wagner
2008	C	`conf`	Engineering Time-Expanded Graphs for Faster Timetable Information. ATMOS Daniel Delling, Thomas Pajor, Dorothea Wagner
2008	J	`jnl`	On Modularity Clustering. IEEE Trans. Knowl. Data Eng. Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner
2008	A	`conf`	SHARC: Fast and Robust Unidirectional Routing. ALENEX Reinhard Bauer, Daniel Delling
2008	A	`conf`	Time-Dependent SHARC-Routing. ESA Daniel Delling
2007	C	`conf`	Experimental Study on Speed-Up Techniques for Timetable Information Systems. ATMOS Reinhard Bauer, Daniel Delling, Dorothea Wagner
2007	—	`conf`	Landmark-Based Routing in Dynamic Graphs. WEA Daniel Delling, Dorothea Wagner
2007	B	`conf`	On Finding Graph Clusterings with Maximum Modularity. WG Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner
2006	—	`conf`	High-Performance Multi-Level Routing. The Shortest Path Problem Daniel Delling, Martin Holzer, Kirill Müller, Frank Schulz, Dorothea Wagner
2006	—	`conf`	Highway Hierarchies Star. The Shortest Path Problem Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner