Yuni Iwamasa

According to our database, Yuni Iwamasa authored at least 33 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Characterizations of the set of integer points in an integral bisubmodular polyhedron.

Yuni Iwamasa

Discret. Math., April, 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., March, 2024

Computing diverse pair of solutions for tractable SAT.

Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi, Rin Saito

CoRR, 2024

Algorithmic aspects of semistability of quiver representations.

Yuni Iwamasa, Taihei Oki, Tasuku Soma

CoRR, 2024

On the sizes of BDDs and ZDDs representing matroids.

Hiromi Emoto, Yuni Iwamasa, Shin-ichi Minato

CoRR, 2024

Basis Sequence Reconfiguration in the Union of Matroids.

Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Finding a Maximum Restricted t-Matching via Boolean Edge-CSP.

Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

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, Kenta Ozeki

ACM Trans. Algorithms, January, 2023

Reconfiguring (non-spanning) arborescences.

Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa

Theor. Comput. Sci., 2023

Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices.

Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma

CoRR, 2023

Reconfiguration of Time-Respecting Arborescences.

Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Rerouting Planar Curves and Disjoint Paths.

Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Reconfiguration of Colorings in Triangulations of the Sphere.

Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications.

Yuni Iwamasa, Kenjiro Takazawa

Math. Program., 2022

A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 ˟ 2 submatrices.

Hiroshi Hirai, Yuni Iwamasa

Math. Program., 2022

Reconstructing Phylogenetic Trees from Multipartite Quartet Systems.

Hiroshi Hirai, Yuni Iwamasa

Algorithmica, 2022

Independent Set Reconfiguration on Directed Graphs.

Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Algorithms for Coloring Reconfiguration Under Recolorability Digraphs.

Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Akira Suzuki

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Reforming an Envy-Free Matching.

Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Quantaloidal approach to constraint satisfaction.

Soichiro Fujii, Yuni Iwamasa, Kei Kimura

Proceedings of the Fourth International Conference on Applied Category Theory, 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

A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2\, \times \, 2$ Submatrices.

Yuni Iwamasa

Proceedings of the Integer Programming and Combinatorial Optimization, 2021

Reconfiguring Directed Trees in a Digraph.

Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2019

A Tractable Class of Binary VCSPs via M-Convex Intersection.

Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný

ACM Trans. Algorithms, 2019

2018

On a general framework for network representability in discrete optimization.

Yuni Iwamasa

J. Comb. Optim., 2018

Discrete convexity in joint winner property.

Yuni Iwamasa, Kazuo Murota, Stanislav Zivný

Discret. Optim., 2018

The quadratic M-convexity testing problem.

Yuni Iwamasa

Discret. Appl. Math., 2018

Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection.

Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Reconstructing Phylogenetic Tree From Multipartite Quartet System.

Hiroshi Hirai, Yuni Iwamasa

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2016

On k-Submodular Relaxation.

Hiroshi Hirai, Yuni Iwamasa

SIAM J. Discret. Math., 2016

On a General Framework for Network Representability in Discrete Optimization - (Extended Abstract).

Yuni Iwamasa

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015

Threshold Influence Model for Allocating Advertising Budgets.

Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura

Proceedings of the 32nd International Conference on Machine Learning, 2015

2014

Networks maximising the consensus time of voter models.

Yuni Iwamasa, Naoki Masuda

CoRR, 2014