Daniel Delling

Daniel Delling
RESEARCHER
.

Microsoft Research Silicon Valley
1065 La Avenida
Mountain View CA 94043
tel:   +1 (650) 693-1918
mail: daniel.delling [at] microsoft [dot] com

I joined Microsoft Research in September 2009. My main research interests include location services, graph algorithms and algorithm engineering.

News

  • Our work on exact graph bisection allows us to solve surprisingly big instances to optimality. See our paper for further details.
  • We have developed a prototype of location-based service which runs completely in SQL. Besides computing optimal routes in road networks, it allows queries like "find the closest restaurant", "give me the best post office on the way home", or "find a gas station that is ahead of me". See our Technical Report for further details.
  • We have developed a new journey planning engine for public transit networks, called RAPTOR. See our paper for further details.
  • Bing Maps is now using the Customizable Route Planning technology. See our paper for further details.
  • Our work on a new parallel single-source shortest path algorithm (PHAST) won the Best Paper Award (Algorithms Track) at IPDPS 2011.

Activities

 

Selected Publications

    2012

    2011

    2010

    2009

    2008

    • Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Höfer, Zoran Nikoloski, and Dorothea Wagner, On Modularity Clustering, in IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 2, pp. 172–188, IEEE, February 2008
    For a complete list of my publications, please browse to my old site.
    Share
    Share this page on Facebook
    Share this page on Twitter
    Share this page on LinkedIn
    E-mail this page
    RSS feeds