Adaptive Geographically Bound Mobile Agents. - Kenji Tei; Christian Sommer 001; Yoshiaki Fukazawa; Shinichi Honiden; Pierre-Loïc Garoche (MSN, 2006)

Outsourcing and Offshoring: The Consultancies' Estimates. - Christian Sommer 001; Georg Troxler (SEAFOOD, 2007)

Model Checking Networked Programs in the Presence of Transmission Failures. - Cyrille Artho; Christian Sommer 001; Shinichi Honiden (TASE, 2007)

Distance Oracles for Sparse Graphs. - Christian Sommer 001; Elad Verbin; Wei Yu 007 (FOCS, 2009)

Distributed Arrays: A P2P Data Structure for Efficient Logical Arrays. - Daisuke Fukuchi; Christian Sommer 001; Yuichi Sei; Shinichi Honiden (INFOCOM, 2009)

Balancing Graph Voronoi Diagrams. - Shinichi Honiden; Michael E. Houle; Christian Sommer 001 (ISVD, 2009)

Approximate Shortest Path Queries in Graphs Using Voronoi Duals. - Shinichi Honiden; Michael E. Houle; Christian Sommer 001; Martin Wolff (ISVD, 2009)

Specifying and Checking Refinement Relationships in VDM++. - Yojiro Kawamata; Christian Sommer 001; Fuyuki Ishikawa; Shinichi Honiden (SEFM, 2009)

Compact Routing in Power-Law Graphs. - Wei Chen 013; Christian Sommer 001; Shang-Hua Teng; Yajun Wang 001 (DISC, 2009)

A note on coloring sparse random graphs. - Christian Sommer 001 (Discret. Math., 2009)

Exact Shortest Path Queries for Planar Graphs Using Linear Space - Shay Mozes; Christian Sommer 001 (CoRR, 2010)

On shortest disjoint paths in planar graphs. - Yusuke Kobayashi 001; Christian Sommer 001 (Discret. Optim., 2010)

Approximate Shortest Path Queries Using Voronoi Duals. - Shinichi Honiden; Michael E. Houle; Christian Sommer 001; Martin Wolff (Trans. Comput. Sci., 2010)

Approximate Distance Queries for Weighted Polyhedral Surfaces. - Hristo N. Djidjev; Christian Sommer 001 (ESA, 2011)

Data-driven trajectory smoothing. - Frédéric Chazal; Daniel Chen 003; Leonidas J. Guibas; Xiaoye Jiang; Christian Sommer 001 (GIS, 2011)

Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs. - Ken-ichi Kawarabayashi; Philip N. Klein; Christian Sommer 001 (ICALP (1), 2011)

Sparse spanners vs. compact routing. - Cyril Gavoille; Christian Sommer 001 (SPAA, 2011)

More Compact Oracles for Approximate Distances in Planar Graphs - Christian Sommer 001 (CoRR, 2011)

Shortest-path queries for complex networks: exploiting low tree-width outside the core. - Takuya Akiba; Christian Sommer 001; Ken-ichi Kawarabayashi (EDBT, 2012)

Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries. - Sejoon Lim; Christian Sommer 001; Evdokia Nikolova; Daniela Rus (Robotics: Science and Systems, 2012)

Approximating Shortest Paths in Spatial Social Networks. - Carlo Ratti; Christian Sommer 001 (SocialCom/PASSAT, 2012)

Exact distance oracles for planar graphs. - Shay Mozes; Christian Sommer 001 (SODA, 2012)

A compact routing scheme and approximate distance oracle for power-law graphs. - Wei Chen 013; Christian Sommer 001; Shang-Hua Teng; Yajun Wang 001 (ACM Trans. Algorithms, 2012)

More Compact Oracles for Approximate Distances in Undirected Planar Graphs. - Ken-ichi Kawarabayashi; Christian Sommer 001; Mikkel Thorup (SODA, 2013)

Structured recursive separator decompositions for planar graphs in linear time. - Philip N. Klein; Shay Mozes; Christian Sommer 001 (STOC, 2013)

Shortest-path queries in static networks. - Christian Sommer 001 (ACM Comput. Surv., 2014)

On Balanced Separators in Road Networks. - Aaron Schild; Christian Sommer 001 (SEA, 2015)

All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing. - Christian Sommer 001 (ICALP, 2016)

Short and Simple Cycle Separators in Planar Graphs. - Eli Fox-Epstein; Shay Mozes; Phitchaya Mangpo Phothilimthana; Christian Sommer 001 (ACM J. Exp. Algorithmics, 2016)

Traffic-Aware Routing in Road Networks. - Daniel Delling; Dennis Schieferdecker; Christian Sommer 001 (ICDE, 2018)

Fast Map Matching with Vertex-Monotone Fréchet Distance. - Daniel Chen 003; Christian Sommer 001; Daniel Wolleb (ATMOS, 2021)