![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 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) | |
| 4 | Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Thio Fujisawa: Crossing Minimization in Linear Embeddings of Graphs. IEEE Trans. Computers 39(1): 124-127 (1990) | |
| 3 | Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima: The Via Minimization Problem is NP-Complete. IEEE Trans. Computers 38(11): 1604-1608 (1989) | |
| 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) | |
| 1 | Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima: Via Minimization for Gridless Layouts. DAC 1987: 159-165 |
Selection of 6 from 12 records - Sumio Masuda has 18 coauthors
Copyright © 2009-12-08 by Michael Ley (ley@uni-trier.de)