Christian Sommer likes graph algorithms. He designs, analyzes, and implements algorithms that find shortest paths in graphs.
Graphs include European and US road networks, European public transportation, social networks, citations, internet router connections, the web graph, protein interactions,...
Current / recent activities
- I defended my PhD thesis in January 2010 and I am currently looking for a post-doc position. Your evaluation may include checking out my CV (contact me for a PDF), my publications, and my talks.
- Distance Oracles for Sparse Graphs
joint work with Elad Verbin and Wei Yu
presented at FOCS 2009, Preprint online - Shortest Disjoint Paths in Planar Graphs
joint work with Yusuke Kobayashi
accepted to ISAAC 2009, Technical Report online