Thu, Sep 15
09:25 - 10:35 |
| (1) |
09:25-10:00 |
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs |
Yosuke Kikuchi (JST), Toru Araki (Iwate Univ.) |
| (2) |
10:00-10:35 |
A construction method of synchronous reversible cellular automata using simple asynchronous logic elements |
Jin-Shan Qi, Kenichi Morita (Hiroshima Univ.) |
| |
10:35-10:50 |
Break ( 15 min. ) |
Thu, Sep 15
10:50 - 12:00 |
| (3) |
10:50-11:25 |
Laminar Structure of Ptolemaic Graphs and Its Applications |
Ryuhei Uehara (JAIST), Yushi Uno (Osaka Pref. Univ.) |
| (4) |
11:25-12:00 |
The q-gram distance for ordered unlabeled trees |
Nobuhito Ohkura, Kouichi Hirata (Kyushu Inst. Tech.), Tetsuji Kuboyama (Univ. Tokyo), Masateru Harao (Kyushu Inst. Tech.) |
| |
12:00-13:20 |
Lunch Break ( 80 min. ) |
Thu, Sep 15
13:20 - 14:20 |
| (5) |
13:20-14:20 |
[Tutorial Lecture]
NA |
Akinori Kawachi (Tokyo Tech.) |
| |
14:20-14:35 |
Break ( 15 min. ) |
Thu, Sep 15
14:35 - 15:45 |
| (6) |
14:35-15:10 |
A Polynomial Space Polynomial Delay Algorithm for Enumerating Maximal Motifs in a Sequence |
Hiroki Arimura (Hokkaido Univ.), Takeaki Uno (NII) |
| (7) |
15:10-15:45 |
An algorithm for generating vertex sequences to extract maximum weight cliques quickly |
Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
| |
15:45-16:00 |
Break ( 15 min. ) |
Thu, Sep 15
16:00 - 17:10 |
| (8) |
16:00-16:35 |
A Weakly-Adaptive Condition-Based Consensus Algorithm in Asynchronous Distributed Systems |
Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) |
| (9) |
16:35-17:10 |
How Easy to Learn Linear Ranking Functions |
Atsuyoshi Nakamura (Hokkaido Univ.) |