|
|
| Chair |
|
Masafumi Yamashita |
| Vice Chair |
|
Tatsuya Akutsu |
| Secretary |
|
Kunihiko Sadakane, Keisuke Tanaka |
|
Wed, Apr 26 AM
09:20 - 10:30 |
| (1) |
09:20-09:55 |
Optimality of Balanced Semi-Matchings |
Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
| (2) |
09:55-10:30 |
Reducing L versus P to Reversal versus Access |
Kenya Ueno (Univ. of Tokyo) |
| |
10:30-10:50 |
Break ( 20 min. ) |
Wed, Apr 26 AM
10:50 - 12:00 |
| (3) |
10:50-11:25 |
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths |
Shin-ichi Tanigawa, Naoki Katoh (Kyoto Univ.) |
| (4) |
11:25-12:00 |
Efficient Broadcasting and Gathering Algorithms on Dynamic Sensor Networks |
Naoki Inaba, Jiro Uchida, Yoshiaki Katayama (Nagoya Inst. of Tech.), Wei Chen (Tennessee State Univ.), Koichi Wada (Nagoya Inst. of Tech.) |
| |
12:00-13:40 |
Lunch Break, Steering Comittee ( 100 min. ) |
Wed, Apr 26 PM
13:40 - 15:25 |
| (5) |
13:40-14:15 |
Searching Scale-Free Networks with Local Information |
Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
| (6) |
14:15-14:50 |
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity |
Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa (Kyoto Univ.) |
| (7) |
14:50-15:25 |
An Efficient Alignability Decision Algorithm for Unordered Trees |
Tetsuji Kuboyama, Kilho Shin (Univ. of Tokyo) |
| |
15:25-15:45 |
Break ( 20 min. ) |
Wed, Apr 26 PM
15:45 - 16:55 |
| (8) |
15:45-16:20 |
A simple algorithm for testing isomorphism of chordal graphs |
Seinosuke Toda (Nihon Univ.) |
| (9) |
16:20-16:55 |
An exact algorithm for the label placement problem |
Yuichi Inoue, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
|
Last modified: 2006-02-24 16:26:35
|