Mon, Jan 25 AM
09:30 - 17:45 |
| (1) |
09:30-10:05 |
Competitive Analysis of the k-Canadian Traveller Problem for Graphs with Restricted Edge Weights |
Takeshi Fukuda, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) |
| (2) |
10:05-10:40 |
Complexity results for the spanning tree congestion problem |
Yota Otachi (Gunma Univ.), Hans L. Bodlaender (Utrecht Univ.) |
| |
10:40-10:55 |
Break ( 15 min. ) |
| (3) |
10:55-11:30 |
Distance k-Sectors Exist |
Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Toronto.), Takeshi Tokuyama (Tohoku Univ.), Jiri Matousek (Charles Univ.), Daniel Reem (Technion - Israel Inst. of Tech.) |
| (4) |
11:30-12:05 |
Zone Diagrams in Euclidean Spaces and in Other Normed Spaces |
Akitoshi Kawamura (Univ. of Toronto.), Takeshi Tokuyama (Tohoku Univ.), Jiri Matousek (Charles Univ./ETH Zurich) |
| |
12:05-13:35 |
Lunch Break ( 90 min. ) |
| (5) |
13:35-14:10 |
Enumerating Rooted and Triangulated Planar Graphs |
Bingbing Zhuang, Hiroshi Nagamochi (Kyoto Univ.) |
| (6) |
14:10-14:45 |
Web Structure Mining on Isolated Cliques and Isolated Stars Contracted Webgraph |
Fumiya Oguri (Osaka Prefecture Univ.), Tatsuya Kiyotani (ASCOT Corp.), Yushi Uno (Osaka Prefecture Univ.) |
| |
14:45-15:00 |
Break ( 15 min. ) |
| (7) |
15:00-15:35 |
An Almost Optimal Algorithm for Winkler's Sorting Pairs in Bins |
Hiro Ito, Junichi Teruyama, Yuichi Yoshida (Kyoto Univ.) |
| (8) |
15:35-16:10 |
Minimum and maximum against k lies |
Michael Hoffmann (ETH Zurich), Jiri Matousek (Charles U/ETH Zurich), Yoshio Okamoto (Tokyo Inst. of Tech.), Philipp Zumstein (ETH Zurich) |
| (9) |
16:10-16:45 |
Size-Energy Tradeoff of Unate Circuits Computing Symmetric Functions |
Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Takao Nishizeki (Tohoku Univ.) |
| |
16:45-17:00 |
Break ( 15 min. ) |
| (10) |
17:00-17:45 |
[Fellow Memorial Lecture]
Invited Talk as a New Fellow |
Masafumi Yamashita (Kyushu Univ) |
is
