Mon, Jun 29 AM 10:00 - 11:45 |
(1) |
10:00-10:35 |
Compressed Pattern Matching on VF Codes |
Takuya Kida (Hokkaido Univ.) |
(2) |
10:35-11:10 |
Reconfiguration of List Edge-Colorings in a Graph |
Takehiro Ito (Tohoku Univ.), Marcin Kaminski (Univ. Libre de Bruxelles), Erik D. Demaine (MIT) |
(3) |
11:10-11:45 |
The Longest Path Problem and Its Application to the Path Selection in JR Urban Areas |
Takashi Horiyama, Kosuke Higuchi (Saitama Univ.) |
Mon, Jun 29 PM 13:30 - 14:40 |
(4) |
13:30-14:05 |
Algorithms for optimal segmentation of regions decomposable into basic shapes |
Ryosei Kasai, Jinhee Chun, Matias Korman, Takeshi Tokuyama (Tohoku Univ.) |
(5) |
14:05-14:40 |
Approximating Edit Distance of Unordered Trees of Bounded Height |
Daiji Fukagawa (NII), Tatsuya Akutsu (Kyoto Univ.), Atsuhiro Takasu (NII) |
Mon, Jun 29 PM 14:50 - 16:00 |
(6) |
14:50-15:25 |
A Polynomial-time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise |
Masaki Yamamoto (Tokai Univ.), Shuji Kijima (Kyoto Univ.), Yasuko Matsui (Tokai Univ.) |
(7) |
15:25-16:00 |
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes |
Yoshio Okamoto (Tokyo Inst. of Tech.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) |