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

• The journal version of our paper on shortest disjoint paths (in planar graphs) is now available.
• This summer semester, I co-teach Advanced Algorithms as an Assistant Professor at the University of Tokyo. Scribe notes for the lectures on Min-Cut and All-Pairs Shortest Paths algorithms are already available online.
• Thanks for the 2,000+ downloads of my PhD thesis Approximate Shortest Path and Distance Queries since March 2010. Please let me know what you liked and what not, and also if I missed out citing your work on shortest path algorithms (in particular on shortest path queries and distance oracles).