World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
44
Citations
11605
World Ranking
7425
National Ranking
3236

Overview

Daniel Delling is affiliated with Apple in the United States and has a research profile focused primarily on engineering and computer science. Their work spans a range of specialized subfields, including signal processing, automotive engineering, computer graphics and computer-aided design, computer vision and pattern recognition, and building and construction.

The research contributions of Daniel Delling are concentrated in topics such as data management and algorithms, computational geometry and mesh generation, graph theory and algorithms, traffic prediction and management techniques, transportation planning and optimization, transportation and mobility innovations, and electric vehicles and infrastructure.

Delling has published several papers in notable venues, reflecting these research interests. Key publications include:

  • Customizable Route Planning in Road Networks (Extended Abstract), 2021, Proceedings of the International Symposium on Combinatorial Search
  • Fast and Stable Repartitioning of Road Networks, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Round-Based Public Transit Routing (Extended Abstract), 2021, Proceedings of the International Symposium on Combinatorial Search
  • Robustness Generalizations of the Shortest Feasible Path Problem for Electric Vehicles, 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

The frequent publication venues where Delling's work appears include:

  • Proceedings of the International Symposium on Combinatorial Search
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Delling regularly collaborates with a select group of coauthors. Frequent collaborators include Thomas Pajor, Renato F. Werneck, Dennis Schieferdecker, Michael Wegner, and Andrew V. Goldberg.

The combination of expertise in both algorithm development and transportation systems is reflected in the integration of research topics such as transportation planning, electric vehicle infrastructure, and graph algorithms tailored to route and traffic optimization. This interdisciplinary approach supports complex problem solving in mobility innovations and infrastructure resilience.

Best Publications

  • On Modularity Clustering

    U. Brandes;D. Delling;M. Gaertler;R. Gorke

  • Contraction hierarchies: faster and simpler hierarchical routing in road networks

    Robert Geisberger;Peter Sanders;Dominik Schultes;Daniel Delling

  • Route Planning in Transportation Networks

    Hannah Bast;Daniel Delling;Andrew V. Goldberg;Matthias Müller-Hannemann

  • Engineering Route Planning Algorithms

    Daniel Delling;Peter Sanders;Dominik Schultes;Dorothea Wagner

  • Round-Based Public Transit Routing

    Daniel Delling;Thomas Pajor;Renato F. Werneck

  • SHARC: Fast and robust unidirectional routing

    Reinhard Bauer;Daniel Delling

  • A hub-based labeling algorithm for shortest paths in road networks

    Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck

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

    Reinhard Bauer;Daniel Delling;Peter Sanders;Dennis Schieferdecker

  • On finding graph clusterings with maximum modularity

    Ulrik Brandes;Daniel Delling;Marco Gaertler;Robert Görke

  • PHAST: Hardware-accelerated shortest path trees

    Daniel Delling;Andrew V. Goldberg;Andreas Nowatzyk;Renato F. Werneck

  • Sketch-based Influence Maximization and Computation: Scaling up with Guarantees

    Edith Cohen;Daniel Delling;Thomas Pajor;Renato F. Werneck

  • Hierarchical hub labelings for shortest paths

    Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck

  • Customizable route planning

    Daniel Delling;Andrew V. Goldberg;Thomas Pajor;Renato F. Werneck

  • Maximizing Modularity is hard

    U. Brandes;D. Delling;M. Gaertler;R. Goerke

  • Alternative routes in road networks

    Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck

  • Customizable Route Planning in Road Networks

    Daniel Delling;Andrew V. Goldberg;Thomas Pajor;Renato F. Werneck

  • Landmark-based routing in dynamic graphs

    Daniel Delling;Dorothea Wagner

  • Bidirectional A * search on time-dependent road networks

    Giacomo Nannicini;Daniel Delling;Dominik Schultes;Leo Liberti

  • Time-Dependent Route Planning

    Daniel Delling;Dorothea Wagner

  • Graph Partitioning with Natural Cuts

    Daniel Delling;Andrew V. Goldberg;Ilya Razenshteyn;Renato F. Werneck

Frequent Co-Authors

Renato F. Werneck
Renato F. Werneck Microsoft (United States)
Andrew V. Goldberg
Andrew V. Goldberg Amazon (United States)
Dorothea Wagner
Dorothea Wagner Karlsruhe Institute of Technology
Peter Sanders
Peter Sanders Karlsruhe Institute of Technology
Edith Cohen
Edith Cohen Tel Aviv University
Moises Goldszmidt
Moises Goldszmidt Apple (United States)
Ulrik Brandes
Ulrik Brandes ETH Zurich
Leo Liberti
Leo Liberti École Polytechnique
Zoran Nikoloski
Zoran Nikoloski Max Planck Institute of Molecular Plant Physiology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Interested in launching your tech career quickly? There are several short careers that pay well and can be a perfect fit for those eager to enter the workforce. These programs focus on core skills and offer competitive salaries right after graduation.

If you’re exploring emerging fields, pursuing one of the best online AI degrees can open doors to in-demand job roles. Online AI degrees combine tech fundamentals with practical experience, making them a smart choice for career advancement.

It’s also important to choose from the best degrees to pursue, depending on your career goals and personal interests. Some majors offer better job prospects, higher earning potential, and more flexible career opportunities than others.

For working professionals, one option is to consider the easiest online masters programs. These degrees make it possible to upskill or pivot your career with programs that balance academic rigor and practical applicability.

Best Scientists Citing Daniel Delling

Trending Scientists