Networks maximising the consensus time of voter models. - Yuni Iwamasa; Naoki Masuda (CoRR, 2014)

Threshold Influence Model for Allocating Advertising Budgets. - Atsushi Miyauchi 001; Yuni Iwamasa; Takuro Fukunaga; Naonori Kakimura (ICML, 2015)

On a General Framework for Network Representability in Discrete Optimization - (Extended Abstract). - Yuni Iwamasa (ISCO, 2016)

On k-Submodular Relaxation. - Hiroshi Hirai 001; Yuni Iwamasa (SIAM J. Discret. Math., 2016)

Reconstructing Phylogenetic Tree From Multipartite Quartet System. - Hiroshi Hirai 001; Yuni Iwamasa (ISAAC, 2018)

Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. - Hiroshi Hirai 001; Yuni Iwamasa; Kazuo Murota; Stanislav Zivný (STACS, 2018)

The quadratic M-convexity testing problem. - Yuni Iwamasa (Discret. Appl. Math., 2018)

Discrete convexity in joint winner property. - Yuni Iwamasa; Kazuo Murota; Stanislav Zivný (Discret. Optim., 2018)

On a general framework for network representability in discrete optimization. - Yuni Iwamasa (J. Comb. Optim., 2018)

A Tractable Class of Binary VCSPs via M-Convex Intersection. - Hiroshi Hirai 001; Yuni Iwamasa; Kazuo Murota; Stanislav Zivný (ACM Trans. Algorithms, 2019)

Reconfiguring Directed Trees in a Digraph. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa (COCOON, 2021)

A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2 , times , 2$ Submatrices. - Yuni Iwamasa (IPCO, 2021)

A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with 2×2 submatrices. - Yuni Iwamasa (CoRR, 2021)

Quantaloidal approach to constraint satisfaction. - Soichiro Fujii; Yuni Iwamasa; Kei Kimura (ACT, 2021)

Algorithms for Coloring Reconfiguration Under Recolorability Digraphs. - Soichiro Fujii; Yuni Iwamasa; Kei Kimura; Akira Suzuki 001 (ISAAC, 2022)

Independent Set Reconfiguration on Directed Graphs. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Masahiro Takahashi; Kunihiro Wasa (MFCS, 2022)

Reconstructing Phylogenetic Trees from Multipartite Quartet Systems. - Hiroshi Hirai 001; Yuni Iwamasa (Algorithmica, 2022)

A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 ˟ 2 submatrices. - Hiroshi Hirai 001; Yuni Iwamasa (Math. Program., 2022)

Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications. - Yuni Iwamasa; Kenjiro Takazawa (Math. Program., 2022)

Reconfiguration of Colorings in Triangulations of the Sphere. - Takehiro Ito; Yuni Iwamasa; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (SoCG, 2023)

Reconfiguration of Time-Respecting Arborescences. - Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi; Yusuke Kobayashi 001; Shun-ichi Maezawa; Akira Suzuki 001 (WADS, 2023)

Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices. - Hiroshi Hirai 001; Yuni Iwamasa; Taihei Oki; Tasuku Soma (CoRR, 2023)

Reconfiguring (non-spanning) arborescences. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa (Theor. Comput. Sci., 2023)

Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2023)

Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. - Yuni Iwamasa; Yusuke Kobayashi 001; Kenjiro Takazawa (ESA, 2024)

Basis Sequence Reconfiguration in the Union of Matroids. - Tesshu Hanaka; Yuni Iwamasa; Yasuaki Kobayashi; Yuto Okada; Rin Saito (ISAAC, 2024)

On the sizes of BDDs and ZDDs representing matroids. - Hiromi Emoto; Yuni Iwamasa; Shin-ichi Minato (CoRR, 2024)

Computing diverse pair of solutions for tractable SAT. - Tatsuya Gima; Yuni Iwamasa; Yasuaki Kobayashi; Kazuhiro Kurita; Yota Otachi; Rin Saito (CoRR, 2024)

A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2 ˟ 2 submatrices. - Yuni Iwamasa (Math. Program., 2024)

Characterizations of the set of integer points in an integral bisubmodular polyhedron. - Yuni Iwamasa (Discret. Math., 2024)

Algorithmic Aspects of Semistability of Quiver Representations. - Yuni Iwamasa; Taihei Oki; Tasuku Soma (ICALP, 2025)

Rerouting Planar Curves and Disjoint Paths. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2025)

Reforming an Envy-Free Matching. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Algorithmica, 2025)

A general framework for finding diverse solutions via network flow and its applications. - Yuni Iwamasa; Tomoki Matsuda; Shunya Morihira; Hanna Sumita (CoRR, 2025)