Fri, Jun 29 AM
09:00 - 17:50 |
| (1) |
09:00-09:25 |
A Computaional Complexity for finding a Maximum Clique in a Graph with Maximum Degree 4 |
Hiroaki Nakanishi, Etsuji Tomita (UEC) |
| (2) |
09:25-09:50 |
Linear Time Enumeration of Isolated Bicliques with Part Size Proportion Bounded by Constants |
Hiromitsu Miyagawa, Hiro Ito, Kazuo Iwama (Kyoto Univ.) |
| (3) |
09:50-10:15 |
Testing k-Edge-Connectivity of Digraphs |
Yuichi Yoshida, Hiro Ito (Kyoto Univ.) |
| |
10:15-10:30 |
Break ( 15 min. ) |
| (4) |
10:30-10:55 |
Towards closing a gap between worst-case and average-case NP hardness |
Akinori Kawachi, Osamu Watanabe (Tokyo Inst. of Tech.) |
| (5) |
10:55-11:20 |
Deductive Inference for the Interiors and Exteriors of Horn Theories |
Kazuhisa Makino (Univ. of Tokyo), Hirotaka Ono (Kyushu Univ.) |
| (6) |
11:20-11:45 |
Weighted Random Popular Matchings |
Toshiya Itoh, Osamu Watanabe (Tokyo Inst. of Tech.) |
| |
11:45-13:00 |
Lunch Break ( 75 min. ) |
| (7) |
13:00-14:00 |
|
| |
14:00-14:15 |
Break ( 15 min. ) |
| (8) |
14:15-14:40 |
Simple efficient algorithm for MPQ-tree of an interval graph |
Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara (JAIST) |
| (9) |
14:40-15:05 |
On the complexity of planar n/k-coloring problems |
Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) |
| (10) |
15:05-15:30 |
A Tight Upper Bound on Online Buffer Management for Two-port Shared-Memory Switches |
Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) |
| (11) |
15:30-15:55 |
A Difference-Optimal Algorithm for Gathering Autonomous Mobile Robots with Dynamic Compasses |
Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (Nagoya Inst.of Tech.) |
| |
15:55-16:10 |
Break ( 15 min. ) |
| (12) |
16:10-16:35 |
The Firing Squad Synchronization Problems for Number Patterns on 7-Segment Display |
Kazuya Yamashita (Univ. Toyama), Eigo Takemasa (Univ. Toyama/Nihon Softech), Mitsuru Sakai, Sadaki Hirose (Univ. Toyama) |
| (13) |
16:35-17:00 |
On an Efficient Implementation of a DFA-based Algorithm for the Exetended Regular Expression Membership and Search Problems |
Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano NCT) |
| (14) |
17:00-17:25 |
Linear-Time Recognition of Tree Structures by Deterministic Linear Pushdown Tree Automata |
Akio Fujiyoshi (Ibaraki Univ.) |
| (15) |
17:25-17:50 |
Succinct Array Structure for Patricia Trie |
Susumu Yata, Kazuhiro Morita, Masao Fuketa, Jun-ichi Aoe (Tokushima Univ.) |
ba
t
i
i
-u