Sumio Masuda

Publication Activity (10 Years)

Years Active: 1987-2021
Publications (10 Years): 7

Top Topics

Branch And Bound Procedure

Top Venues

Discret. Optim.

Discret. Appl. Math.

Publications

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