RIMS International Project Research 2008
Discrete Structures and Algorithms
April 2008 - March 2009
Kyoto RIMS Winter School on
Graphs and Algorithms
December 17 - 22, 2008
RIMS (Room 420), Kyoto University, Japan
Program
>> Program & Abstracts
>> Program (pdf)
Time table (updated on Dec. 5)
Lecturers (>> Abstracts)
- Bojan Mohar
(Simon Fraser University, Canada )
- Coloring-flow Duality for Graphs on Surfaces
- Finding Shortest Cycles with Restricted Homotopy
- Bruce Reed
(McGill University, Canada),
- Robin Thomas
(Georgia Institute of Technology, USA)
- Carsten Thomassen
(Technical University of Denmark, Denmark),
- On the Number of Spanning Trees, Orientations, and Cycles
- Graph Decomposition
- Mikkel Thorup
(AT&T Labs-Research, USA),
- Approximate Distance Oracles for Planar DiGraphs and Avoiding Obstacles in the Euclidean Plane
- Efficient Cuts via Greedy Tree Packing
- Bjarne Toft
(University of Southern Denmark, Denmark),
- The Game of Hex
- Graph Coloring Problems Revisited
- Magnus Halldorsson
(Reykjavik University, Iceland)
- Sang-il Oum
(KAIST, Korea)
- R. Ravi
(Carnegie Mellon University, USA)
- Takehiro Ito
(Tohoku University, Japan)
- Naoyuki Kamiyama
(Kyoto University, Japan)
Registration
No registration is required to attend the workshop.
Reception
A buffet-style reception is held on December 19 (Fri).
Please register for reception before December 11 (Thu).
Access to RIMS
See the
access information
page of RIMS.
Organizing Committee
Contact
Ken-ichi Kawarabayashi
E-mail: k_keniti (AT) nii.ac.jp
National Center of Sciences,
2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan