Naonori Kakimura
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications top 10%
- Discrete Mathematics and Combinatorics top 10%
- Artificial Intelligence
- Management Science and Operations Research
- Co-authors
- Ken‐ichi KawarabayashiChien‐Chung HuangYusuke KobayashiDániel MarxTasuku SomaAtsushi MiyauchiYuichi YoshidaKazuhisa Makino
- Topics
- Advanced Graph Theory Research (26 papers)Complexity and Algorithms in Graphs (23 papers)Optimization and Search Problems (19 papers)
In The Last Decade
Naonori Kakimura
51 papers receiving 245 citations
Peers
Comparison fields: 5 of 40
- Computational Theory and Mathematics 171
- Computer Networks and Communications 78
- Discrete Mathematics and Combinatorics 52
- Artificial Intelligence 48
- Management Science and Operations Research 35
Countries citing papers authored by Naonori Kakimura
This map shows the geographic impact of Naonori Kakimura'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 Naonori Kakimura with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Naonori Kakimura more than expected).
Fields of papers citing papers by Naonori Kakimura
This network shows the impact of papers produced by Naonori Kakimura. 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 Naonori Kakimura. The network helps show where Naonori Kakimura may publish in the future.
Co-authorship network of co-authors of Naonori Kakimura
This figure shows the co-authorship network connecting the top 25 collaborators of Naonori Kakimura. A scholar is included among the top collaborators of Naonori Kakimura 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 Naonori Kakimura. Naonori Kakimura 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 | 0 | |
| 3 | 0 | |
| 4 | 8 | |
| 5 | 0 | |
| 6 | 1 | |
| 7 | ナップサック制約下の単調サブモジュラ関数を最大化するためのストリーミングアルゴリズム【JST・京大機械翻訳】 | 1 |
| 8 | Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation | 1 |
| 9 | 3 | |
| 10 | 1 | |
| 11 | Threshold Influence Model for Allocating Advertising Budgets | 7 |
| 12 | 2 | |
| 13 | 1 | |
| 14 | Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm | 37 |
| 15 | 10 | |
| 16 | 9 | |
| 17 | 6 | |
| 18 | 30 | |
| 19 | 17 | |
| 20 | 5 |
About Naonori Kakimura
Naonori Kakimura is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Networks and Communications, having authored 61 papers that have together received 262 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (26 papers), Complexity and Algorithms in Graphs (23 papers) and Optimization and Search Problems (19 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (52 citations), Computational Theory and Mathematics (171 citations) and Computer Graphics and Computer-Aided Design (14 citations). Naonori Kakimura has collaborated with scholars based in Japan, Canada and France. Frequent co-authors include Ken‐ichi Kawarabayashi, Chien‐Chung Huang, Yusuke Kobayashi, Dániel Marx, Tasuku Soma, Atsushi Miyauchi, Yuichi Yoshida, Kazuhisa Makino, Naoyuki Kamiyama and Takehiro Ito. Their work appears in journals such as Mathematical Programming, Annals of Operations Research and Theoretical Computer Science.
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.