Sumio Masuda

23 papers A* 1C 3Journal 16Unranked 3
YearRankTypeTitle / Venue / Authors
2021 J jnl
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem.
Discret. Optim.
Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda
2020 J jnl
A maximum edge-weight clique extraction algorithm based on branch-and-bound.
Discret. Optim.
Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda
2019 J jnl
An Exact Algorithm for the Arrow Placement Problem in Directed Graph Drawings.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Naoto Kido, Sumio Masuda, Kazuaki Yamaguchi
2018 — conf
A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem.
CSII (selected papers)
Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda
2018 J jnl
A Maximum Edge-Weight Clique Extraction Algorithm Based on Branch-and-Bound.
CoRR
Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda
2017 J jnl
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound.
Discret. Appl. Math.
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda
2016 C conf
A fast heuristic for the minimum weight vertex cover problem.
ICIS
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda
2009 J jnl
All-Digital Quadrature Detection With TAD for Radio-Controlled Clocks/Watches.
IEEE Trans. Circuits Syst. I Regul. Pap.
Sumio Masuda, Takamoto Watanabe, Shigenori Yamauchi, Tomohito Terasawa
2006 J jnl
An
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kazuaki Yamaguchi, Sumio Masuda
2006 — conf
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search.
ACSC
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
1998 J jnl
A distance measure for molecular structures and its computing method.
Pattern Recognit. Lett.
Eiichi Tanaka, Kazunori Takemasa, Sumio Masuda
1993 C conf
A Proximity Measure of Line Drawings for Comparison of Chemical Compounds.
CAIP
Eiichi Tanaka, Hiroaki Awano, Sumio Masuda
1993 C conf
A Similarity Measure between 3-D Objects and its Parallel Computation.
CAIP
Nobuyuki Washio, Eiichi Tanaka, Sumio Masuda
1993 J jnl
A graph editor for large trees with browsing and zooming capabilities.
Syst. Comput. Jpn.
Toshio Matsuura, Kenichi Taniguchi, Sumio Masuda, Tohru Nakamura
1992 J jnl
General Circular Permutation Layout.
Math. Syst. Theory
Ruey-Der Lou, Majid Sarrafzadeh, Chong S. Rim, Kazuo Nakajima, Sumio Masuda
1992 J jnl
Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph.
J. Algorithms
Toshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa
1992 — conf
VTM: A Graph Editor for Large Trees.
IFIP Congress (1)
Toshio Matsuura, Tohru Nakamura, Teruo Higashino, Kenichi Taniguchi, Sumio Masuda
1991 J jnl
Polynomial time algorithms on circular-arc overlap graphs.
Networks
Toshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa
1990 J jnl
Crossing Minimization in Linear Embeddings of Graphs.
IEEE Trans. Computers
Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Toshio Fujisawa
1990 J jnl
Efficient algorithms for finding maximum cliques of an overlap graph.
Networks
Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Toshio Fujisawa
1989 J jnl
The Via Minimization Problem is NP-Complete.
IEEE Trans. Computers
Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima
1988 J jnl
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph.
SIAM J. Comput.
Sumio Masuda, Kazuo Nakajima
1987 A* conf
Via Minimization for Gridless Layouts.
DAC
Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima