Rchr
J-GLOBAL ID:201101075193410550
Update date: Apr. 11, 2025 Kakimura Naonori
Kakimura Naonori
Affiliation and department: Homepage URL (2): https://opt.math.keio.ac.jp/kakimura/index-j.html
,
https://opt.math.keio.ac.jp/kakimura/ Research field (2):
Information theory
, Mathematical informatics
Research keywords (2):
Graph algorithms
, Mathematical optimization
Research theme for competitive and other funds (11): - 2022 - 2027 Graph Algorithms and Optimization: Theory and Scalable Algorithms
- 2021 - 2026 Theory and algorithms for combinatorial optimization under uncertainty
- 2020 - 2023 Development of Combinatorial Reconfiguration by Mathematics Approach: From Examples to New Methods
- 2018 - 2023 Large Graphs: Theory and Algorithms
- 2020 - 2022 Re-annotation of large-scale human genome data by integration of statistical genetics and operations research
- 2017 - 2021 組合せ最適化理論を用いたネットワーク解析手法の設計
- 2013 - 2017 Designing Efficient Algorithms for Optimization Problems with Combinatorial Structures
- 2012 - 2017 Exploring the limits of computation from mathematical logic
- 2009 - 2015 Unified Optimization Theory by Discrete Convex Paradigm
- 2009 - 2011 Structural Analysis of Mathematical Programming based on CombinatorialMatrix Theory
- 2007 - 2008 組合せ的行列理論に基づく最適化手法の設計
Show all
Papers (117): -
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto. Algorithmic Theory of Qubit Routing in the Linear Nearest Neighbor Architectures. ACM Transactions on Quantum Computing. 2025
-
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki. Reforming an Envy-Free Matching. Algorithmica. 2025
-
Naonori Kakimura, Riku Nitta. Randomized counter-based algorithms for frequency estimation over data streams in O(loglogN) space. Theor. Comput. Sci. 2024. 984. 114317-114317
-
Naonori Kakimura, Rio Katsu. On Approximating the Weighted Region Problem in Square Tessellations. CoRR. 2024. abs/2407.18758
-
Naonori Kakimura, Ildikó Schlotter. Parameterized Complexity of Submodular Minimization under Uncertainty. CoRR. 2024. abs/2404.07516
more... MISC (50): -
垣村 尚徳. 離散数学入門 : グラフ,マトロイドから離散凸解析まで (特集 離散数学に親しむ). 数理科学. 2021. 59. 12. 22-29
-
Combinatorial Optimization for Network Analysis. 2019. 32. 55-60
- 垣村 尚徳. 情報科学と線形代数 : ネットワーク解析と行列固有値 (特集 線形代数の探究 : 様々な問題を通してみるその姿). 数理科学. 2016. 54. 8. 45-51
- 伊藤健洋, 垣村尚徳, 神山直之, 小林佑輔, 岡本吉央. ネットワーク型交渉ゲームの安定化アルゴリズム. 情報処理学会研究報告(Web). 2016. 2016. AL-157. VOL.2016-AL-157,NO.3 (WEB ONLY)
- 垣村尚徳, 河原林健一, 河原林健一. イマージョンを含まないグラフに対する彩色アルゴリズム. 日本応用数理学会年会講演予稿集(CD-ROM). 2016. 2016. ROMBUNNO.9GATSU13NICHI,11:00,3E,3
more... Books (1): - 組合せ最適化への招待 : モデルとアルゴリズム
サイエンス社 2024 ISBN:9784781916095
Education (2): - 2003 - 2008 University of Tokyo Graduate School of Information Science and Technology Department of Mathematical Informatics
- 1999 - 2003 University of Tokyo Faculty of Engineering Department of Mathematical Engineering and Information Physics
Work history (6): Return to Previous Page