Shigeru Masuyama
- Artificial Intelligence
- Computational Theory and Mathematics top 10%
- Computer Networks and Communications
- Information Systems
- Electrical and Electronic Engineering
- Co-authors
- Hiroyuki SakaiToshihide IbarakiHiroki SakajiHideki SakaiShinichi NakayamaKazuhide YamamotoHajime SasakiAkio Kobayashi
- Topics
- Advanced Graph Theory Research (25 papers)Natural Language Processing Techniques (18 papers)Topic Modeling (17 papers)
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceManagement of Technology and Innovation
- Partner nations
- JapanUnited StatesCanada
In The Last Decade
Shigeru Masuyama
65 papers receiving 174 citations
Peers
Comparison fields: 5 of 51
- Artificial Intelligence 84
- Computational Theory and Mathematics 65
- Computer Networks and Communications 45
- Information Systems 25
- Electrical and Electronic Engineering 24
Countries citing papers authored by Shigeru Masuyama
This map shows the geographic impact of Shigeru Masuyama's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Shigeru Masuyama with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shigeru Masuyama more than expected).
Fields of papers citing papers by Shigeru Masuyama
This network shows the impact of papers produced by Shigeru Masuyama. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Shigeru Masuyama. The network helps show where Shigeru Masuyama may publish in the future.
Co-authorship network of co-authors of Shigeru Masuyama
This figure shows the co-authorship network connecting the top 25 collaborators of Shigeru Masuyama. A scholar is included among the top collaborators of Shigeru Masuyama based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Shigeru Masuyama. Shigeru Masuyama is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Creating Japanese Political Corpus from Local Assembly Minutes of 47 prefectures. | 2 |
| 2 | Extraction of effect and technology terms from a patent document | 3 |
| 3 | Extraction of Effect and Technology Terms from a Patent Document(Theory and Methodology) | 2 |
| 4 | An Extraction Method of Causal Knowledge from Newspaper Corpus | 1 |
| 5 | NTCIR-8 Patent Mining Task at Toyohashi University of Technology | 2 |
| 6 | 1 | |
| 7 | Properties on the Average Number of Spanning Trees in Connected Spanning Subgraphs for an Undirected Graph | 1 |
| 8 | A Statistical Method for Acquiring Knowledge about the Abbreviation POssibility of Some of Multiple Adnominal Phrases | 0 |
| 9 | An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs | 2 |
| 10 | QUARK: A question and answering system using newspaper corpus as a knowledge source | 3 |
| 11 | Automatic Text Summarization -As an Indispenssable Element Technology for Intellectual Activity Sunnort-:Some Research Topics and Future Prospects in Text Summarization -Statistical Method, Paraphrasing, and More- | 0 |
| 12 | Knowledge Acquisition about the Abbreviation Possibility of Verb Phrases | 1 |
| 13 | A Parallel Algorithm for Finding All Hinge Vertices of a Trapezoid Graph | 3 |
| 14 | On a Retrieval Support System by Suggesting Terms to a User. | 2 |
| 15 | A parallel algorithm for finding all hinge vertices of an interval graph | 5 |
| 16 | On the Ambiguity Reduction Ability of a Probabilistic Context-Free Grammar(Special Section on Discrete Mathematics and Its Applications) | 2 |
| 17 | Complexity of Computing the Expected Maximum Number of Edge-Disjoint s-t Paths on Probabilistic Graphs. | 0 |
| 18 | Computing the Expected Maximum Number of Vertex-Disjoint s-t Paths in a Probabilistic Basically Series-Parallel Digraph | 1 |
| 19 | On the Largest Common Subgraph Problem | 2 |
| 20 | On the Minimum Cost Subgraph Problem | 1 |
About Shigeru Masuyama
Shigeru Masuyama is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications, having authored 82 papers that have together received 193 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (25 papers), Natural Language Processing Techniques (18 papers) and Topic Modeling (17 papers). The work is most often cited by research in Computational Theory and Mathematics (65 citations), Artificial Intelligence (84 citations) and Management of Technology and Innovation (15 citations). Shigeru Masuyama has collaborated with scholars based in Japan, United States and Canada. Frequent co-authors include Hiroyuki Sakai, Toshihide Ibaraki, Hiroki Sakaji, Hideki Sakai, Shinichi Nakayama, Kazuhide Yamamoto, Hajime Sasaki, Akio Kobayashi, Yusuke Suzuki and Yoko Nakajima. Their work appears in journals such as IEEE Transactions on Software Engineering, Discrete Applied Mathematics and Algorithmica.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.