2006 |
12 | EE | Ken Tokoro,
Kazuaki Yamaguchi,
Sumio Masuda:
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search.
ACSC 2006: 77-83 |
11 | EE | Kazuaki Yamaguchi,
Sumio Masuda:
An A* Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem.
IEICE Transactions 89-A(2): 544-550 (2006) |
1998 |
10 | EE | Eiichi Tanaka,
Kazunori Takemasa,
Sumio Masuda:
A distance measure for molecular structures and its computing method.
Pattern Recognition Letters 19(3-4): 373-381 (1998) |
1993 |
9 | | Eiichi Tanaka,
Hiroaki Awano,
Sumio Masuda:
A Proximity Measure of Line Drawings for Comparison of Chemical Compounds.
CAIP 1993: 291-298 |
8 | | Nobuyuki Washio,
Eiichi Tanaka,
Sumio Masuda:
A Similarity Measure between 3-D Objects and its Parallel Computation.
CAIP 1993: 322-326 |
1992 |
7 | | Toshio Matsuura,
Tohru Nakamura,
Teruo Higashino,
Kenichi Taniguchi,
Sumio Masuda:
VTM: A Graph Editor for Large Trees.
IFIP Congress (1) 1992: 210-216 |
6 | | Toshinobu Kashiwabara,
Sumio Masuda,
Kazuo Nakajima,
Toshio Fujisawa:
Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph.
J. Algorithms 13(1): 161-174 (1992) |
5 | | Ruey-Der Lou,
Majid Sarrafzadeh,
Chong S. Rim,
Kazuo Nakajima,
Sumio Masuda:
General Circular Permutation Layout.
Mathematical Systems Theory 25(4): 269-292 (1992) |
1990 |
4 | | Sumio Masuda,
Kazuo Nakajima,
Toshinobu Kashiwabara,
Thio Fujisawa:
Crossing Minimization in Linear Embeddings of Graphs.
IEEE Trans. Computers 39(1): 124-127 (1990) |
1989 |
3 | | Nicholas J. Naclerio,
Sumio Masuda,
Kazuo Nakajima:
The Via Minimization Problem is NP-Complete.
IEEE Trans. Computers 38(11): 1604-1608 (1989) |
1988 |
2 | | Sumio Masuda,
Kazuo Nakajima:
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph.
SIAM J. Comput. 17(1): 41-52 (1988) |
1987 |
1 | EE | Nicholas J. Naclerio,
Sumio Masuda,
Kazuo Nakajima:
Via Minimization for Gridless Layouts.
DAC 1987: 159-165 |