Christian Sommer

Affiliations:

Apple
Massachusetts Institute of Technology, Cambridge, MA, USA (former)
University of Tokyo, Japan (former)
ETH Zürich (former)

According to our database¹, Christian Sommer authored at least 31 papers between 2006 and 2021.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2021

Fast Map Matching with Vertex-Monotone Fréchet Distance.

[BibT_eX]

[DOI]

Daniel Chen

Christian Sommer

Daniel Wolleb

Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2018

Traffic-Aware Routing in Road Networks.

[BibT_eX]

[DOI]

Daniel Delling

Dennis Schieferdecker

Christian Sommer

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2016

Short and Simple Cycle Separators in Planar Graphs.

[BibT_eX]

[DOI]

Eli Fox-Epstein

Shay Mozes

Phitchaya Mangpo Phothilimthana

Christian Sommer

ACM J. Exp. Algorithmics, 2016

All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing.

[BibT_eX]

[DOI]

Christian Sommer

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

On Balanced Separators in Road Networks.

[BibT_eX]

[DOI]

Aaron Schild

Christian Sommer

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014

Shortest-path queries in static networks.

[BibT_eX]

[DOI]

Christian Sommer

ACM Comput. Surv., 2014

2013

Structured recursive separator decompositions for planar graphs in linear time.

[BibT_eX]

[DOI]

Philip N. Klein

Shay Mozes

Christian Sommer

Proceedings of the Symposium on Theory of Computing Conference, 2013

More Compact Oracles for Approximate Distances in Undirected Planar Graphs.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Christian Sommer

Mikkel Thorup

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

A compact routing scheme and approximate distance oracle for power-law graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Exact distance oracles for planar graphs.

[BibT_eX]

[DOI]

Shay Mozes

Christian Sommer

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Approximating Shortest Paths in Spatial Social Networks.

[BibT_eX]

[DOI]

Carlo Ratti

Christian Sommer

Proceedings of the 2012 International Conference on Privacy, 2012

Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries.

[BibT_eX]

[DOI]

Proceedings of the Robotics: Science and Systems VIII, 2012

Shortest-path queries for complex networks: exploiting low tree-width outside the core.

[BibT_eX]

[DOI]

Takuya Akiba

Christian Sommer

Ken-ichi Kawarabayashi

Proceedings of the 15th International Conference on Extending Database Technology, 2012

2011

More Compact Oracles for Approximate Distances in Planar Graphs

[BibT_eX]

[DOI]

Christian Sommer

CoRR, 2011

Sparse spanners vs. compact routing.

[BibT_eX]

[DOI]

Cyril Gavoille

Christian Sommer

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

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

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Philip N. Klein

Christian Sommer

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Data-driven trajectory smoothing.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Approximate Distance Queries for Weighted Polyhedral Surfaces.

[BibT_eX]

[DOI]

Hristo N. Djidjev

Christian Sommer

Proceedings of the Algorithms - ESA 2011, 2011

2010

Approximate Shortest Path Queries Using Voronoi Duals.

[BibT_eX]

[DOI]

Trans. Comput. Sci., 2010

On shortest disjoint paths in planar graphs.

[BibT_eX]

[DOI]

Yusuke Kobayashi

Christian Sommer

Discret. Optim., 2010

Exact Shortest Path Queries for Planar Graphs Using Linear Space

[BibT_eX]

[DOI]

Shay Mozes

Christian Sommer

CoRR, 2010

2009

A note on coloring sparse random graphs.

[BibT_eX]

[DOI]

Christian Sommer

Discret. Math., 2009

Compact Routing in Power-Law Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Specifying and Checking Refinement Relationships in VDM++.

[BibT_eX]

[DOI]

Proceedings of the Seventh IEEE International Conference on Software Engineering and Formal Methods, 2009

Approximate Shortest Path Queries in Graphs Using Voronoi Duals.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Symposium on Voronoi Diagrams, 2009

Balancing Graph Voronoi Diagrams.

[BibT_eX]

[DOI]

Shinichi Honiden

Michael E. Houle

Christian Sommer

Proceedings of the Sixth International Symposium on Voronoi Diagrams, 2009

Distributed Arrays: A P2P Data Structure for Efficient Logical Arrays.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Distance Oracles for Sparse Graphs.

[BibT_eX]

[DOI]

Christian Sommer

Elad Verbin

Wei Yu

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2007

Model Checking Networked Programs in the Presence of Transmission Failures.

[BibT_eX]

[DOI]

Cyrille Artho

Christian Sommer

Shinichi Honiden

Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering, 2007

Outsourcing and Offshoring: The Consultancies' Estimates.

[BibT_eX]

[DOI]

Christian Sommer

Georg Troxler

Proceedings of the Software Engineering Approaches for Offshore and Outsourced Development, 2007

2006

Adaptive Geographically Bound Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Mobile Ad-hoc and Sensor Networks, Second International Conference, 2006

Christian Sommer

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...