| Fast Map Matching with Vertex-Monotone Fréchet Distance D Chen, C Sommer, D Wolleb 21st Symposium on Algorithmic Approaches for Transportation Modelling …, 2021 | 4 | 2021 |
| Traffic-Aware Routing in Road Networks D Delling, D Schieferdecker, C Sommer 34th IEEE International Conference on Data Engineering (ICDE), 2018 | 12 | 2018 |
| Live Traffic Routing D Delling, S Maitra, D Schieferdecker, C Sommer US Patent App. 15/239,678, 2018 | | 2018 |
| On-demand shortcut computation for routing D Delling, D Schieferdecker, C Sommer US Patent App. 15/239,567, 2018 | | 2018 |
| 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 |
| All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing C Sommer 43rd International Colloquium on Automata, Languages and Programming (ICALP), 2016 | 18 | 2016 |
| On Balanced Separators in Road Networks A Schild, C Sommer 14th International Symposium on Experimental Algorithms (SEA), 286-297, 2015 | 43 | 2015 |
| Shortest-Path Queries in Static Networks C Sommer ACM Computing Surveys 46 (4), 2014 | 278 | 2014 |
| 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 | 77 | 2013 |
| 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 | 35 | 2013 |
| 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 | 84* | 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 | 97 | 2012 |
| Approximating Shortest Paths in Spatial Social Networks C Ratti, C Sommer 4th ASE/IEEE International Conference on Social Computing (SocialCom), 585-586, 2012 | 4 | 2012 |
| 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 |
| Exact distance oracles for planar graphs S Mozes, C Sommer 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), 209-222, 2012 | 81 | 2012 |
| Sparse spanners vs. compact routing C Gavoille, C Sommer 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA …, 2011 | 14 | 2011 |
| Trains of data K Kloeckl, X Chen, C Sommer, C Ratti, A Biderman | 13 | 2011 |
| Algorithms for Planar Graphs and Beyond E Demaine, S Mozes, C Sommer, S Tazari http://courses.csail.mit.edu/6.889/fall11/, 2011 | 3* | 2011 |
| Approximate distance queries for weighted polyhedral surfaces H Djidjev, C Sommer 19th European Symposium on Algorithms (ESA), 579-590, 2011 | 7 | 2011 |
| 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 |
| 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 | 74 | 2011 |
| On shortest disjoint paths in planar graphs Y Kobayashi, C Sommer Discrete Optimization 7 (4), 234-245, 2010 | 71 | 2010 |
| Approximate Shortest Path and Distance Queries in Networks C Sommer University of Tokyo, 2010 | 43 | 2010 |
| Approximate shortest path queries using Voronoi duals S Honiden, M Houle, C Sommer, M Wolff Transactions on Computational Science, 28-53, 2010 | 18* | 2010 |
| Specifying and checking refinement relationships in VDM++ Y Kawamata, C Sommer, F Ishikawa, S Honiden 7th IEEE International Conference on Software Engineering and Formal Methods …, 2009 | 4 | 2009 |
| 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 |
| Balancing Graph Voronoi Diagrams S Honiden, ME Houle, C Sommer 6th International Symposium on Voronoi Diagrams in Science and Engineering …, 2009 | 15 | 2009 |
| A note on coloring sparse random graphs C Sommer Discrete Mathematics 309 (10), 3381-3384, 2009 | 4 | 2009 |
| Distributed Arrays: A P2P Data Structure for Efficient Logical Arrays D Fukuchi, C Sommer, Y Sei, S Honiden 28th IEEE International Conference on Computer Communications (INFOCOM …, 2009 | 4 | 2009 |
| 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 |
| Outsourcing and offshoring: the consultancies’ estimates C Sommer, G Troxler International Conference on Software Engineering Approaches for Offshore and …, 2007 | 4 | 2007 |
| Robust Combiners for Cryptographic Primitives C Sommer ETH Zurich, 2006 | 3* | 2006 |
shay mozesReichman University (formerly IDC Herzliya)Verified email at runi.ac.il
