Daniel Delling
POST DOC RESEARCHER
.
Microsoft Research Silicon Valley
1065 La Avenida
Mountain View CA 94043
tel: +1 (650) 693-1918
mail: dadellin [at] microsoft [dot] com
I joined Microsoft Research in September 2009. My main research areas are graph algorithms and algorithm engineering.
I finished my Ph.D. in Febuary 2009 at the University of Karlsruhe, Germany, working as a research assistant in the group of Dorothea Wagner. My thesis Engineering and Augmenting Route Planning Algorithms dealt with the development of efficient algorithms for route planning in augmented scenarios such as time-dependent networks. A second topic I worked on was algorithm engineering for graph clustering algorithms.
Activities
- PC member of ALENEX 2010
Selected Publications
2009
- Daniel Delling, Thomas Pajor, and Dorothea Wagner, Accelerating Multi-Modal Route Planning by Access-Nodes, in Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09), Springer Verlag, September 2009
- Daniel Delling, Time-Dependent SHARC-Routing, in Algorithmica, July 2009
- Daniel Delling and Dorothea Wagner, Pareto Paths with SHARC, in Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09), Springer Verlag, June 2009
- Reinhard Bauer and Daniel Delling, SHARC: Fast and Robust Unidirectional Routing, in ACM Journal of Experimental Algorithmics, vol. 14, pp. 2.4–2.29, Society for Industrial and Applied Mathematics, May 2009
- Daniel Delling, Peter Sanders, Dominik Schultes, and Dorothea Wagner, Engineering Route Planning Algorithms, in Algorithmics of Large and Complex Networks, vol. 5515, pp. 117–139, Springer, 2009
- Daniel Delling and Dorothea Wagner, Time-Dependent Route Planning, in Robust and Online Large-Scale Optimization, vol. 5868, pp. 207–230, Springer, 2009
2008
- Daniel Delling and Giacomo Nannicini, Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks, in Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC'08), Springer Verlag, December 2008
- Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, and Dorothea Wagner, Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm, in Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), Springer, June 2008
- Giacomo Nannicini, Daniel Delling, Leo Liberti, and Dominik Schultes, Bidirectional A* Search for Time-Dependent Fast Paths, in Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), Springer Verlag, June 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.
