| |
| 2006 | ||
|---|---|---|
| 2 | EE | Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao: Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem. Discrete Applied Mathematics 154(16): 2402-2410 (2006) |
| 2005 | ||
| 1 | EE | Atsushi Sasaki, Tadashi Araragi, Shigeru Masuyama, Keizo Miyata: Formulation of Mobile Agent Allocation and its Strong NP-Completeness. IEICE Transactions 88-D(5): 1060-1063 (2005) |
| 1 | Tadashi Araragi | [1] |
| 2 | Shigeru Masuyama | [1] [2] |
| 3 | Shin-ichi Nakayama | [2] |
| 4 | Atsushi Sasaki | [1] |
| 5 | Liang Zhao | [2] |