Kengo Katayama
About
In The Last Decade
Kengo Katayama
37 papers receiving 418 citations
Peers
Comparison fields: 5 of 69
- Artificial Intelligence 232
- Computational Theory and Mathematics 155
- Industrial and Manufacturing Engineering 146
- Computer Networks and Communications 125
- Electrical and Electronic Engineering 54
Countries citing papers authored by Kengo Katayama
This map shows the geographic impact of Kengo Katayama'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 Kengo Katayama with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kengo Katayama more than expected).
Fields of papers citing papers by Kengo Katayama
This network shows the impact of papers produced by Kengo Katayama. 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 Kengo Katayama. The network helps show where Kengo Katayama may publish in the future.
Co-authorship network of co-authors of Kengo Katayama
This figure shows the co-authorship network connecting the top 25 collaborators of Kengo Katayama. A scholar is included among the top collaborators of Kengo Katayama 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 Kengo Katayama. Kengo Katayama is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | 0 | |
| 5 | An improved noisy gradient descent bit-flipping decoding algorithm for LDPC codes | 1 |
| 6 | 7 | |
| 7 | 11 | |
| 8 | 3 | |
| 9 | 4 | |
| 10 | 53 | |
| 11 | 58 | |
| 12 | 7 | |
| 13 | 8 | |
| 14 | A Variant k-opt Local Search Heuristic for Binary Quadratic Programming | 5 |
| 15 | Solving large binary quadratic programming problems by effective genetic local search algorithm | 26 |
| 16 | 58 | |
| 17 | 32 | |
| 18 | 18 | |
| 19 | Performance Analysis of a New Genetic Crossover for the Traveling Salesman Problem(Special Section on Discrete Mathematics and Its Applications) | 10 |
| 20 | A Study on Parallel Hybrid Genetic Algorithms for the Traveling Salesman Problem | 1 |
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.