Yuni Iwamasa

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 44

Top Topics

Discrete Optimization

Top Venues

Publications

Yuni 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. Math. Program. 204 (1) (2024)
Hiromi Emoto, Yuni Iwamasa, Shin-ichi Minato
On the sizes of BDDs and ZDDs representing matroids. CoRR (2024)
Yuni Iwamasa
Characterizations of the set of integer points in an integral bisubmodular polyhedron. Discret. Math. 347 (4) (2024)
Yuni Iwamasa, Taihei Oki, Tasuku Soma
Algorithmic aspects of semistability of quiver representations. CoRR (2024)
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reconfiguration of Colorings in Triangulations of the Sphere. SoCG (2023)
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
Reconfiguration of Time-Respecting Arborescences. CoRR (2023)
Yuni Iwamasa
Characterizations of the set of integer points in an integral bisubmodular polyhedron. CoRR (2023)
Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa
Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. CoRR (2023)
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
Reconfiguration of Time-Respecting Arborescences. WADS (2023)
Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices. CoRR (2023)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Rerouting Planar Curves and Disjoint Paths. ICALP (2023)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms 19 (1) (2023)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. 943 (2023)
Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Akira Suzuki
Algorithms for Coloring Reconfiguration Under Recolorability Digraphs. ISAAC (2022)
Hiroshi Hirai, Yuni Iwamasa
A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 ˟ 2 submatrices. Math. Program. 195 (1) (2022)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
Independent set reconfiguration on directed graphs. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
Independent Set Reconfiguration on Directed Graphs. MFCS (2022)
Hiroshi Hirai, Yuni Iwamasa
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems. Algorithmica 84 (7) (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Rerouting Planar Curves and Disjoint Paths. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reconfiguration of colorings in triangulations of the sphere. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reforming an Envy-Free Matching. CoRR (2022)
Yuni Iwamasa, Kenjiro Takazawa
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications. Math. Program. 194 (1) (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reforming an Envy-Free Matching. AAAI (2022)
Yuni Iwamasa
A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2\, \times \, 2$ Submatrices. IPCO (2021)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
Reconfiguring Directed Trees in a Digraph. CoRR (2021)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR (2021)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
Reconfiguring Directed Trees in a Digraph. COCOON (2021)
Yuni Iwamasa
A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with 2×2 submatrices. CoRR (2021)
Soichiro Fujii, Yuni Iwamasa, Kei Kimura
Quantaloidal approach to constraint satisfaction. CoRR (2021)
Yuni Iwamasa, Kenjiro Takazawa
Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications. CoRR (2020)
Yuni Iwamasa, Kenjiro Takazawa
Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications. TAMC (2020)
Hiroshi Hirai, Yuni Iwamasa
A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 ˟ 2 Submatrices. IPCO (2020)
Hiroshi Hirai, Yuni Iwamasa
A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2×2 submatrices. CoRR (2020)
Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
A Tractable Class of Binary VCSPs via M-Convex Intersection. ACM Trans. Algorithms 15 (3) (2019)
Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. STACS (2018)
Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
Discrete convexity in joint winner property. Discret. Optim. 28 (2018)
Yuni Iwamasa
On a general framework for network representability in discrete optimization. J. Comb. Optim. 36 (3) (2018)
Yuni Iwamasa
The quadratic M-convexity testing problem. Discret. Appl. Math. 238 (2018)
Hiroshi Hirai, Yuni Iwamasa
Reconstructing Phylogenetic Tree From Multipartite Quartet System. ISAAC (2018)
Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
A tractable class of binary VCSPs via M-convex intersection. CoRR (2018)
Yuni Iwamasa, Kazuo Murota, Stanislav Zivný
Discrete Convexity in Joint Winner Property. CoRR (2017)
Hiroshi Hirai, Yuni Iwamasa
On k-Submodular Relaxation. SIAM J. Discret. Math. 30 (3) (2016)
Yuni Iwamasa
On a General Framework for Network Representability in Discrete Optimization - (Extended Abstract). ISCO (2016)
Hiroshi Hirai, Yuni Iwamasa
On k-Submodular Relaxation. CoRR (2015)
Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura
Threshold Influence Model for Allocating Advertising Budgets. ICML (2015)
Yuni Iwamasa, Naoki Masuda
Networks maximising the consensus time of voter models. CoRR (2014)