Shigeru Masuyama
Orcid: 0000-0002-9922-6258
According to our database1,
Shigeru Masuyama
authored at least 63 papers
between 1987 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
9
10
1
3
1
1
2
2
1
1
3
2
2
1
2
6
1
3
1
2
1
1
1
1
2
2
1
1
1
1
1
1
2
3
1
4
2
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Enhancing Risk Identification with GNN: Edge Classification in Risk Causality from Securities Reports.
Int. J. Inf. Manag. Data Insights, 2024
2022
A Polynomial-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Circular-Arc Graphs.
IEICE Trans. Inf. Syst., August, 2022
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, 2022
Int. J. Inf. Manag. Data Insights, 2022
2020
J. Inf. Process., 2020
2019
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Series-Parallel Graphs.
IEICE Trans. Inf. Syst., 2019
2018
A Linear-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Interval Graphs.
IEICE Trans. Inf. Syst., 2018
Enhancing older people's activity and participation with socially assistive robots: a multicentre quasi-experimental study using the ICF framework.
Adv. Robotics, 2018
2017
J. Inf. Process., 2017
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Outerplanar Graphs.
IEICE Trans. Inf. Syst., 2017
2016
A Linear Time Algorithm for Finding a Spanning Tree with Non-Terminal Set <i>V<sub>NT</sub></i> on Cographs.
IEICE Trans. Inf. Syst., 2016
Proceedings of the 12th Workshop on Asian Language Resources, 2016
2015
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
Classification of Comments on Nico Nico Douga for Annotation Based on Referred Contents.
Proceedings of the 18th International Conference on Network-Based Information Systems, 2015
2014
Efficient Randomized Byzantine Fault-Tolerant Replication Based on Special Valued Coin Tossing.
IEICE Trans. Inf. Syst., 2014
IEICE Trans. Inf. Syst., 2014
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014
2013
A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs.
IEICE Trans. Inf. Syst., 2013
2011
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., 2011
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011
2010
A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ... edges.
Discret. Appl. Math., 2010
Proceedings of the 8th NTCIR Workshop Meeting on Evaluation of Information Access Technologies: Information Retrieval, 2010
2009
Assigning Polarity to Causal Information in Financial Articles on Business Performance of Companies.
IEICE Trans. Inf. Syst., 2009
An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs.
IEICE Trans. Inf. Syst., 2009
Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009
Proceedings of the 3rd International Universal Communication Symposium, 2009
2008
An Informative DOM Subtree Identification Method from Web Pages in Unfamiliar Web Sites.
IEICE Trans. Inf. Syst., 2008
Cause Information Extraction from Financial Articles Concerning Business Performance.
IEICE Trans. Inf. Syst., 2008
An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008
An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008
Formulas for Counting the Numbers of Connected Spanning Subgraphs with at Most <i>n</i>+1 Edges in a Complete Graph K<sub>n</sub>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008
IEICE Trans. Inf. Syst., 2008
Polarity Assignment to Causal Information Extracted from Financial Articles Concerning Business Performance of Companies.
Proceedings of the Research and Development in Intelligent Systems XXV, 2008
Proceedings of the Practical Aspects of Knowledge Management, 7th International Conference, 2008
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008
2007
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs.
Inf. Process. Lett., 2007
Extraction of Cause Information from Newspaper Articles Concerning Business Performance.
Proceedings of the Artificial Intelligence and Innovations 2007: from Theory to Applications, 2007
2006
Syst. Comput. Jpn., 2006
A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs.
IEICE Trans. Inf. Syst., 2006
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem.
Discret. Appl. Math., 2006
2005
IEICE Trans. Inf. Syst., 2005
2004
A Web Search Result Classification System Based on the Degree of Suitability for Specialists.
Proceedings of the Fourth NTCIR Workshop on Research in Information Access Technologies Information Retrieval, 2004
A Multiple-Document Summarization System Introducing User Interaction for Reflecting User's Summarization Need.
Proceedings of the Fourth NTCIR Workshop on Research in Information Access Technologies Information Retrieval, 2004
Proceedings of the Fourth NTCIR Workshop on Research in Information Access Technologies Information Retrieval, 2004
Proceedings of the COLING 2004, 2004
2003
An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003
Properties on the Average Number of Spanning Trees in Connected Spanning Subgraphs for an Undirected Graph.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003
2002
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002
Unsupervised Acquisition of Knowledge about the Abbreviation Possibility of some of Multiple Phrases modifying the same Verb/Noun.
Proceedings of the Third NTCIR Workshop on Research in Information Retrieval, 2002
Proceedings of the Third NTCIR Workshop on Research in Information Retrieval, 2002
2001
Proceedings of the Third Second Workshop Meeting on Evaluation of Chinese & Japanese Text Retrieval and Text Summarization, 2001
Proceedings of the Third Second Workshop Meeting on Evaluation of Chinese & Japanese Text Retrieval and Text Summarization, 2001
1998
1997
Inf. Process. Lett., 1997
1995
A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs.
Discret. Appl. Math., 1995
1994
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., 1994
1992
1991
1988
1987
IEEE Trans. Software Eng., 1987