Updated on 2026/05/20
PhD in Science （ 2014.3 Keio University ）
Master of Information Science and Technology （ 2011.3 The University of Tokyo ）
Bachelor of Engineering （ 2008.3 The University of Tokyo ）
Discrete Mathematics
Theoretical Computer Science
Optimization Theory
graph theory
algorithm
Informatics / Mathematical informatics
Informatics / Information theory
Natural Science / Applied mathematics and statistics
Nagoya University Graduate School of Mathematics Associate Professor
2023.3
Tohoku University Graduate School of Information Sciences specially appointed assistant professor
2022.9 - 2023.2
Tokyo University of Science Faculty of Science and Technology Assistant Professor
2018.4 - 2022.8
日本数学会
THE JAPAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
The Mathematical Society of Japan delegate
2024.3 - 2025.2
Committee type：Academic society
The 37th international conference on Formal Power Series and Algebraic Combinatorics Local Organizer
2023.7 - 2025.7
Best Student Paper Award
2012.12 23rd International Symposium on Algorithm and Computation (ISAAC 2012)
Nanao Kita
Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
Nanano Kita
2025.10
Odd cuts in bipartite grafts II: Structure and universality of decapital distance components
Nanao Kita
arXiv preprint Vol. arXiv:2503.23973 2025.3
Basilica: New canonical decomposition in matching theory. Reviewed Open Access
Nanao Kita
J. Graph Theory Vol. 108 ( 3 ) page： 508 - 542 2025.3
Graft analogue of general Kotzig-Lovasz decomposition Reviewed
Nanao Kita
Discrete Applied Mathematics Vol. 32 ( 2 ) page： 355 - 364 2022.12
Nanao Kita
arXiv 2022.6
Tight cuts in bipartite grafts I: Capital distance components
Nanao Kita
arXiv 2022.2
Constructive Characterization and Faster Recognition Algorithm for Grafts with a Connected Minimum Join" International conference
Nanao Kita
The 47th Australasian Combinatorics Conference 2025.12.1
Dulmage--Mendelsohn Decomposition for the Minimum Odd Join Problem in Bipartite Grafts International conference
Nanao Kita
56th Southeastern International Conference on Combinatorics, Graph Theory & Computing (SEICCGTC) 2025.3.5
グラフ理論的基礎定理の深化と一般化によるイジング・スピングラス模型の新展開
Grant number：26K06893 2026.4 - 2030.3
科学研究費助成事業 基盤研究(C)
喜多 奈々緒
Authorship：Principal investigator
Grant amount：\4680000 （ Direct Cost: \3600000 、 Indirect Cost：\1080000 ）
Innovating the foundation of Ising spin glass theory by an approach from discrete mathematics
Grant number：23K03192 2023.4 - 2027.3
Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (C)
Authorship：Principal investigator
Grant amount：\4680000 （ Direct Cost: \3600000 、 Indirect Cost：\1080000 ）
イジング模型の基底状態問題に対する離散数理を用いた新たな展開
2021.1 - 2022.12
栢森情報科学振興財団 研究助成
Authorship：Principal investigator
Toward a radical extension of matroidal optimization theory
Grant number：18K13451 2018.4 - 2024.3
Japan Society for the Promotion of Science Grants-in-Aid for Scientific Research Grant-in-Aid for Early-Career Scientists Grant-in-Aid for Early-Career Scientists
Kita Nanao
Authorship：Principal investigator Grant type：Competitive
Grant amount：\4160000 （ Direct Cost: \3200000 、 Indirect Cost：\960000 ）
This research project aims to develop a new framework that captures the essence of polynomial-time solvability. Focusing on major discrete optimization problems that are solvable in polynomial time, the study has revealed graph-theoretic structures, such as canonical decompositions and duality, that are deeply connected to computational complexity. We have particularly focused on the optimal parity factor problem (also known as the minimum T-join problem). We have established a canonical decomposition theory for this problem on bipartite graphs, from which a lattice-theoretic characterization of dual optimal solutions has been derived. This result can be regarded as a generalization of the Dulmage-Mendelsohn canonical decomposition known in matching theory. Furthermore, motivated by connections with degree-constrained matchings, the study also investigated bidirected graphs and derived a constructive characterization of bidirected critical graphs.
