投稿中論文

詳細

  1. A general framework for finding diverse solutions via network flow and its applications
    Yuni Iwamasa, Tomoki Matsuda, Shunya Morihira, and Hanna Sumita
    [arXiv]
  2. Computing diverse pair of solutions for tractable SAT
    Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi, and Rin Saito
    [arXiv]
  3. Homotopy types of Hom complexes of graph homomorphisms whose codomains are cycles
    Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Yuta Nozaki, and Akira Suzuki
    [arXiv]
  4. On the sizes of BDDs and ZDDs representing matroids
    Hiromi Emoto, Yuni Iwamasa, and Shin-ichi Minato
    [arXiv]

査読付き論文

  1. Algorithmic aspects of semistability of quiver representations
    Yuni Iwamasa, Taihei Oki, and Tasuku Soma
    Proceedings of the 52nd EATCS International Colloquium on Automata, Languages and Programming (ICALP 2025), to appear.
    [arXiv]
  2. Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
    Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, and Tasuku Soma
    Mathematical Programming, Series A, to appear.
    [Journal] [arXiv]
  3. Basis sequence reconfiguration in the union of matroids
    Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, and Rin Saito
    Proceedings of the 35th International Symposium on Algorithms and Computation (ISAAC 2024), LIPIcs 322, pp.38:1–38:16, 2024.
    [arXiv]
  4. Finding a maximum restricted $t$-matching via Boolean edge-CSP
    Yuni Iwamasa, Yusuke Kobayashi, and Kenjiro Takazawa
    Proceedings of the 32nd Annual European Symposium on Algorithms (ESA 2024), LIPIcs 308, pp.75:1–75:15, 2024.
    [arXiv]
  5. Characterizations of the set of integer points in an integral bisubmodular polyhedron
    Yuni Iwamasa
    Discrete Mathematics, 347(4):113855, 2024.
    [Journal] [arXiv]
  6. Rerouting planar curves and disjoint paths
    Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    ACM Transactions on Algorithms, 21(2):20:1–20:37, 2025.
    Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), LIPIcs 261, pp.81:1–81:19, 2023.
    [Journal] [arXiv]
  7. Reconfiguration of time-respecting arborescences
    Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, and Akira Suzuki
    Proceedings of the 18th Algorithms and Data Structures Symposium (WADS 2023), LNCS 14079, pp.521–532, 2023.
    [arXiv]
  8. Reconfiguration of colorings in triangulations of the sphere
    Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    Journal of Computational Geometry, 16(1):253–294, 2025.
    Proceedings of the 39th International Symposium on Computational Geometry (SoCG 2023), LIPIcs 258, pp.43:1–43:16, 2023.
    [Journal] [arXiv]
  9. Algorithms for coloring reconfiguration under recolorability digraphs
    Soichiro Fujii, Yuni Iwamasa, Kei Kimura, and Akira Suzuki
    Proceedings of the 33rd International Symposium on Algorithms and Computation (ISAAC 2022), LIPIcs 248, pp.4:1–4:19, 2022.
    [Proceeding]
  10. Independent set reconfiguration on directed graphs
    Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, and Kunihiro Wasa
    Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), LIPIcs 241, pp.58:1–58:15, 2022.
    [arXiv]
  11. Reforming an envy-free matching
    Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    Algorithmica, 87:594–620, 2025.
    Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), pp.5084–5091.
    [Journal] [arXiv]
  12. Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams
    Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    ACM Transactions on Algorithms, 19(1):6:1–6:22, 2023
    Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), pp.1342–1355.
    [Journal] [arXiv]
  13. Reconfiguring (non-spanning) arborescences
    Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, and Kunihiro Wasa
    Theoretical Computer Science, 943:131–141, 2023.
    Proceedings of the 27th International Computing and Combinatorics Conference (COCOON 2021), LNCS 13025, pp.343–354, 2021.
    Reconfiguring directed trees in a digraph
    [Journal] [arXiv]
  14. Quantaloidal approach to constraint satisfaction
    Soichiro Fujii, Yuni Iwamasa, and Kei Kimura
    Proceedings of the 4th International Conference on Applied Category Theory (ACT 2021), EPTCS 372, pp.289–305, 2022.
    [Proceeding]
  15. 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
    Yuni Iwamasa
    Mathematical Programming, Series A, 204:27–79, 2024.
    Proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO 2021), LNCS 12707, pp.119–133, 2021.
    A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \times 2$ submatrices
    [Journal] [arXiv]
  16. Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
    Yuni Iwamasa and Kenjiro Takazawa
    Mathematical Programming, Series A, 194:229–256, 2022.
    Proceedings of the 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020), LNCS 12337, pp.156–167, 2020.
    [Journal] [arXiv]
  17. A combinatorial algorithm for computing the rank of a generic partitioned matrix with $2 \times 2$ submatrices
    Hiroshi Hirai and Yuni Iwamasa
    Mathematical Programming, Series A, 195:1–37, 2022.
    Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020), LNCS 12125, pp.196–208, 2020.
    [Journal] [arXiv]
  18. Reconstructing phylogenetic trees from multipartite quartet systems
    Hiroshi Hirai and Yuni Iwamasa
    Algorithmica, 84:1875–1896, 2022.
    Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018), LIPIcs 123, pp.57:1–57:13, 2018.
    Reconstructing phylogenetic tree from multipartite quartet system
    [Journal] [arXiv]
  19. A tractable class of binary VCSPs via M-convex intersection
    Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, and Stanislav Živný
    ACM Transactions on Algorithms, 15(3):44:1–44:41, 2019.
    Proceedings of the 35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018), LIPIcs 96, pp.39:1–39:14, 2018.
    Beyond JWP: A tractable class of binary VCSPs via M-convex intersection
    [Journal] [arXiv]
    []
    p.32, Eq. (4.5): "$[n]\overline{Y}$" ⟹ "$\overline{Y}$"
    p.33, l.6: "$X \mapsto [n]\overline{X}$ or $Y \mapsto [n]\overline{Y}$" ⟹ "$X \mapsto \overline{X}$ or $Y \mapsto \overline{Y}$"
    p.33, l.-16: "$\{ [n]\overline{X}, \overline{Y} \}$" ⟹ "$\{ \overline{X}, Y \}$"
    p.33, l.-16: "$X \mapsto [n]\overline{X}$ and/or $Y \mapsto [n]\overline{Y}$" ⟹ "$X \mapsto \overline{X}$ and/or $Y \mapsto \overline{Y}$"
  20. Discrete convexity in joint winner property
    Yuni Iwamasa, Kazuo Murota, and Stanislav Živný
    Discrete Optimization, 28:78–88, 2018.
    [Journal] [arXiv]
  21. The quadratic M-convexity testing problem
    Yuni Iwamasa
    Discrete Applied Mathematics, 238:106–114, 2018.
    [Journal] [arXiv]
  22. On a general framework for network representability in discrete optimization
    Yuni Iwamasa
    Journal of Combinatorial Optimization, 36(3):678–708, 2018.
    Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO 2016), LNCS 9849, pp.369–380, 2016.
    [Journal] [arXiv]
  23. On $k$-submodular relaxation
    Hiroshi Hirai and Yuni Iwamasa
    SIAM Journal on Discrete Mathematics, 30(3):1726–1736, 2016.
    [Journal] [arXiv]
  24. Threshold influence model for allocating advertising budgets
    Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, and Naonori Kakimura
    Proceedings of the 32nd International Conference on Machine Learning (ICML 2015), pp.1395–1404, 2015.
    [Proceeding]
  25. Networks maximizing the consensus time of voter models
    Yuni Iwamasa and Naoki Masuda
    Physical Review E, 90, 012816, 2014.
    [Journal] [arXiv]

