10月24日(火) 午後 13:30 - 17:30 |
(1) |
13:30-14:05 |
An algorithm for the secure total domination problem in proper interval graphs |
○Toru Araki・Yasufumi Aita(Gunma Univ.) |
(2) |
14:05-14:40 |
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP |
Tesshu Hanaka(Kyushu Univ.)・Hirotaka Ono・○Kosuke Sugiyama(Nagoya Univ.) |
|
14:40-15:00 |
休憩 ( 20分 ) |
(3) |
15:00-16:00 |
[招待講演]アルゴリズム的ランダム性の最近の発展について |
○木原貴行(名大) |
|
16:00-16:20 |
休憩 ( 20分 ) |
(4) |
16:20-16:55 |
Algorithm of uniform deployment for mobile robots in perfect bipartite graphs |
○Masahiro Shibata(Kyutech)・Naoki Kitamura(Osaka Univ.)・Ryota Eguchi(NAIST)・Yuichi Sudo(Hosei Univ.)・Junya Nakamura(Toyohashi Tech.)・Yonghwan Kim・Yoshiaki Katayama(Nagoya Tech.)・Toshimitsu Masuzawa(Osaka Univ.)・Sebastien Tixeuil(Sorbonne Univ.) |
(5) |
16:55-17:30 |
テント符号の空間計算量について |
○岡田真明(九大)・来嶋秀治(滋賀大) |