Shortest-Path Queries in Static Networks C Sommer ACM Computing Surveys 46 (4), 2014 | 281 | 2014 |
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 | 96 | 2012 |
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 | 82* | 2012 |
Exact distance oracles for planar graphs S Mozes, C Sommer 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), 209-222, 2012 | 81 | 2012 |
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 | 80 | 2013 |
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 | 73 | 2011 |
On shortest disjoint paths in planar graphs Y Kobayashi, C Sommer Discrete Optimization 7 (4), 234-245, 2010 | 73 | 2010 |
Distance Oracles for Sparse Graphs C Sommer, E Verbin, W Yu 50th IEEE Symposium on Foundations of Computer Science (FOCS), 703-712, 2009 | 57 | 2009 |
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 | 54 | 2012 |
Data-Driven Trajectory Smoothing F Chazal, D Chen, LJ Guibas, X Jiang, C Sommer 19th ACM SIGSPATIAL International Conference on Advances in Geographic …, 2011 | 45 | 2011 |
On Balanced Separators in Road Networks A Schild, C Sommer 14th International Symposium on Experimental Algorithms (SEA), 286-297, 2015 | 44 | 2015 |
Approximate Shortest Path and Distance Queries in Networks C Sommer University of Tokyo, 2010 | 42 | 2010 |
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 | 34 | 2013 |
All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing C Sommer 43rd International Colloquium on Automata, Languages and Programming (ICALP), 2016 | 18 | 2016 |
Approximate shortest path queries using Voronoi duals S Honiden, M Houle, C Sommer, M Wolff Transactions on Computational Science, 28-53, 2010 | 17* | 2010 |
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 | 16 | 2016 |
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 | 16 | 2007 |
Sparse spanners vs. compact routing C Gavoille, C Sommer 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA …, 2011 | 15 | 2011 |
Balancing Graph Voronoi Diagrams S Honiden, ME Houle, C Sommer 6th International Symposium on Voronoi Diagrams in Science and Engineering …, 2009 | 15 | 2009 |
Trains of data K Kloeckl, X Chen, C Sommer, C Ratti, A Biderman | 13 | 2011 |