日本語記事

  1. 彩色遷移問題から制約充足遷移問題へ
    岩政 勇仁
    オペレーションズ・リサーチ, Vol.68, No.7, pp.341–348, 2023.
  2. 2部マッチング理論の代数的一般化について
    岩政 勇仁
    オペレーションズ・リサーチ, Vol.66, No.6, pp.342–348, 2021.
  3. 2部マッチング理論の代数的一般化について
    岩政 勇仁
    第32回RAMP数理最適化シンポジウム論文集, pp.1–14, 2020.
  4. 離散最適化問題に対するネットワーク表現と$k$-劣モジュラ緩和
    岩政 勇仁
    オペレーションズ・リサーチ, Vol.61, No.11, pp.792–793, 2016.

国際学会発表

  1. Yuni Iwamasa, Yusuke Kobayashi, and Kenjiro Takazawa
    Finding a maximum restricted $t$-matching via Boolean edge-CSP
    The 32nd Annual European Symposium on Algorithms (ESA 2024), Egham, United Kingdom, September 2024.
  2. Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    Reconfiguration of colorings in triangulations of the sphere
    The 39th International Symposium on Computational Geometry (SoCG 2023), Dallas, USA, June 2023.
  3. 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
    SIAM Conference on Optimization (OP23), Seattle, USA, June 2023.
  4. 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
    The 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2023), Budapest, Hungary, March 2023.
  5. Soichiro Fujii, Yuni Iwamasa, Kei Kimura, and Akira Suzuki
    Algorithms for coloring reconfiguration under recolorability digraphs
    The 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Seoul, Korea, December 2022.
  6. Yuni Iwamasa
    A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \times 2$ submatrices
    The 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO 2021), Online, May 2021.
  7. Yuni Iwamasa and Kenjiro Takazawa
    Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications
    The 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020), Online, October 2020.
  8. Hiroshi Hirai and Yuni Iwamasa
    A combinatorial algorithm for computing the rank of a generic partitioned matrix with $2 \times 2$ submatrices
    The 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020), Online, June 2020.
  9. Hiroshi Hirai and Yuni Iwamasa
    Reconstructing phylogenetic tree from multipartite quartet system
    The 29th International Symposium on Algorithms and Computation (ISAAC 2018), Yilan, Taiwan, December 2018.
  10. Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, and Stanislav Živný
    Discrete convexity in binary VCSPs
    The 23rd International Symposium on Mathematical Programming (ISMP 2018), Bordeaux, France, July 2018.
  11. Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, and Stanislav Živný
    Beyond JWP: A tractable class of binary VCSPs via M-convex intersection
    The 35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018), Caen, France, February–March 2018.
  12. Yuni Iwamasa, Kazuo Murota, and Stanislav Živný
    Discrete convexity in joint winner property
    The 19th Conference on Integer Programming and Combinatorial Optimization (IPCO 2017), Waterloo, Canada, June 2017.
    ポスターセッション
  13. Yuni Iwamasa
    The quadratic M-convexity testing problem
    The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2017), Budapest, Hungary, May 2017.
  14. Yuni Iwamasa
    On a general framework for network representability in discrete optimization
    The 4th International Symposium on Combinatorial Optimization (ISCO 2016), Salerno, Italy, May 2016.
  15. Hiroshi Hirai and Yuni Iwamasa
    On $k$-submodular relaxation
    The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2015), Fukuoka, Japan, June 2015.

