Fri, Dec 16
09:30 - 18:15 |
| (1) |
09:30-10:00 |
A compact DFA representation using dual position automata |
Hiroaki Yamamoto, Shogo Nakamura (Shinshu Univ.) |
| (2) |
10:00-10:30 |
Relationship Between Coding Theory and Counting Perfect Matchings |
Taisuke Izumi, Tadashi Wadayama (NITech) |
| |
10:30-10:45 |
Break ( 15 min. ) |
| (3) |
10:45-11:15 |
Algorithms for Bandwidth Consecutive Multicolorings of Graphs |
Kazuhide Nishikawa, Takao Nishizeki (Kwansei Gakuin Univ.), Xiao Zhou (Tohoku Univ.) |
| (4) |
11:15-11:45 |
Reconfiguration of Vertex Covers in Trees and Cacti |
Hiroyuki Nooka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) |
| |
11:45-13:00 |
Lunch Break ( 75 min. ) |
| (5) |
13:00-13:30 |
How to guard a graph against tree movements |
Takayoshi Sakamaki, Toshihiro Fujito (TUT) |
| (6) |
13:30-14:00 |
Minimizing Penalty on Upper and Lower Degree Constrained Graph Orientation |
Yuichi Asahiro (Kyushu Sangyo Univ.), Jesper Jansson (Ochanomizu Univ.), Eiji Miyano (Kyushu Inst. of Tech.), Hirotaka Ono (Kyushu Univ.) |
| (7) |
14:00-14:30 |
Pattern Formation Algorithm with Reference-Robot-Assignment Function for Asynchronous, Anonymous, Oblivious Robots |
Yasumasa Sujaku, Kiyoaki Yoshida, Tosiro Koga (Kurume I. T.) |
| |
14:30-14:45 |
Break ( 15 min. ) |
| (8) |
14:45-15:15 |
Minimizing the Number of Heald Frames under the Constraint of Uniform Tension |
Isamu Matsuura (AITEC), Tomio Hirata (Nagoya Univ.) |
| (9) |
15:15-15:45 |
Image Segmentation Using Maximum Weight Region |
Jinhee Chun, Natsuda Kaothanthong, Takeshi Tokuyama (Tohoku Univ.) |
| |
15:45-16:00 |
Break ( 15 min. ) |
| (10) |
16:00-17:00 |
[Invited Talk]
HOPE-Japan: High-resolution Online-map Project for East-Japan |
Shin Aida (TUT) |
| |
17:00-17:15 |
Break ( 15 min. ) |
| (11) |
17:15-18:15 |
[Invited Talk]
Research Story on Distance Trisector Curves: How was it born and developed? |
Tetsuo Asano (JAIST), Takeshi Tokuyama (Tohoku Univ.), Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Tokyo) |
ecei
