Christian Sommer
Christian Sommer
Подтвержден адрес электронной почты в домене apple.com - Главная страница
Название
Процитировано
Процитировано
Год
Shortest-Path Queries in Static Networks
C Sommer
ACM Computing Surveys 46 (4), 2014
1912014
A Compact Routing Scheme and Approximate Distance Oracle for Power-Law Graphs
W Chen, C Sommer, SH Teng, Y Wang
ACM Transactions on Algorithms 9 (1), 4:1-26, 2012
72*2012
Shortest-path queries for complex networks: Exploiting low tree-width outside the core
T Akiba, C Sommer, K Kawarabayashi
15th International Conference on Extending Database Technology (EDBT), 144-155, 2012
722012
Exact distance oracles for planar graphs
S Mozes, C Sommer
23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), 209-222, 2012
662012
Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
K Kawarabayashi, P Klein, C Sommer
38th International Colloquium on Automata, Languages and Programming (ICALP …, 2011
562011
On shortest disjoint paths in planar graphs
Y Kobayashi, C Sommer
Discrete Optimization 7 (4), 234-245, 2010
542010
Structured Recursive Separator Decompositions for Planar Graphs in Linear Time
PN Klein, S Mozes, C Sommer
45th ACM Symposium on Theory of Computing (STOC), 505-514, 2013
492013
Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries
S Lim, C Sommer, E Nikolova, D Rus
Robotics: Science and Systems VIII (RSS), 249-256, 2012
392012
Approximate Shortest Path and Distance Queries in Networks
C Sommer
University of Tokyo, 2010
382010
Distance Oracles for Sparse Graphs
C Sommer, E Verbin, W Yu
50th IEEE Symposium on Foundations of Computer Science (FOCS), 703-712, 2009
382009
Data-Driven Trajectory Smoothing
F Chazal, D Chen, LJ Guibas, X Jiang, C Sommer
19th ACM SIGSPATIAL International Conference on Advances in Geographic …, 2011
372011
More Compact Oracles for Approximate Distances in Undirected Planar Graphs
K Kawarabayashi, C Sommer, M Thorup
24th ACM-SIAM Symposium on Discrete Algorithms (SODA), 550-563, 2013
25*2013
On Balanced Separators in Road Networks
A Schild, C Sommer
14th International Symposium on Experimental Algorithms (SEA), 286-297, 2015
222015
Sparse spanners vs. compact routing
C Gavoille, C Sommer
23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA …, 2011
142011
Short and Simple Cycle Separators in Planar Graphs
E Fox-Epstein, S Mozes, PM Phothilimthana, C Sommer
Journal of Experimental Algorithmics (JEA) 21 (2), 2.2, 2016
132016
Model checking networked programs in the presence of transmission failures
C Artho, C Sommer, S Honiden
1st Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering …, 2007
132007
Approximate shortest path queries using Voronoi duals
S Honiden, M Houle, C Sommer, M Wolff
Transactions on Computational Science, 28-53, 2010
122010
Balancing Graph Voronoi Diagrams
S Honiden, ME Houle, C Sommer
6th International Symposium on Voronoi Diagrams in Science and Engineering …, 2009
122009
All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing
C Sommer
43rd International Colloquium on Automata, Languages and Programming (ICALP), 2016
62016
Algorithms for Planar Graphs and Beyond
E Demaine, S Mozes, C Sommer, S Tazari
http://courses.csail.mit.edu/6.889/fall11/, 2011
4*2011
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20