Christian Sommer is a researcher in Computer Science, currently as a Postdoctoral Fellow at the Massachusetts Institute of Technology. He got his MSc from ETH Zurich in 2006 and his PhD from the University of Tokyo in 2010, where he also received the Dean's award for the best PhD thesis in the Computer Science Department. His research interests are algorithms, data structures, and graphs.

 

Teaching in Fall 2011

6.889 Algorithms for Planar Graphs and Beyond

Watch the lectures on Planar Separators, Single-Source Shortest Path, Multiple-Source Shortest Path, Exact Distance Oracles, Approximate Distance Oracles, Traveling Salesman, and Shortest Paths with Negative Lengths

Recent Results

Exact Distance Oracles for Planar Graphs

Shay Mozes and Christian Sommer
Presented at SODA 2012

Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs

Ken-ichi Kawarabayashi, Philip N. Klein, and Christian Sommer
Presented at ICALP 2011
See also: improved tradeoffs

Sparse Spanners vs. Compact Routing

Cyril Gavoille and Christian Sommer
Presented at SPAA 2011

Dynamic Networks

A visualization of dynamic transportation networks

 

 

 

Thanks and design credits to Density Design