Mon, Mar 9 AM
09:40 - 11:40 |
| (1) |
09:40-10:10 |
On a Gathering Problem for Large size Fat Robots in a Grid |
Yoshinobu Ito, Yoshiaki Katayama (NIT), Koichi Wada (Hosei) |
| (2) |
10:10-10:40 |
A Note on Irreversible 2-Conversion Sets in Subcubic Graphs |
Asahi Takaoka, Shuichi Ueno (Tokyo Tech) |
| (3) |
10:40-11:10 |
Node Overlap Removal with Basis Nodes |
Noboru Abe, Hiroaki Oh, Kouhei Inoue (Osaka Electro-Communication Univ.) |
| (4) |
11:10-11:40 |
ZDD Construction for Maximal Independent Set Enumeration on Hypergraph |
Teruji Sugaya (OUJ), Takahisa Toda (UEC), Shin-ichi Minato (HU) |
| |
11:40-13:00 |
Lunck Break ( 80 min. ) |
Mon, Mar 9 PM
13:00 - 14:00 |
| (5) |
13:00-14:00 |
[Invited Talk]
Algorithms in natural computing : a parallel Exhaustive search and an optimization technique using biological behaviors |
Akihiro Fujiwara (Kyutech) |
| |
14:00-14:15 |
Break ( 15 min. ) |
Mon, Mar 9 PM
14:15 - 17:00 |
| (6) |
14:15-14:45 |
Maximum Supply Rate and Minimum Supply Increase Rate of Supply and Demand Networks |
Hironori Yoshihara, Takao Nishizeki (KGU) |
| (7) |
14:45-15:15 |
Efficient Algorithms for Parametric Supply-Demand Tree Networks |
Naoki Takahashi, Takao Nishizeki (Kwansei Gakuin Univ) |
| (8) |
15:15-15:45 |
NP-hardness of Finding Minimum Test Set for Detecting Stuck-at and/or Bridging Faults in a Reversible Circuit |
Hibiki Takakura, Toshinori Yamada (Saitama Univ.) |
| |
15:45-16:00 |
Break ( 15 min. ) |
| (9) |
16:00-16:30 |
On a 2-approximation Self-stabilizing Algorithm for the Maximum Leaf Spanning Tree |
Keisuke Okamoto, Yoshiaki Katayama (NIT) |
| (10) |
16:30-17:00 |
Tangle and ideal |
Koichi Yamazaki (Gunma Univ.) |
: 
is
c