PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Masuda, Sumio"

Author of the publication

copydeleteadd this publication to your clipboard
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph.

, and . SIAM J. Comput., 17 (1): 41-52 (1988)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Masuda, Sumio
add a person with the name Masuda, Sumio
 

Other publications of authors with the same name

Efficient algorithms for finding maximum cliques of an overlap graph., , , and . Networks, 20 (2): 157-171 (1990)A Similarity Measure between 3-D Objects and its Parallel Computation., , and . CAIP, volume 719 of Lecture Notes in Computer Science, page 322-326. Springer, (1993)A distance measure for molecular structures and its computing method., , and . Pattern Recognition Letters, 19 (3-4): 373-381 (1998)A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem., , and . CSII (selected papers), volume 787 of Studies in Computational Intelligence, page 27-47. Springer, (2018)VTM: A Graph Editor for Large Trees., , , , and . IFIP Congress (1), volume A-12 of IFIP Transactions, page 210-216. North-Holland, (1992)A Proximity Measure of Line Drawings for Comparison of Chemical Compounds., , and . CAIP, volume 719 of Lecture Notes in Computer Science, page 291-298. Springer, (1993)Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search., , and . ACSC, volume 48 of CRPIT, page 77-83. Australian Computer Society, (2006)A graph editor for large trees with browsing and zooming capabilities., , , and . Systems and Computers in Japan, 24 (8): 35-46 (1993)A Maximum Edge-Weight Clique Extraction Algorithm Based on Branch-and-Bound., , and . CoRR, (2018)A fast heuristic for the minimum weight vertex cover problem., , , and . ICIS, page 1-5. IEEE Computer Society, (2016)