2007 |
7 | EE | Shin-ichi Nakayama,
Shigeru Masuyama:
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs.
Inf. Process. Lett. 103(6): 216-221 (2007) |
2006 |
6 | 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) |
5 | EE | Shin-ichi Nakayama,
Shigeru Masuyama:
A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs.
IEICE Transactions 89-D(8): 2357-2363 (2006) |
1997 |
4 | EE | Shin-ichi Nakayama,
Shigeru Masuyama:
A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs.
Inf. Process. Lett. 62(6): 323-327 (1997) |
1994 |
3 | EE | Andrew J. Graham,
Richard Goldman,
Wen-Tsuen Chen,
Kerry Hanson,
Nikolay G. Malishev,
Shin-ichi Nakayama:
Technology Summit - A View from the Top (Panel).
DAC 1994: 407 |
1990 |
2 | EE | Shin-ichi Nakayama,
Katsuko Sugai,
Yuriko Hotate,
Masayuki Yoshida:
Simple and fast search system for closely related proteins.
Journal of Chemical Information and Computer Sciences 30(3): 269-271 (1990) |
1988 |
1 | EE | Shin-ichi Nakayama,
Satoko Shigezumi,
Masayuki Yoshida:
Method for clustering proteins by use of all possible pairs of amino acids as structural descriptors.
Journal of Chemical Information and Computer Sciences 28(2): 72-78 (1988) |