Wed, Dec 3 AM 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 |
Break ( 15 min. ) |
(3) |
10:55-11:30 |
A Winning Strategy for the Achievement Game of a Certain Pentahex on Hexagonal Boards |
Yuuki Nohara, Akihiro Matsuura (Tokyo Denki Univ.) |
(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 |
Lunch Break ( 75 min. ) |
(5) |
13:20-14:20 |
[Invited Talk]
On the Circuit Complexity of Subgraph Isomorphism |
Kazuyuki Amano (Gunma Univ.) |
|
14:20-14:35 |
Break ( 15 min. ) |
(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 |
Break ( 15 min. ) |
(8) |
16:00-17:00 |
[Invited Talk]
FOCS 2008 Report |
Takashi Horiyama (Saitama Univ.) |