Fri, Oct 16 AM 10:00 - 11:45 |
(1) |
10:00-10:35 |
On simultaneous optimal segmentation of digital objects |
Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama (Tohoku Univ.) |
(2) |
10:35-11:10 |
Small Grid Drawings of Planar Graphs with Balanced Bipartition |
Xiao Zhou, Takashi Hikino, Takao Nishizeki (Tohoku Univ.) |
(3) |
11:10-11:45 |
Reformulation of the scheme for computing tree-width and minimum fill-in |
Masanobu Furuse, Yota Otachi, Koichi Yamazaki (Gunma Univ.) |
|
11:45-13:30 |
Lunch Break ( 105 min. ) |
Fri, Oct 16 PM 13:30 - 14:30 |
(4) |
13:30-14:30 |
[Invited Talk]
Algorithms for Conflict Resolution |
Dao-Zhi Zeng (Tohoku Univ.) |
|
14:30-14:50 |
Break ( 20 min. ) |
Fri, Oct 16 PM 14:50 - 16:35 |
(5) |
14:50-15:25 |
Algorithm for Finding Minimum Reaction Cut of Metabolic Network |
Takeyuki Tamura (Kyoto Univ.), Kazuhiro Takemoto (Univ. of Tokyo.), Tatsuya Akutsu (Kyoto Univ.) |
(6) |
15:25-16:00 |
An Improved Approximation Lower Bound for Maximum Cardinality Almost Stable Matching Problem |
Koki Hamada, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) |
(7) |
16:00-16:35 |
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds |
Kenya Ueno (Univ. of Tokyo) |