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 (115)：
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
Naonori Kakimura, Ildikó Schlotter. Parameterized Complexity of Submodular Minimization Under Uncertainty. SWAT. 2024. 30-17
Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi. New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. AAAI. 2024. 12708-12716
