chsommer.com
Christian Sommer: Publications
http://www.chsommer.com/pub.htm
The author order is alphabetical for most. Short and Simple Cycle Separators in Planar Graphs. ACM Journal of Experimental Algorithmics, Special Issue for the 14th Meeting on Algorithm Engineering and Experiments (ALENEX), Volume 21, Issue 2. Shortest-Path Queries in Static Networks. ACM Computing Surveys, Volume 46, Issue 4. A Compact Routing Scheme and Approximate Distance Oracle for Power-Law Graphs. ACM Transactions on Algorithms, Volume 9, Issue 1. Michael E. Houle. Algorithms, Complexity and Games.
sommer.jp
Christian Sommer: Publications
http://www.sommer.jp/pub.htm
The author order is alphabetical for most. Shortest-Path Queries in Static Networks. ACM Computing Surveys, Volume 46, Issue 4. A Compact Routing Scheme and Approximate Distance Oracle for Power-Law Graphs. ACM Transactions on Algorithms, Volume 9, Issue 1. Approximate Shortest Path Queries Using Voronoi Duals. Michael E. Houle. Transactions on Computational Science, Volume IX, Special Issue for the 6th International Symposium on Voronoi Diagrams in Science and Engineering, LNCS 6290. Philip N. Klein.
news.mit.edu
How ride-sharing can improve traffic, save money, and help the environment | MIT News
http://news.mit.edu/2016/how-ride-sharing-can-improve-traffic-save-money-and-help-environment-0104
Massachusetts Institute of Technology. Follow MIT on Twitter. Follow MIT on Facebook. Follow MIT on Google. Follow MIT on Instagram. Follow MIT on Flickr. Follow MIT on YouTube. Microbiome diversity is influenced by chance encounters. Artificial data give the same results as real data without compromising privacy. MIT students invited to participate in 2017 Student Quality of Life Survey. Mens et Manus America initiative launches with documentary event. The corporate debt trap. A light rain can spread so...
shortestpaths.com
Christian Sommer: Publications
http://www.shortestpaths.com/pub.htm
The author order is alphabetical for most. Shortest-Path Queries in Static Networks. ACM Computing Surveys, Volume 46, Issue 4. A Compact Routing Scheme and Approximate Distance Oracle for Power-Law Graphs. ACM Transactions on Algorithms, Volume 9, Issue 1. Approximate Shortest Path Queries Using Voronoi Duals. Michael E. Houle. Transactions on Computational Science, Volume IX, Special Issue for the 6th International Symposium on Voronoi Diagrams in Science and Engineering, LNCS 6290. Philip N. Klein.
shortestpaths.org
Christian Sommer: Publications
http://www.shortestpaths.org/pub.htm
The author order is alphabetical for most. Shortest-Path Queries in Static Networks. ACM Computing Surveys, Volume 46, Issue 4. A Compact Routing Scheme and Approximate Distance Oracle for Power-Law Graphs. ACM Transactions on Algorithms, Volume 9, Issue 1. Approximate Shortest Path Queries Using Voronoi Duals. Michael E. Houle. Transactions on Computational Science, Volume IX, Special Issue for the 6th International Symposium on Voronoi Diagrams in Science and Engineering, LNCS 6290. Philip N. Klein.