| 2010/03/26 |
KAIST Discrete Math Seminar by Sang-il Oum (announcement, video) |
Approximate Shortest Path and Distance Queries in Networks |
| 2010/03/18 |
IEICE (Institute of Electronics, Information and Communication Engineers) General Conference |
Distance Oracles for Sparse Graphs |
| 2010/03/09 |
ITCS, Tsinghua University |
Exact Distance Queries for Planar Graphs using Linear Space |
| 2010/02/22 |
Georgia Tech, Colloquium of the Algorithms & Randomness Center (announcement) |
Approximate Shortest Path and Distance Queries in Networks |
| 2010/02/15 |
Tokyo Institute of Technology, CompView, Mini-Symposium on New Developments of Discrete Algorithms |
Distance Oracles for Sparse Graphs |
| 2010/01/13 |
Tokyo University, Computer Science Department |
Approximate Shortest Path and Distance Queries in Networks (Defense) |
| 2009/12/01 |
Kasetsart University (Thailand), Department of Computer Engineering, Group of Prof. Jittat Fakcharoenphol |
Distance Oracles for Sparse Graphs |
| 2009/11/18 |
Tokyo University, Mathematical Informatics 2nd Laboratory, Group of Prof. Makino |
Distance Oracles for Sparse Graphs |
| 2009/11/09 |
Honiden Lab, NII, Tokyo University |
Distance Oracles for Sparse Graphs |
| 2009/10/27 |
FOCS 2009 (program) |
Distance Oracles for Sparse Graphs |
| 2009/10/21 |
Algorithms and Complexity Seminar at MIT Computer Science and Artificial Intelligence Laboratory |
Distance Oracles for Sparse Graphs |
| 2009/10/20 |
SENSEable City Lab at MIT |
Shortest Path Queries in Graphs |
| 2009/10/14 |
Algorithms and Theory group at Microsoft Research Silicon Valley |
Distance Oracles for Sparse Graphs |
| 2009/09/25 |
23rd International Symposium on Distributed Computing (DISC) (program) |
Compact routing in power-law graphs |
|
| 2009/08/05 |
Center for Nonlinear Studies (CNLS) at Los Alamos National Laboratory (announcement) |
Approximate distance oracles for power-law graphs |
|
| 2009/06/23 |
6th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2009) |
Approximate Shortest Path Queries in Graphs Using Voronoi Duals |
| 2009/05/26 |
Tokyo University, Group of Prof. Yutaka Matsuo |
Approximate distance oracles for power-law graphs and Approximate Shortest Path Queries in Graphs Using Voronoi Duals |
|
| 2009/03/12 |
ITCS, Tsinghua University |
Approximate distance oracles for power-law graphs |
|
| 2008/12/23 |
Distributed Computing Group, ETH Zurich |
Compact routing in power-law graphs |
|
| 2008/12/03 |
Honiden Lab, NII, Tokyo University |
Approximate distance oracles for power-law graphs |
|
| 2008/07/30 |
Microsoft Research Asia |
Approximate Shortest Path Queries in Graphs Using Voronoi Duals |
| 2007/06/07 |
TASE 2007 |
Model Checking Networked Programs in the Presence of Transmission Failures - half a talk, Cyrille Artho presented the other half |