国内学会発表

  1. 岩政 勇仁
    離散凸解析の拡張に向けて
    大阪組合せ論セミナー，大阪公立大学梅田サテライト，大阪，2024年6月．
    招待講演
  2. 岩政 勇仁，小林 佑輔，高澤 兼二郎
    制限付き$t$-マッチング問題に対する制約充足的アプローチ
    第195回アルゴリズム研究発表会，那覇市IT創造館，沖縄，2023年11月．
  3. 岩政 勇仁
    整数双劣モジュラ多面体の整数点集合の特徴づけ
    日本応用数理学会 第19回研究部会連合発表会，岡山理科大学岡山キャンパス，岡山，2023年3月．
  4. 伊藤 健洋，岩政 勇仁，小林 佑輔，前澤 俊一，野崎 雄太，岡本 吉央，小関 健太
    球面の三角形分割の彩色遷移
    2022年度応用数学合同研究集会，龍谷大学瀬田キャンパス，京都，2022年12月．
  5. 伊藤 健洋，岩政 勇仁，小林 佑輔，前澤 俊一，野崎 雄太，岡本 吉央，小関 健太
    球面の三角形分割の彩色遷移
    日本オペレーションズ・リサーチ学会 2022年秋季研究発表会，朱鷺メッセ 新潟コンベンションセンター，新潟，2022年9月．
  6. 岩政 勇仁
    2部マッチング問題の代数的拡張
    日本オペレーションズ・リサーチ学会 研究部会「最適化手法とアルゴリズム」，オンライン，2021年10月．
    招待講演
  7. 岩政 勇仁
    $2 \times 2$型分割多項式行列の行列式次数を求める組合せ的多項式時間アルゴリズム
    日本応用数理学会 2021年度年会，オンライン，2021年9月．
    若手優秀講演賞受賞
  8. 岩政 勇仁
    2部マッチング理論の代数的一般化について
    第32回RAMP数理最適化シンポジウム (RAMP 2020)，オンライン，2020年10月．
    招待講演
  9. 岩政 勇仁，高澤 兼二郎
    交叉制約下でのマトロイドの最適基とその一般化
    京都大学数理解析研究所 共同研究（グループ型） 数理最適化の理論・アルゴリズム・応用，オンライン，2020年8月．
  10. 平井 広志，岩政 勇仁
    $2 \times 2$型分割行列のランクを求める組合せ的多項式時間アルゴリズム
    日本応用数理学会 第16回研究部会連合発表会，中央大学後楽園キャンパス，東京，2020年3月．
  11. 平井 広志，岩政 勇仁
    $2 \times 2$型分割行列のランクを求める組合せ的多項式時間アルゴリズム
    日本オペレーションズ・リサーチ学会 研究部会「超スマート社会のシステムデザインのための理論と応用」，京都大学数理解析研究所，京都，2019年11月．
    招待講演
  12. 平井 広志，岩政 勇仁
    完全多部四点木システムからの系統樹構築
    日本応用数理学会 2018年度年会，名古屋大学東山キャンパス，愛知，2018年9月．
  13. 平井 広志，岩政 勇仁
    完全多部四点木システムからの系統樹復元
    日本オペレーションズ・リサーチ学会 研究部会「最適化とその応用—未来を担う若手研究者の集い2018—」，筑波大学，茨城，2018年6月．
    優秀発表賞受賞
  14. Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, and Stanislav Živný
    A tractable class of binary VCSPs via M-convex intersection
    電子情報通信学会2018年（平成30年）総合大会 COMP-ELC学生シンポジウム，東京電機大学，東京，2018年3月．
  15. 平井 広志，岩政 勇仁，室田 一雄，Stanislav Živný
    値付き制約充足問題と離散凸性：2次値付き制約充足問題のM凸交叉による多項式時間可解なクラス
    日本オペレーションズ･リサーチ学会 研究部会「離散アルゴリズムの応用と理論」，京都大学数理解析研究所，京都，2018年2月．
  16. Yuni Iwamasa, Kazuo Murota, and Stanislav Živný
    Discrete convexity in joint winner property
    日本応用数理学会 2017年度年会，武蔵野大学有明キャンパス，東京，2017年9月．
  17. 岩政 勇仁，室田 一雄，Stanislav Živný
    Discrete convexity in valued constraint satisfaction problems: M-convexity and joint winner property
    Japanese Conference on Combinatorics and its Applications (JCCA 2017)・離散数学とその応用研究集会2017，熊本大学，熊本，2017年8月．
  18. 岩政 勇仁
    2次関数のM凸性判定問題
    日本オペレーションズ・リサーチ学会 2017年春季研究発表会（創立60周年記念大会），沖縄県市町村自治会館，沖縄，2017年3月．
  19. 岩政 勇仁，室田 一雄
    M${}^\natural$-convex completion problem
    日本オペレーションズ・リサーチ学会 研究部会「最適化の基盤とフロンティア—未来を担う若手研究者の集い2016—」，筑波大学，茨城，2016年5月．
  20. 岩政 勇仁
    関数のネットワーク表現とその拡張について
    日本オペレーションズ・リサーチ学会 2016年春季研究発表会，慶應義塾大学，東京，2016年3月．
    学生優秀発表賞受賞
  21. 平井 広志，岩政 勇仁
    On $k$-submodular relaxation
    日本オペレーションズ・リサーチ学会 研究部会「最適化の基盤とフロンティア—未来を担う若手研究者の集い2015—」，筑波大学，茨城，2015年5月．
    最優秀発表賞受賞
  22. 岩政 勇仁，増田 直紀
    投票者モデルにおける平均合意時間が最大のグラフ
    日本オペレーションズ・リサーチ学会 研究部会「最適化の理論と応用—未来を担う若手研究者の集い2014—」，筑波大学，茨城，2014年5月．
    優秀発表賞受賞