Iwamasa Yuni

イワマサユニ | Iwamasa Yuni

Affiliation and department：
Homepage URL (2)： http://www.lab2.kuis.kyoto-u.ac.jp/iwamasa/ja/ , http://www.lab2.kuis.kyoto-u.ac.jp/iwamasa/

Research field (2)： Information theory , Mathematical informatics

Research keywords (3)： Discrete Structure , Discrete Mathematics , Combinatorial Optimization

Research theme for competitive and other funds (7)：

2024 - 2030 非正曲率空間上の次世代凸最適化
2022 - 2027 離散凸解析における双対理論の深化
2020 - 2023 Development of Combinatorial Reconfiguration by Mathematics Approach: From Examples to New Methods
2019 - 2022 値付き制約充足問題と離散凸解析の融合と深化
2020 - 2022 マッチング問題の代数的拡張に対する組合せ的アプローチ

Show all

Papers (32)：

Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma. Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices. Mathematical Programming. 2024
Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito. Basis sequence reconfiguration in the union of matroids. Proceedings of the 35th International Symposium on Algorithms and Computation (ISAAC 2024). 2024
Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa. Finding a maximum restricted $t$-matching via Boolean edge-CSP. Proceedings of the 32nd Annual European Symposium on Algorithms (ESA 2024). 2024
Yuni Iwamasa. Characterizations of the set of integer points in an integral bisubmodular polyhedron. Discrete Mathematics. 2024. 347. 4. 113855
Yuni Iwamasa. A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with $$2 \times 2$$ submatrices. Mathematical Programming, Series A. 2024. 204. 27-79

ｍore...

Lectures and oral presentations (36)：

Finding a maximum restricted $t$-matching via Boolean edge-CSP
(The 32nd Annual European Symposium on Algorithms (ESA 2024) 2024)
離散凸解析の拡張に向けて
(大阪組合せ論セミナー 2024)
制限付き$t$-マッチング問題に対する制約充足的アプローチ
(第195回アルゴリズム研究発表会 2023)
Reconfiguration of colorings in triangulations of the sphere
(The 39th International Symposium on Computational Geometry (SoCG 2023) 2023)
A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with $2 \times 2$ submatrices
(SIAM Conference on Optimization (OP23) 2023)

ｍore...

Education (2)：

2014 - 2019 The University of Tokyo The Graduate School of Information Science and Technology Department of Mathematical Informatics
2010 - 2014 The University of Tokyo The Faculty of Engineering Department of Mathematical Engineering and Information Physics

Professional career (1)：

Work history (4)：

2020/03 - 現在 Kyoto University Graduate School of Informatics Department of Communications and Computer Engineering
2019/04 - 2020/02 Research Fellow of the Japan Society for the Promotion of Science (PD)
2016/04 - 2019/03 Research Fellow of the Japan Society for the Promotion of Science (DC1)
2014/06 - 2016/02 JST ERATO Kawarabayashi Large Graph Project The Network Graph Theories and Optimization Group Research Assistant

Committee career (3)：

Awards (7)：

Show all

Association Membership(s) (2)：

The Japan Society for Industrial and Applied Mathematics , The Operations Research Society of Japan

※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page