default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSumio Masuda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j15]Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda:
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem. Discret. Optim. 41: 100646 (2021)- 2020
- [j14]Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda:
A maximum edge-weight clique extraction algorithm based on branch-and-bound. Discret. Optim. 37: 100583 (2020)
2010 – 2019
- 2019
- [j13]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. 102-A(11): 1481-1489 (2019) - 2018
- [c7]Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda:
A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem. CSII (selected papers) 2018: 27-47 - [i1]Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda:
A Maximum Edge-Weight Clique Extraction Algorithm Based on Branch-and-Bound. CoRR abs/1810.10258 (2018) - 2017
- [j12]Satoshi Shimizu, Kazuaki Yamaguchi
, Toshiki Saitoh, Sumio Masuda:
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound. Discret. Appl. Math. 223: 120-134 (2017) - 2016
- [c6]Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda:
A fast heuristic for the minimum weight vertex cover problem. ICIS 2016: 1-5
2000 – 2009
- 2009
- [j11]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. 56-I(2): 285-293 (2009) - 2006
- [j10]Kazuaki Yamaguchi, Sumio Masuda:
An A* Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(2): 544-550 (2006) - [c5]Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda:
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search. ACSC 2006: 77-83
1990 – 1999
- 1998
- [j9]Eiichi Tanaka, Kazunori Takemasa, Sumio Masuda:
A distance measure for molecular structures and its computing method. Pattern Recognit. Lett. 19(3-4): 373-381 (1998) - 1993
- [j8]Toshio Matsuura, Kenichi Taniguchi, Sumio Masuda, Tohru Nakamura:
A graph editor for large trees with browsing and zooming capabilities. Syst. Comput. Jpn. 24(8): 35-46 (1993) - [c4]Eiichi Tanaka, Hiroaki Awano, Sumio Masuda:
A Proximity Measure of Line Drawings for Comparison of Chemical Compounds. CAIP 1993: 291-298 - [c3]Nobuyuki Washio, Eiichi Tanaka, Sumio Masuda:
A Similarity Measure between 3-D Objects and its Parallel Computation. CAIP 1993: 322-326 - 1992
- [j7]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): 161-174 (1992) - [j6]Ruey-Der Lou, Majid Sarrafzadeh, Chong S. Rim, Kazuo Nakajima, Sumio Masuda:
General Circular Permutation Layout. Math. Syst. Theory 25(4): 269-292 (1992) - [c2]Toshio Matsuura, Tohru Nakamura, Teruo Higashino, Kenichi Taniguchi, Sumio Masuda:
VTM: A Graph Editor for Large Trees. IFIP Congress (1) 1992: 210-216 - 1991
- [j5]Toshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa:
Polynomial time algorithms on circular-arc overlap graphs. Networks 21(2): 195-203 (1991) - 1990
- [j4]Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Toshio Fujisawa:
Efficient algorithms for finding maximum cliques of an overlap graph. Networks 20(2): 157-171 (1990) - [j3]Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Toshio Fujisawa:
Crossing Minimization in Linear Embeddings of Graphs. IEEE Trans. Computers 39(1): 124-127 (1990)
1980 – 1989
- 1989
- [j2]Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima:
The Via Minimization Problem is NP-Complete. IEEE Trans. Computers 38(11): 1604-1608 (1989) - 1988
- [j1]Sumio Masuda, Kazuo Nakajima:
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph. SIAM J. Comput. 17(1): 41-52 (1988) - 1987
- [c1]Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima:
Via Minimization for Gridless Layouts. DAC 1987: 159-165
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
