Articles with public access mandates - Christian SommerLearn more
Available somewhere: 6
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
Mandates: Swiss National Science Foundation
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
Mandates: Swiss National Science Foundation
Exact distance oracles for planar graphs
S Mozes, C Sommer
23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), 209-222, 2012
Mandates: Swiss National Science Foundation
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
Mandates: Swiss National Science Foundation
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
Mandates: Swiss National Science Foundation
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
Mandates: US National Science Foundation, Swiss National Science Foundation
Publication and funding information is determined automatically by a computer program