Tue, Sep 2 AM 10:00 - 17:30 |
(1) |
10:00-10:30 |
Memory-Efficient Indexing Structure for Permuted Pattern Matching on Multi-Track Strings |
Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) |
(2) |
10:30-11:00 |
A linear time algorithm for finding a spanning tree with non-terminal set $V_{NT}$ on cographs |
Shin-ichi Nakayama (Univ. of Tokushima), Shigeru Masuyama (Toyohashi Univ. of Tech.) |
(3) |
11:00-11:30 |
An Algorithm for Feedback Vertex Set Problem on a Non-degenerate Circular-arc Graph |
Hirotoshi Honma, Yoko Nakajima (Kushiro NCT), Shigeru Masuyama (Toyohashi Univ. Tech.) |
(4) |
11:30-12:00 |
On the number of matrix multiplications in the evaluation of the matrix polynomial I+A+A^2+...+A^{N-1} |
Kotaro Matsumoto, Naofumi Takagi, Kazuyoshi Takagi (Kyoto Univ.) |
|
12:00-13:30 |
Lunch Break ( 90 min. ) |
(5) |
13:30-14:30 |
[Invited Talk]
Modeling and Algorithm/Complexity Theory
-- Scheduling in Railroad, AGV(Automated Guided Vehicle) NPB League as Examples -- |
Shigeru Masuyama (Toyohashi Univ. of Tech.) |
|
14:30-14:45 |
Break ( 15 min. ) |
(6) |
14:45-15:15 |
The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy Approximation Algorithms
-- Preliminary Report -- |
Tomoyuki Yamakami (Univ. of Fukui) |
(7) |
15:15-15:45 |
Quantum digital-to-analog conversion algorithm using decoherence |
Akira Saitoh (Toyohashi Univ. of Tech.) |
(8) |
15:45-16:15 |
A Note on the Class of the Computational Comlexity of the Coin-Exchange Problem of Frobenius |
Shunichi Matsubara (Aoyama Gakuin Univ.) |
|
16:15-16:30 |
Break ( 15 min. ) |
(9) |
16:30-17:00 |
Parallel Algorithm for Determining Shortest Paths in DAG |
Masahiro Migita, Masashi Toda (Kumamoto Univ.) |
(10) |
17:00-17:30 |
Algorithms for Group Gossiping of Mobile Agents |
Jun Ri, Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) |