Wed, Apr 24 AM
10:00 - 17:20 |
| (1) |
10:00-10:35 |
Answering Reachability Queries by Extending Pruned BFSs to Paths |
Yosuke Yano, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo) |
| (2) |
10:35-11:10 |
Approximate Permuted Pattern Matching and Indexing Structure for Multi-Track Data |
Hiroyuki Ota, Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) |
| (3) |
11:10-11:45 |
Analysis of the Maximum Sum of Exponents of Runs in Strings |
Kazuhiko Kusano, Ryosuke Okuta, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) |
| |
11:45-13:30 |
Lunch Break ( 105 min. ) |
| (4) |
13:30-14:30 |
[Invited Talk]
Introduction on JST ERATO Kawarabayashi Large Graph Project |
Ken-ichi Kawarabayashi (NII) |
| |
14:30-14:45 |
Break ( 15 min. ) |
| (5) |
14:45-15:20 |
Space-efficient Polygon Reconstruction from Angle Information |
Jinhee Chun, Ricardo Garcia, Takeshi Tokuyama (Tohoku Univ.) |
| (6) |
15:20-15:55 |
Notes on Parametric Analysis of k-Route Flow |
Hiroshi Imai, Jean-Francois Baffier, Hidefumi Hiraishi (Univ. of Tokyo) |
| |
15:55-16:10 |
Break ( 15 min. ) |
| (7) |
16:10-16:45 |
An Algorithm for Finding an Orthogonal Drawing of a Hierarchical Graph |
Tetsuya Araki, Sumio Masuda, Ikunori Matoba, Kazuaki Yamaguchi, Toshiki Saitoh (Kobe Univ.) |
| (8) |
16:45-17:20 |
Computational complexity and an integer programming model of Shakashaka |
Erik Demaine (Massachusetts Inst. of Tech.), Yoshio Okamoto (Univ. of Electro-Comm.), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Prefecture Univ.) |
n
e
is
is
