Sumio Masuda - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2021

Parallelization of a branch-and-bound algorithm for the maximum weight clique problemSatoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda. disopt, 41:100646, 2021. [doi]

2020

A maximum edge-weight clique extraction algorithm based on branch-and-boundSatoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda. disopt, 37:100583, 2020. [doi]

2019

An Exact Algorithm for the Arrow Placement Problem in Directed Graph DrawingsNaoto Kido, Sumio Masuda, Kazuaki Yamaguchi. ieicet, 102-A(11):1481-1489, 2019. [doi]

2018

A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique ProblemSatoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda. csii 2019: 27-47 [doi]

2017

Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-boundSatoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda. DAM, 223:120-134, 2017. [doi]

2016

A fast heuristic for the minimum weight vertex cover problemSatoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda. ACISicis 2016: 1-5 [doi]

2009

All-Digital Quadrature Detection With TAD for Radio-Controlled Clocks/WatchesSumio Masuda, Takamoto Watanabe, Shigenori Yamauchi, Tomohito Terasawa. tcas, 56-I(2):285-293, 2009. [doi]

2006

Improvements of TLAESA nearest neighbour search algorithm and extension to approximation searchKen Tokoro, Kazuaki Yamaguchi, Sumio Masuda. acsc 2006: 77-83 [doi]

An ::::A:::::::*::: Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path ProblemKazuaki Yamaguchi, Sumio Masuda. ieicet, 89-A(2):544-550, 2006. [doi]

1998

A distance measure for molecular structures and its computing methodEiichi Tanaka, Kazunori Takemasa, Sumio Masuda. prl, 19(3-4):373-381, 1998. [doi]

1993

A graph editor for large trees with browsing and zooming capabilitiesToshio Matsuura, Kenichi Taniguchi, Sumio Masuda, Tohru Nakamura. scjapan, 24(8):35-46, 1993. [doi]

A Proximity Measure of Line Drawings for Comparison of Chemical CompoundsEiichi Tanaka, Hiroaki Awano, Sumio Masuda. caip 1993: 291-298

A Similarity Measure between 3-D Objects and its Parallel ComputationNobuyuki Washio, Eiichi Tanaka, Sumio Masuda. caip 1993: 322-326

1992

1991

Polynomial time algorithms on circular-arc overlap graphsToshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa. networks, 21(2):195-203, 1991. [doi]

1990

Crossing Minimization in Linear Embeddings of GraphsSumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Thio Fujisawa. TC, 39(1):124-127, 1990.

Efficient algorithms for finding maximum cliques of an overlap graphSumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Toshio Fujisawa. networks, 20(2):157-171, 1990. [doi]

1989

The Via Minimization Problem is NP-CompleteNicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima. TC, 38(11):1604-1608, 1989.

1988

An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc GraphSumio Masuda, Kazuo Nakajima. SICOMP, 17(1):41-52, 1988.

1987

Via Minimization for Gridless LayoutsNicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima. dac 1987: 159-165 [doi]

Sign in or sign up to see more results.

runs on WebDSL