The SCEAS System
| |||||||

## Search the dblp DataBase
Sumio Masuda:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
**Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search.**[Citation Graph (0, 0)][DBLP] ACSC, 2006, pp:77-83 [Conf] - Eiichi Tanaka, Hiroaki Awano, Sumio Masuda
**A Proximity Measure of Line Drawings for Comparison of Chemical Compounds.**[Citation Graph (0, 0)][DBLP] CAIP, 1993, pp:291-298 [Conf] - Nobuyuki Washio, Eiichi Tanaka, Sumio Masuda
**A Similarity Measure between 3-D Objects and its Parallel Computation.**[Citation Graph (0, 0)][DBLP] CAIP, 1993, pp:322-326 [Conf] - Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima
**Via Minimization for Gridless Layouts.**[Citation Graph (0, 0)][DBLP] DAC, 1987, pp:159-165 [Conf] - Toshio Matsuura, Tohru Nakamura, Teruo Higashino, Kenichi Taniguchi, Sumio Masuda
**VTM: A Graph Editor for Large Trees.**[Citation Graph (0, 0)][DBLP] IFIP Congress (1), 1992, pp:210-216 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1992, v:13, n:1, pp:161-174 [Journal] - Ruey-Der Lou, Majid Sarrafzadeh, Chong S. Rim, Kazuo Nakajima, Sumio Masuda
**General Circular Permutation Layout.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1992, v:25, n:4, pp:269-292 [Journal] - Eiichi Tanaka, Kazunori Takemasa, Sumio Masuda
**A distance measure for molecular structures and its computing method.**[Citation Graph (0, 0)][DBLP] Pattern Recognition Letters, 1998, v:19, n:3-4, pp:373-381 [Journal] - Sumio Masuda, Kazuo Nakajima
**An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1988, v:17, n:1, pp:41-52 [Journal] - Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Thio Fujisawa
**Crossing Minimization in Linear Embeddings of Graphs.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1990, v:39, n:1, pp:124-127 [Journal] - Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima
**The Via Minimization Problem is NP-Complete.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1989, v:38, n:11, pp:1604-1608 [Journal]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |