12月3日(水) 午前 09:30 - 17:00 |
(1) |
09:30-10:05 |
A lower bound for tree-width of Cartesian product graphs |
Kyohei Kozawa・○Yota Otachi・Koichi Yamazaki(Gunma Univ.) |
(2) |
10:05-10:40 |
Game Theoretic Analysis of Malicious Faults Which are Undetectable by Local Checks |
○Jun Kiniwa・Kensaku Kikuta(Univ. Hyogo) |
|
10:40-10:55 |
休憩 ( 15分 ) |
(3) |
10:55-11:30 |
正六角盤面上のあるペンタヘックスに対するアチーブメントゲームの先手必勝法 |
○野原勇基・松浦昭洋(東京電機大) |
(4) |
11:30-12:05 |
A Simple Generation of Multi-dimensional Partitions |
Yosuke Kikuchi(Tsuyama National Coll. Tech.)・○Katsuhisa Yamanaka(The University of Electro-Communications)・Shin-ichi Nakano(Gunma Univ.) |
|
12:05-13:20 |
昼食 ( 75分 ) |
(5) |
13:20-14:20 |
[招待講演]部分グラフ同型性判定の回路計算量について |
○天野一幸(群馬大) |
|
14:20-14:35 |
休憩 ( 15分 ) |
(6) |
14:35-15:10 |
Improved Formula Size Lower Bounds for Monotone Self-Dual Boolean Functions |
○Kenya Ueno(Univ. of Tokyo) |
(7) |
15:10-15:45 |
A 4-competitive strategy for exploring unknown polygons |
○Xuehou Tan(Tokai Univ.) |
|
15:45-16:00 |
休憩 ( 15分 ) |
(8) |
16:00-17:00 |
[招待講演]FOCS2008報告 |
○堀山貴史(埼玉大) |