Share this page
  • Share this page on Twitter Share this page on Facebook Share this page on Digg Share this page on Del.icio.us Read the Inside Microsoft Research blog
  • E-mail this page Print this page
  • RSS feeds
Home > People > Daniel Delling
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 a new parallel single-source shortest path algorithm (PHAST) won the Best Paper Award (Algorithms Track) at IPDPS 2011. See paper below.

Activities

Selected Publications

    2012

    • Daniel Delling, Andrew V. Goldberg, Ilya Razenshteyn, and Renato F. Werneck, Exact Combinatorial Branch-and-Bound for Graph Bisection, in Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12), Society for Industrial and Applied Mathematics, 2012
    • Daniel Delling, Thomas Pajor, and Renato F. Werneck, Round-Based Public Transit Routing, in Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12), Society for Industrial and Applied Mathematics, 2012
    • Daniel Delling, Moritz Kobitzsch, Dennis Luxen, and Renato F. Werneck, Robust Mobile Route Planning with Limited Connectivity, in Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12), Society for Industrial and Applied Mathematics, 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.