Rchr
J-GLOBAL ID:201101075193410550   Update date: Mar. 21, 2024

Kakimura Naonori

Kakimura Naonori
Affiliation and department:
Homepage URL  (2): https://opt.math.keio.ac.jp/kakimura/index-j.htmlhttps://opt.math.keio.ac.jp/kakimura/
Research field  (1): 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
Show all
Papers (105):
  • Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi. Bandit Task Assignment with Unknown Processing Time. NeurIPS. 2023
  • Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto. Algorithmic Theory of Qubit Routing. WADS. 2023. 533-546
  • Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto. Algorithmic Theory of Qubit Routing. CoRR. 2023. abs/2305.02059
  • Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto. Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. CoRR. 2023. abs/2304.14782
  • Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto. Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. ICALP. 2023. 82-17
more...
MISC (50):
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page