Shuji Kijima
About
In The Last Decade
Shuji Kijima
28 papers receiving 127 citations
Peers
Comparison fields: 5 of 37
- Computer Networks and Communications 78
- Mechanical Engineering 59
- Statistics and Probability 34
- Artificial Intelligence 20
- Computational Theory and Mathematics 20
Countries citing papers authored by Shuji Kijima
This map shows the geographic impact of Shuji Kijima'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 Shuji Kijima with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shuji Kijima more than expected).
Fields of papers citing papers by Shuji Kijima
This network shows the impact of papers produced by Shuji Kijima. 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 Shuji Kijima. The network helps show where Shuji Kijima may publish in the future.
Co-authorship network of co-authors of Shuji Kijima
This figure shows the co-authorship network connecting the top 25 collaborators of Shuji Kijima. A scholar is included among the top collaborators of Shuji Kijima 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 Shuji Kijima. Shuji Kijima is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 2 | |
| 5 | 11 | |
| 6 | 3 | |
| 7 | 1 | |
| 8 | 34 | |
| 9 | Deterministic Random Walks for Irrational Transition Probabilities | 0 |
| 10 | 10 | |
| 11 | 1 | |
| 12 | 1 | |
| 13 | 1 | |
| 14 | How slow, or fast, are standard random walks? - Analysis of hitting and cover times on trees | 1 |
| 15 | Counting the number of dominating sets in graph classes | 0 |
| 16 | 1 | |
| 17 | 1 | |
| 18 | 12 | |
| 19 | 1 | |
| 20 | Approximate Counting Scheme for m × n Contingency Tables | 5 |
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.