default search action
Christian Sommer 0001
- > Home > Persons > Christian Sommer 0001
Publications
- 2016
- [j6]Eli Fox-Epstein, Shay Mozes
, Phitchaya Mangpo Phothilimthana, Christian Sommer:
Short and Simple Cycle Separators in Planar Graphs. ACM J. Exp. Algorithmics 21(1): 2.2:1-2.2:24 (2016) - 2015
- [c22]Aaron Schild, Christian Sommer:
On Balanced Separators in Road Networks. SEA 2015: 286-297 - 2013
- [c21]Eli Fox-Epstein, Shay Mozes
Short and Simple Cycle Separators in Planar Graphs. ALENEX 2013: 26-40 - [c20]Ken-ichi Kawarabayashi, Christian Sommer, Mikkel Thorup
More Compact Oracles for Approximate Distances in Undirected Planar Graphs. SODA 2013: 550-563 - [c19]Philip N. Klein, Shay Mozes
Structured recursive separator decompositions for planar graphs in linear time. STOC 2013: 505-514 - 2012
- [c18]Takuya Akiba, Christian Sommer, Ken-ichi Kawarabayashi:
Shortest-path queries for complex networks: exploiting low tree-width outside the core. EDBT 2012: 144-155 - [c17]Sejoon Lim, Christian Sommer, Evdokia Nikolova, Daniela Rus:
Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries. Robotics: Science and Systems 2012 - [c16]Carlo Ratti, Christian Sommer:
Approximating Shortest Paths in Spatial Social Networks. SocialCom/PASSAT 2012: 585-586 - [c15]Shay Mozes
Exact distance oracles for planar graphs. SODA 2012: 209-222 - [i4]Philip N. Klein, Shay Mozes, Christian Sommer:
Structured Recursive Separator Decompositions for Planar Graphs in Linear Time. CoRR abs/1208.2223 (2012) - 2011
- [c12]Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer:
Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs. ICALP (1) 2011: 135-146 - [c11]Cyril Gavoille, Christian Sommer:
Sparse spanners vs. compact routing. SPAA 2011: 225-234 - [i3]Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer:
Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs. CoRR abs/1104.5214 (2011) - 2010
- [j3]Yusuke Kobayashi, Christian Sommer:
On shortest disjoint paths in planar graphs. Discret. Optim. 7(4): 234-245 (2010) - [j2]Shinichi Honiden, Michael E. Houle, Christian Sommer, Martin Wolff:
Approximate Shortest Path Queries Using Voronoi Duals. Trans. Comput. Sci. 9: 28-53 (2010) - [i1]Shay Mozes, Christian Sommer:
Exact Shortest Path Queries for Planar Graphs Using Linear Space. CoRR abs/1011.5549 (2010) - 2009
- [c9]Daisuke Fukuchi, Christian Sommer, Yuichi Sei
Distributed Arrays: A P2P Data Structure for Efficient Logical Arrays. INFOCOM 2009: 1458-1466 - [c8]Yusuke Kobayashi, Christian Sommer:
On Shortest Disjoint Paths in Planar Graphs. ISAAC 2009: 293-302 - [c7]Shinichi Honiden, Michael E. Houle, Christian Sommer, Martin Wolff:
Approximate Shortest Path Queries in Graphs Using Voronoi Duals. ISVD 2009: 53-62 - [c6]Shinichi Honiden, Michael E. Houle, Christian Sommer:
Balancing Graph Voronoi Diagrams. ISVD 2009: 183-191 - [c5]Yojiro Kawamata, Christian Sommer, Fuyuki Ishikawa, Shinichi Honiden:
Specifying and Checking Refinement Relationships in VDM++. SEFM 2009: 220-227 - 2007
- [c2]Cyrille Artho, Christian Sommer, Shinichi Honiden:
Model Checking Networked Programs in the Presence of Transmission Failures. TASE 2007: 219-228 - 2006
- [c1]Kenji Tei, Christian Sommer, Yoshiaki Fukazawa, Shinichi Honiden, Pierre-Loïc Garoche:
Adaptive Geographically Bound Mobile Agents. MSN 2006: 353-364
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-30 20:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: