Sumio Masuda

Orcid: 0000-0002-4014-7168

According to our database1, Sumio Masuda authored at least 22 papers between 1987 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem.
Discret. Optim., 2021

2020
A maximum edge-weight clique extraction algorithm based on branch-and-bound.
Discret. Optim., 2020

2019
An Exact Algorithm for the Arrow Placement Problem in Directed Graph Drawings.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

2018
A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem.
Proceedings of the Computational Science/Intelligence & Applied Informatics, 2018

2017
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound.
Discret. Appl. Math., 2017

2016
A fast heuristic for the minimum weight vertex cover problem.
Proceedings of the 15th IEEE/ACIS International Conference on Computer and Information Science, 2016

2009
All-Digital Quadrature Detection With TAD for Radio-Controlled Clocks/Watches.
IEEE Trans. Circuits Syst. I Regul. Pap., 2009

2006
An <i>A</i><sup>*</sup> Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search.
Proceedings of the Computer Science 2006, 2006

1998
A distance measure for molecular structures and its computing method.
Pattern Recognit. Lett., 1998

1993
A graph editor for large trees with browsing and zooming capabilities.
Syst. Comput. Jpn., 1993

A Similarity Measure between 3-D Objects and its Parallel Computation.
Proceedings of the Computer Analysis of Images and Patterns, 5th International Conference, 1993

A Proximity Measure of Line Drawings for Comparison of Chemical Compounds.
Proceedings of the Computer Analysis of Images and Patterns, 5th International Conference, 1993

1992
General Circular Permutation Layout.
Math. Syst. Theory, 1992

Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph.
J. Algorithms, 1992

VTM: A Graph Editor for Large Trees.
Proceedings of the Algorithms, Software, Architecture, 1992

1991
Polynomial time algorithms on circular-arc overlap graphs.
Networks, 1991

1990
Crossing Minimization in Linear Embeddings of Graphs.
IEEE Trans. Computers, 1990

Efficient algorithms for finding maximum cliques of an overlap graph.
Networks, 1990

1989
The Via Minimization Problem is NP-Complete.
IEEE Trans. Computers, 1989

1988
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph.
SIAM J. Comput., 1988

1987
Via Minimization for Gridless Layouts.
Proceedings of the 24th ACM/IEEE Design Automation Conference. Miami Beach, FL, USA, June 28, 1987


  Loading...