Naoyuki Kamiyama

587 total citations
71 papers, 224 citations indexed

About

Naoyuki Kamiyama is a scholar working on Computational Theory and Mathematics, Economics and Econometrics and Management Science and Operations Research. According to data from OpenAlex, Naoyuki Kamiyama has authored 71 papers receiving a total of 224 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computational Theory and Mathematics, 24 papers in Economics and Econometrics and 17 papers in Management Science and Operations Research. Recurrent topics in Naoyuki Kamiyama's work include Complexity and Algorithms in Graphs (37 papers), Advanced Graph Theory Research (31 papers) and Game Theory and Voting Systems (24 papers). Naoyuki Kamiyama is often cited by papers focused on Complexity and Algorithms in Graphs (37 papers), Advanced Graph Theory Research (31 papers) and Game Theory and Voting Systems (24 papers). Naoyuki Kamiyama collaborates with scholars based in Japan, Hungary and United States. Naoyuki Kamiyama's co-authors include Naoki Katoh, Atsushi Takizawa, Tamás Fleiner, Yoshio Okamoto, Naonori Kakimura, Takehiro Ito, Satoru Fujishige, Yusuke Kobayashi, Tomomi Matsui and Yusuke Matsumoto and has published in prestigious journals such as Mathematical Programming, Theoretical Computer Science and Mathematics of Operations Research.

In The Last Decade

Naoyuki Kamiyama

56 papers receiving 207 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Naoyuki Kamiyama Japan 8 119 78 51 47 22 71 224
László A. Végh United Kingdom 9 120 1.0× 39 0.5× 39 0.8× 69 1.5× 32 1.5× 39 215
Laurent Gourvès France 9 120 1.0× 51 0.7× 70 1.4× 61 1.3× 35 1.6× 30 223
Lina Mallozzi Italy 9 43 0.4× 122 1.6× 118 2.3× 16 0.3× 15 0.7× 37 238
Anureet Saxena United States 7 113 0.9× 11 0.1× 83 1.6× 15 0.3× 19 0.9× 13 256
Stefan Dobrev Canada 12 65 0.5× 11 0.1× 30 0.6× 324 6.9× 30 1.4× 55 387
Sana Ben Hamida France 7 127 1.1× 26 0.3× 42 0.8× 16 0.3× 162 7.4× 14 282
Olivier Spanjaard France 8 70 0.6× 6 0.1× 74 1.5× 27 0.6× 36 1.6× 17 189
Chenhao Wang China 7 21 0.2× 39 0.5× 48 0.9× 28 0.6× 26 1.2× 27 116
Austin Buchanan United States 10 116 1.0× 32 0.4× 13 0.3× 64 1.4× 30 1.4× 22 245
Fatma Kılınç-Karzan United States 9 59 0.5× 10 0.1× 92 1.8× 8 0.2× 32 1.5× 26 207

Countries citing papers authored by Naoyuki Kamiyama

Since Specialization
Citations

This map shows the geographic impact of Naoyuki Kamiyama'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 Naoyuki Kamiyama with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Naoyuki Kamiyama more than expected).

Fields of papers citing papers by Naoyuki Kamiyama

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Naoyuki Kamiyama. 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 Naoyuki Kamiyama. The network helps show where Naoyuki Kamiyama may publish in the future.

Co-authorship network of co-authors of Naoyuki Kamiyama

