default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShigeru Masuyama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j46]Hajime Sasaki
, Motomasa Fujii, Hiroki Sakaji, Shigeru Masuyama:
Enhancing Risk Identification with GNN: Edge Classification in Risk Causality from Securities Reports. Int. J. Inf. Manag. Data Insights 4(1): 100217 (2024)- 2022
- [j45]Shin-ichi Nakayama, Shigeru Masuyama:
A Polynomial-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Circular-Arc Graphs. IEICE Trans. Inf. Syst. 105-D(8): 1373-1382 (2022) - [j44]Motomasa Fujii, Hiroki Sakaji, Shigeru Masuyama, Hajime Sasaki:
Extraction and classification of risk-related sentences from securities reports. Int. J. Inf. Manag. Data Insights 2(2): 100096 (2022) - [j43]Kazuko Obayashi, Naonori Kodate, Shigeru Masuyama:
Assessing the Impact of an Original Soft Communicative Robot in a Nursing Home in Japan: Will Softness or Conversations Bring more Smiles to Older People? Int. J. Soc. Robotics 14(3): 645-656 (2022) - 2020
- [j42]Hirotoshi Honma, Yoko Nakajima, Shigeru Masuyama:
An Algorithm for the Influential Hinge Vertex Problem on Interval Graphs. J. Inf. Process. 28: 1047-1051 (2020)
2010 – 2019
- 2019
- [j41]Shin-ichi Nakayama, Shigeru Masuyama:
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs. IEICE Trans. Inf. Syst. 102-D(4): 826-835 (2019) - 2018
- [j40]Kazuko Obayashi, Naonori Kodate, Shigeru Masuyama:
Enhancing older people's activity and participation with socially assistive robots: a multicentre quasi-experimental study using the ICF framework. Adv. Robotics 32(22): 1207-1216 (2018) - [j39]Shin-ichi Nakayama, Shigeru Masuyama:
A Linear-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Interval Graphs. IEICE Trans. Inf. Syst. 101-D(9): 2235-2246 (2018) - 2017
- [j38]Shin-ichi Nakayama, Shigeru Masuyama:
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Outerplanar Graphs. IEICE Trans. Inf. Syst. 100-D(3): 434-443 (2017) - [j37]Hirotoshi Honma, Yoko Nakajima, Shigeru Masuyama:
An Algorithm for Hinge Vertex Problem on Circular Trapezoid Graphs. J. Inf. Process. 25: 945-948 (2017) - 2016
- [j36]Shin-ichi Nakayama, Shigeru Masuyama:
A Linear Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Cographs. IEICE Trans. Inf. Syst. 99-D(10): 2574-2584 (2016) - [c17]Yasutomo Kimura, Keiichi Takamaru, Takuma Tanaka, Akio Kobayashi, Hiroki Sakaji, Yuzu Uchida, Hokuto Ototake, Shigeru Masuyama:
Creating Japanese Political Corpus from Local Assembly Minutes of 47 prefectures. ALR@COLING 2016: 78-85 - 2015
- [j35]Hirotoshi Honma, Yoko Nakajima, Yuta Igarashi, Shigeru Masuyama:
Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1161-1167 (2015) - [c16]Akihito Ikeda, Akio Kobayashi, Hiroki Sakaji, Shigeru Masuyama:
Classification of Comments on Nico Nico Douga for Annotation Based on Referred Contents. NBiS 2015: 673-678 - 2014
- [j34]Junya Nakamura, Tadashi Araragi, Toshimitsu Masuzawa, Shigeru Masuyama:
A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance. IEICE Trans. Inf. Syst. 97-D(1): 53-64 (2014) - [j33]Junya Nakamura, Tadashi Araragi, Shigeru Masuyama, Toshimitsu Masuzawa:
Efficient Randomized Byzantine Fault-Tolerant Replication Based on Special Valued Coin Tossing. IEICE Trans. Inf. Syst. 97-D(2): 231-244 (2014) - [j32]Hirotoshi Honma, Yoko Nakajima, Yuta Igarashi, Shigeru Masuyama:
Algorithm for Finding Maximum Detour Hinge Vertices of Interval Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1365-1369 (2014) - 2013
- [j31]Hirotoshi Honma, Kodai Abe, Yoko Nakajima, Shigeru Masuyama:
Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs. IEICE Trans. Inf. Syst. 96-D(3): 419-425 (2013) - [j30]Hirotoshi Honma, Yoko Nakajima, Haruka Aoshima, Shigeru Masuyama:
A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(6): 1051-1058 (2013) - 2011
- [j29]Hirotoshi Honma, Yutaro Kitamura, Shigeru Masuyama:
An Algorithm for Minimum Feedback Vertex Set Problem on a Trapezoid Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1381-1385 (2011) - [j28]Hirotoshi Honma, Kodai Abe, Shigeru Masuyama:
Erratum and addendum to "A linear time algorithm for finding all hinge vertices of a permutation graph" [Information Processing Letters 59 (2) (1996) 103-107]. Inf. Process. Lett. 111(18): 891-894 (2011) - 2010
- [j27]Peng Cheng, Shigeru Masuyama:
A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ... edges. Discret. Appl. Math. 158(6): 608-619 (2010) - [c15]Yusuke Suzuki, Hirofumi Nonaka, Hiroki Sakaji, Akio Kobayashi, Hiroyuki Sakai, Shigeru Masuyama:
NTCIR-8 Patent Mining Task at Toyohashi University of Technology. NTCIR 2010: 364-369
2000 – 2009
- 2009
- [j26]Hirotoshi Honma, Saki Honma, Shigeru Masuyama:
An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs. IEICE Trans. Inf. Syst. 92-D(2): 141-148 (2009) - [j25]Hiroyuki Sakai, Shigeru Masuyama:
Assigning Polarity to Causal Information in Financial Articles on Business Performance of Companies. IEICE Trans. Inf. Syst. 92-D(12): 2341-2350 (2009) - [c14]Takahisa Ota, Shigeru Masuyama:
Automatic plagiarism detection among term papers. IUCS 2009: 395-399 - [c13]Junya Nakamura, Tadashi Araragi, Shigeru Masuyama:
Acceleration of Byzantine Fault Tolerance by Parallelizing Consensuses. PDCAT 2009: 80-87 - 2008
- [j24]Hirotoshi Honma, Shigeru Masuyama:
An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(1): 383-391 (2008) - [j23]Peng Cheng, Shigeru Masuyama:
Inequalities on the Number of Connected Spanning Subgraphs in a Multigraph. IEICE Trans. Inf. Syst. 91-D(2): 178-186 (2008) - [j22]Hiroyuki Sakai, Shigeru Masuyama:
Cause Information Extraction from Financial Articles Concerning Business Performance. IEICE Trans. Inf. Syst. 91-D(4): 959-968 (2008) - [j21]Masanobu Tsuruta, Hiroyuki Sakai, Shigeru Masuyama:
An Informative DOM Subtree Identification Method from Web Pages in Unfamiliar Web Sites. IEICE Trans. Inf. Syst. 91-D(4): 986-989 (2008) - [j20]Hirotoshi Honma, Shigeru Masuyama:
An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2296-2300 (2008) - [j19]Peng Cheng, Shigeru Masuyama:
Formulas for Counting the Numbers of Connected Spanning Subgraphs with at Most n+1 Edges in a Complete Graph Kn. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2314-2321 (2008) - [c12]Hiroki Sakaji, Hiroyuki Sakai, Shigeru Masuyama:
Automatic Extraction of Basis Expressions That Indicate Economic Trends. PAKDD 2008: 977-984 - [c11]Hiroki Sakaji, Satoshi Sekine, Shigeru Masuyama:
Extracting Causal Knowledge Using Clue Phrases and Syntactic Patterns. PAKM 2008: 111-122 - [c10]Hiroyuki Sakai, Shigeru Masuyama:
Polarity Assignment to Causal Information Extracted from Financial Articles Concerning Business Performance of Companies. SGAI Conf. 2008: 307-320 - 2007
- [j18]Shin-ichi Nakayama, Shigeru Masuyama:
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs. Inf. Process. Lett. 103(6): 216-221 (2007) - [c9]Hiroyuki Sakai, Shigeru Masuyama:
Extraction of Cause Information from Newspaper Articles Concerning Business Performance. AIAI 2007: 205-212 - 2006
- [j17]Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao:
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem. Discret. Appl. Math. 154(16): 2402-2410 (2006) - [j16]Shin-ichi Nakayama, Shigeru Masuyama:
A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs. IEICE Trans. Inf. Syst. 89-D(8): 2357-2363 (2006) - [j15]Hiroyuki Sakai, Shigeru Masuyama:
Knowledge acquisition about the deletion possibility of adnominal verb phrases. Syst. Comput. Jpn. 37(2): 25-36 (2006) - 2005
- [j14]Atsushi Sasaki, Tadashi Araragi, Shigeru Masuyama, Keizo Miyata:
Formulation of Mobile Agent Allocation and its Strong NP-Completeness. IEICE Trans. Inf. Syst. 88-D(5): 1060-1063 (2005) - 2004
- [c8]Hiroyuki Sakai, Shigeru Masuyama:
A Multiple-Document Summarization System with User Interaction. COLING 2004 - [c7]Yasuo Nii, Keizo Kawata, Tatsumi Yoshida, Hiroyuki Sakai, Shigeru Masuyama:
Question Answering System QUARK. NTCIR 2004 - [c6]Hiroyuki Sakai, Shigeru Masuyama:
A Multiple-Document Summarization System Introducing User Interaction for Reflecting User's Summarization Need. NTCIR 2004 - [c5]Masanobu Tsuruta, Yoshiyuki Umemura, Hiroyuki Sakai, Shigeru Masuyama:
A Web Search Result Classification System Based on the Degree of Suitability for Specialists. NTCIR 2004 - 2003
- [j13]Shin-ichi Nakayama, Shigeru Masuyama:
An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1019-1026 (2003) - [j12]Peng Cheng, Shigeru Masuyama:
Properties on the Average Number of Spanning Trees in Connected Spanning Subgraphs for an Undirected Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1027-1033 (2003) - 2002
- [j11]Hirotoshi Honma, Shigeru Masuyama:
A Parallel Algorithm for Finding All Hinge Vertices of a Trapezoid Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 1031-1040 (2002) - [c4]Keizo Kawata, Hiroyuki Sakai, Shigeru Masuyama:
QUARK: A Question and Answering System using Newspaper Corpus as a Knowledge Source. NTCIR 2002 - [c3]Hiroyuki Sakai, Shigeru Masuyama:
Unsupervised Acquisition of Knowledge about the Abbreviation Possibility of some of Multiple Phrases modifying the same Verb/Noun. NTCIR 2002 - 2001
- [c2]Kiyonori Ohtake, Daigo Okamoto, Mitsuru Kodama, Shigeru Masuyama:
Yet Another Summarization System with Two Modules using Empirical Knowledge. NTCIR 2001 - [c1]Hiroyuki Sakai, Kiyonori Ohtake, Shigeru Masuyama:
On a Retrieval Support System by Suggesting Terms to a User. NTCIR 2001
1990 – 1999
- 1998
- [j10]Chishun Kanayama, Shigeru Masuyama:
Animation of tree sway. Syst. Comput. Jpn. 29(1): 43-52 (1998) - 1997
- [j9]Shin-ichi Nakayama, Shigeru Masuyama:
A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs. Inf. Process. Lett. 62(6): 323-327 (1997) - 1995
- [j8]Peng Cheng, Shigeru Masuyama:
A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs. Discret. Appl. Math. 56(2-3): 137-155 (1995) - 1994
- [j7]Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi:
Edge-disjoint packings of graphs. Discret. Appl. Math. 50(2): 135-148 (1994) - [j6]Peng Chen, Shigeru Masuyama:
On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph. Inf. Process. Lett. 51(4): 195-199 (1994) - 1992
- [j5]Shigeru Masuyama:
On the tree packing problem. Discret. Appl. Math. 35(2): 163-166 (1992) - [j4]Shigeru Masuyama, Shozo Naito:
Deciding Whether Graph G has Page Number One is in NC. Inf. Process. Lett. 44(1): 7-10 (1992) - 1991
- [j3]Shigeru Masuyama, Toshihide Ibaraki:
Chain Packing in Graphs. Algorithmica 6(6): 826-839 (1991)
1980 – 1989
- 1988
- [j2]Makoto Takeda, Shigeru Masuyama, Toshihide Ibaraki:
Cautious Transaction Schedulers with k Versions. Syst. Comput. Jpn. 19(7): 46-55 (1988) - 1987
- [j1]Shigeru Masuyama, Toshihide Ibaraki, Shojiro Nishio, Toshiharu Hasegawa:
Shortest Semijoin Schedule for a Local Area Distributed Database System. IEEE Trans. Software Eng. 13(5): 602-606 (1987)
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-05-19 00:57 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:
