Via Minimization for Gridless Layouts. - Nicholas J. Naclerio; Sumio Masuda; Kazuo Nakajima (DAC, 1987)

An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph. - Sumio Masuda; Kazuo Nakajima (SIAM J. Comput., 1988)

The Via Minimization Problem is NP-Complete. - Nicholas J. Naclerio; Sumio Masuda; Kazuo Nakajima (IEEE Trans. Computers, 1989)

Efficient algorithms for finding maximum cliques of an overlap graph. - Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa (Networks, 1990)

Crossing Minimization in Linear Embeddings of Graphs. - Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa (IEEE Trans. Computers, 1990)

Polynomial time algorithms on circular-arc overlap graphs. - Toshinobu Kashiwabara; Sumio Masuda; Kazuo Nakajima; Toshio Fujisawa (Networks, 1991)

VTM: A Graph Editor for Large Trees. - Toshio Matsuura; Tohru Nakamura; Teruo Higashino; Kenichi Taniguchi; Sumio Masuda (IFIP Congress (1), 1992)

Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph. - Toshinobu Kashiwabara; Sumio Masuda; Kazuo Nakajima; Toshio Fujisawa (J. Algorithms, 1992)

General Circular Permutation Layout. - Ruey-Der Lou; Majid Sarrafzadeh; Chong S. Rim; Kazuo Nakajima; Sumio Masuda (Math. Syst. Theory, 1992)

A Proximity Measure of Line Drawings for Comparison of Chemical Compounds. - Eiichi Tanaka; Hiroaki Awano; Sumio Masuda (CAIP, 1993)

A Similarity Measure between 3-D Objects and its Parallel Computation. - Nobuyuki Washio; Eiichi Tanaka; Sumio Masuda (CAIP, 1993)

A graph editor for large trees with browsing and zooming capabilities. - Toshio Matsuura; Kenichi Taniguchi; Sumio Masuda; Tohru Nakamura (Syst. Comput. Jpn., 1993)

A distance measure for molecular structures and its computing method. - Eiichi Tanaka; Kazunori Takemasa; Sumio Masuda (Pattern Recognit. Lett., 1998)

Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search. - Ken Tokoro; Kazuaki Yamaguchi; Sumio Masuda (ACSC, 2006)

An A* Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem. - Kazuaki Yamaguchi; Sumio Masuda (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

All-Digital Quadrature Detection With TAD for Radio-Controlled Clocks/Watches. - Sumio Masuda; Takamoto Watanabe; Shigenori Yamauchi; Tomohito Terasawa (IEEE Trans. Circuits Syst. I Regul. Pap., 2009)

A fast heuristic for the minimum weight vertex cover problem. - Satoshi Shimizu; Kazuaki Yamaguchi; Toshiki Saitoh; Sumio Masuda (ICIS, 2016)

Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound. - Satoshi Shimizu; Kazuaki Yamaguchi; Toshiki Saitoh; Sumio Masuda (Discret. Appl. Math., 2017)

A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem. - Satoshi Shimizu; Kazuaki Yamaguchi; Sumio Masuda (CSII (selected papers), 2018)

An Exact Algorithm for the Arrow Placement Problem in Directed Graph Drawings. - Naoto Kido; Sumio Masuda; Kazuaki Yamaguchi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

A maximum edge-weight clique extraction algorithm based on branch-and-bound. - Satoshi Shimizu; Kazuaki Yamaguchi; Sumio Masuda (Discret. Optim., 2020)

Parallelization of a branch-and-bound algorithm for the maximum weight clique problem. - Satoshi Shimizu; Kazuaki Yamaguchi; Sumio Masuda (Discret. Optim., 2021)