This figure shows the co-authorship network connecting the top 25 collaborators of Naoyuki Kamiyama. A scholar is included among the top collaborators of Naoyuki Kamiyama 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 Naoyuki Kamiyama. Naoyuki Kamiyama is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ito, Takehiro, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, & Yoshio Okamoto. (2025). Algorithmic Theory of Qubit Routing in the Linear Nearest Neighbor Architectures. 6(3). 1–17.
2.
Kamiyama, Naoyuki. (2023). On optimization problems in acyclic hypergraphs. Information Processing Letters. 182. 106390–106390. 2 indexed citations
3.
Kamiyama, Naoyuki. (2021). Envy-free matchings with one-sided preferences and matroid constraints. Operations Research Letters. 49(5). 790–794.
4.
Kamiyama, Naoyuki. (2020). On Stable Matchings with Pairwise Preferences and Matroid Constraints. Adaptive Agents and Multi-Agents Systems. 584–592. 3 indexed citations
5.
Ito, Takehiro, Naoyuki Kamiyama, Yusuke Kobayashi, & Yoshio Okamoto. (2019). Algorithms for Gerrymandering over Graphs. Theoretical Computer Science. 868. 1413–1421. 1 indexed citations
6.
Kamiyama, Naoyuki. (2019). Many-to-Many Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints. Adaptive Agents and Multi-Agents Systems. 583–591. 4 indexed citations
7.
Kamiyama, Naoyuki, et al.. (2017). The mixed evacuation problem. Journal of Combinatorial Optimization. 36(4). 1299–1314. 1 indexed citations
8.
Ito, Takehiro, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, & Yoshio Okamoto. (2016). Efficient Stabilization of Cooperative Matching Games. Adaptive Agents and Multi-Agents Systems. 41–49. 3 indexed citations
9.
Katoh, Naoki, et al.. (2016). The mixed evacuation problem. Lecture notes in computer science. 18–52. 2 indexed citations
10.
Ohta, Akio, Naoyuki Kamiyama, Atsushi Takizawa, & Naoki Katoh. (2014). A Heuristic for Quickest Transshipment Problem and its Application to Evacuation Planning. IEICE Technical Report; IEICE Tech. Rep.. 113(488). 29–34. 1 indexed citations
11.
Kamiyama, Naoyuki. (2014). Arborescence Problems in Directed Graphs: Theorems and Algorithms. Interdisciplinary Information Sciences. 20(1). 51–70. 4 indexed citations
12.
Matsumoto, Yusuke, et al.. (2013). On Total Unimodularity of Edge–Edge Adjacency Matrices. Algorithmica. 67(2). 277–292. 3 indexed citations
13.
Frank, András, Satoru Fujishige, Naoyuki Kamiyama, & Naoki Katoh. (2012). Independent arborescences in directed graphs. Discrete Mathematics. 313(4). 453–459. 1 indexed citations
14.
Fleiner, Tamás & Naoyuki Kamiyama. (2012). A matroid approach to stable matchings with lower quotas. Symposium on Discrete Algorithms. 135–142. 5 indexed citations
15.
Kamiyama, Naoyuki. (2012). A note on the quasi-additive bound for Boolean functions. Kyushu University Institutional Repository (QIR) (Kyushu University). 4. 119–122.
16.
Kamiyama, Naoyuki, Naoki Katoh, & Atsushi Takizawa. (2008). An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths (Algorithmic Aspects in Information and Management). Lecture notes in computer science. 4508(5). 178–190. 1 indexed citations
17.
Kamiyama, Naoyuki, Atsushi Takizawa, & Naoki Katoh. (2006). FLOOR LAYOUT ALGORITHMS FOR A TWO-STORY HOUSE BASED ON ENUMERATION ALGORITHM OF FLOOR PLANS. Journal of Environmental Engineering (Transactions of AIJ). 71(601). 65–72.
18.
Kamiyama, Naoyuki, Naoki Katoh, & Atsushi Takizawa. (2006). An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity( Invited Papers from New Horizons in Computing). IEICE Transactions on Information and Systems. 89(8). 2372–2379. 5 indexed citations
19.
Kamiyama, Naoyuki, Naoki Katoh, & Atsushi Takizawa. (2006). An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity (Algorithmic aspects in information and management). Lecture notes in computer science. 4041. 231–242. 1 indexed citations
20.
Kamiyama, Naoyuki, Naoki Katoh, & Atsushi Takizawa. (2006). An Efficient Algorithm for the Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity and its Extension(Theory of Modeling and Optimization). Kyoto University Research Information Repository (Kyoto University). 1526. 232–240. 1 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by László A. Végh Breakdown of academic impact, for papers by Laurent Gourvès Breakdown of academic impact, for papers by Lina Mallozzi Breakdown of academic impact, for papers by Anureet Saxena Breakdown of academic impact, for papers by Stefan Dobrev Breakdown of academic impact, for papers by Sana Ben Hamida Breakdown of academic impact, for papers by Olivier Spanjaard Breakdown of academic impact, for papers by Chenhao Wang Breakdown of academic impact, for papers by Austin Buchanan Breakdown of academic impact, for papers by Fatma Kılınç-Karzan
Rankless by CCL
2026