Refereed Papers

  1. Characterizations of the set of integer points in an integral bisubmodular polyhedron
    Yuni Iwamasa
    Discrete Mathematics, 347(4):113855, 2024.
    [Journal] [arXiv]
  2. Rerouting planar curves and disjoint paths
    Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), LIPIcs 261, pp.81:1–81:19, 2023.
    [arXiv]
  3. 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]
  4. Reconfiguration of colorings in triangulations of the sphere
    Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    Proceedings of the 39th International Symposium on Computational Geometry (SoCG 2023), LIPIcs 258, pp.43:1–43:16, 2023.
    [arXiv]
  5. 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]
  6. 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]
  7. Reforming an envy-free matching
    Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), pp.5084–5091.
    [arXiv]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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}$"
  16. Discrete convexity in joint winner property
    Yuni Iwamasa, Kazuo Murota, and Stanislav Živný
    Discrete Optimization, 28:78–88, 2018.
    [Journal] [arXiv]
  17. The quadratic M-convexity testing problem
    Yuni Iwamasa
    Discrete Applied Mathematics, 238:106–114, 2018.
    [Journal] [arXiv]
  18. 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]
  19. On $k$-submodular relaxation
    Hiroshi Hirai and Yuni Iwamasa
    SIAM Journal on Discrete Mathematics, 30(3):1726–1736, 2016.
    [Journal] [arXiv]
  20. 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]
  21. Networks maximizing the consensus time of voter models
    Yuni Iwamasa and Naoki Masuda
    Physical Review E, 90, 012816, 2014.
    [Journal] [arXiv]

Submitted Papers

  1. On the sizes of BDDs and ZDDs representing matroids
    Hiromi Emoto, Yuni Iwamasa, Shin-ichi Minato
    [arXiv]
  2. Finding a maximum restricted $t$-matching via Boolean edge-CSP
    Yuni Iwamasa, Yusuke Kobayashi, and Kenjiro Takazawa
    [arXiv]
  3. Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
    Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, and Tasuku Soma
    [arXiv]

International Talks

  1. 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.
  2. 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.
  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
    The 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2023), Budapest, Hungary, March 2023.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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.
  9. 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.
  10. 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.
  11. 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.
    Poster session
  12. 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.
  13. 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.
  14. 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.