Yuni IWAMASA

Yuni IWAMASA

Department of Mathematics,
Graduate School of Science, Kobe University
Division : Applied Mathematics
Associate Professor		 Building B, Room 423

Personal Website
Research Field : Combinatorial optimization and related mathematical structures
Research Summary : I am studying the theory of combinatorial optimization and related mathematical structures. In particular, motivated by connections to computational complexity theory originating from the theory of NP-completeness, I approach these topics from the perspective of polynomial-time solvability. Specifically, my research focuses on questions such as: "Which combinatorial optimization problems can be solved in polynomial time?" and "What kinds of mathematical structures lead to the polynomial-time solvability?"
Primary Publications :
  1. Y. Iwamasa, T. Oki, and T. Soma. Algorithmic aspects of semistability of quiver representations. In Proceedings of the 52nd EATCS International Colloquium on Automata, Languages and Programming (ICALP 2025), LIPIcs 334, pp.99:1-99:18, 2025.
  2. T. Ito, Y. Iwamasa, Y. Kobayashi, S. Maezawa, Y. Nozaki, Y. Okamoto, and K. Ozeki. Reconfiguration of colorings in triangulations of the sphere. Journal of Computational Geometry, 16(1):253-294, 2025.
  3. Y. Iwamasa, Y. Kobayashi, and K. Takazawa. Finding a maximum restricted t-matching via Boolean edge-CSP. In Proceedings of the 32nd Annual European Symposium on Algorithms (ESA 2024), LIPIcs 308, pp.75:1-75:15, 2024.
  4. Y. Iwamasa. Characterizations of the set of integer points in an integral bisubmodular polyhedron. Discrete Mathematics, 347(4):113855, 2024.
  5. Y. Iwamasa. A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2×2 submatrices. Mathematical Programming, Series A, 204:27-79, 2024.
  6. H. Hirai and Y. Iwamasa. A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2×2 submatrices. Mathematical Programming, Series A, 195:1-37, 2022.
  7. H. Hirai, Y. Iwamasa, K. Murota, and S. Živný. A tractable class of binary VCSPs via M-convex intersection. ACM Transactions on Algorithms, 15(3):44:1- 44:41, 2019.
  8. H. Hirai and Y. Iwamasa. On k-submodular relaxation. SIAM Journal on Discrete Mathematics, 30(3):1726-1736, 2016.