Yuni Iwamasa

Most-cited papers

Threshold Influence Model for Allocating Advertising Budgets
Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura
2015International Conference on Machine Learning17 citations
Semantic Scholar
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, N. Kamiyama +5 more
2021ACM-SIAM Symposium on Discrete Algorithms8 citations Open access
Semantic Scholar
Reconfiguring (non-spanning) arborescences
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata +2 more
2021Theoretical Computer Science8 citations Open access
Semantic Scholar
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Networks Maximising the Consensus Time of Voter Models
Yuni Iwamasa, N. Masuda
20148 citations
Semantic Scholar
Independent set reconfiguration on directed graphs
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata +3 more
2022International Symposium on Mathematical Foundations of Computer Science7 citations Open access
Semantic Scholar
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
Yuni Iwamasa, Kenjiro Takazawa
2020Mathematical programming7 citations Open access
Semantic Scholar
On k-Submodular Relaxation
H. Hirai, Yuni Iwamasa
2015SIAM Journal on Discrete Mathematics7 citations Open access
Semantic Scholar
Reforming an Envy-Free Matching
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, N. Kamiyama +4 more
2022Algorithmica6 citations Open access
Semantic Scholar
Rerouting Planar Curves and Disjoint Paths
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi +4 more
2022International Colloquium on Automata, Languages and Programming6 citations Open access
Semantic Scholar
A general framework for finding diverse solutions via network flow and its applications
Yuni Iwamasa, T. Matsuda, Shunya Morihira, Hanna Sumita
2025International Symposium on Algorithms and Computation5 citations
Semantic Scholar
Algorithmic aspects of semistability of quiver representations
Yuni Iwamasa, Taihei Oki, Tasuku Soma
2024International Colloquium on Automata, Languages and Programming5 citations
Semantic Scholar
Reconfiguration of Time-Respecting Arborescences
Takehiro Ito, Yuni Iwamasa, N. Kamiyama, Yasuaki Kobayashi +3 more
2023Algorithmica5 citations
Semantic Scholar
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
H. Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma
2023Mathematical programming5 citations Open access
Semantic Scholar
A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2×2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt}
H. Hirai, Yuni Iwamasa
2020Mathematical programming5 citations Open access
Semantic Scholar
Homotopy types of Hom complexes of graph homomorphisms whose codomains are cycles
Soichiro Fujii, Yuni Iwamasa, Keiichi Kimura, Yuta Nozaki +1 more
2024Journal of Applied and Computational Topology4 citations Open access
Semantic Scholar
The quadratic M-convexity testing problem
Yuni Iwamasa
2017Discrete Applied Mathematics4 citations Open access
Semantic Scholar
Reconfiguring Directed Trees in a Digraph
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata +2 more
2021International Computing and Combinatorics Conference3 citations
Semantic Scholar
A Tractable Class of Binary VCSPs via M-Convex Intersection
H. Hirai, Yuni Iwamasa, K. Murota, Stanislav Živný
2018ACM Trans. Algorithms3 citations Open access
Semantic Scholar
Basis sequence reconfiguration in the union of matroids
Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada +1 more
2024International Symposium on Algorithms and Computation2 citations
Semantic Scholar
Computing diverse pair of solutions for tractable SAT
Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi, Kazuhiro Kurita +2 more
2024arXiv.org2 citations
Semantic Scholar
A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with 2×2 submatrices
Yuni Iwamasa
2021Conference on Integer Programming and Combinatorial Optimization2 citations
Semantic Scholar
On a general framework for network representability in discrete optimization
Yuni Iwamasa
2016Journal of combinatorial optimization2 citations Open access
Semantic Scholar
On the sizes of BDDs and ZDDs representing matroids
Hiromi Emoto, Yuni Iwamasa, S. Minato
2025Theoretical Computer Science1 citations Open access
Semantic Scholar
Finding a Maximum Restricted t-Matching via Boolean Edge-CSP
Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa
2023Embedded Systems and Applications1 citations
Semantic Scholar
Reconfiguration of colorings in triangulations of the sphere
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa +3 more
2022International Symposium on Computational Geometry1 citations Open access
Semantic Scholar
Quantaloidal approach to constraint satisfaction
Soichiro Fujii, Yuni Iwamasa, Kei Kimura
2021ACT1 citations Open access
Semantic Scholar
A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2×2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs}
Yuni Iwamasa
2021Mathematical programming1 citations Open access
Semantic Scholar
Reconstructing Phylogenetic Tree From Multipartite Quartet System
H. Hirai, Yuni Iwamasa
2019International Symposium on Algorithms and Computation1 citations
Semantic Scholar
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems
H. Hirai, Yuni Iwamasa
2019Algorithmica1 citations Open access
Semantic Scholar
Discrete Convexity in Joint Winner Property
Yuni Iwamasa, K. Murota, Stanislav Živný
2017Discrete Optimization1 citations Open access
Semantic Scholar
Towards discrete convex analysis over classical root systems
Yuni Iwamasa
20260 citations
Semantic Scholar
Finding a Maximum Restricted \({t}\)-Matching via Boolean Edge-CSP
Yuni Iwamasa, Y. Kobayashi, Kenji Takazawa
2026SIAM Journal on Discrete Mathematics0 citations Open access
Semantic Scholar
A Matroid Generalization of Weighted Popular Matching: Characterization and Algorithm
Yuni Iwamasa, Yusuke Kobayashi, Ryoga Mahara, Kenjiro Takazawa
20260 citations
Semantic Scholar
On the sizes of BDDs and ZDDs representing matroids
Hiromi Emoto, Yuni Iwamasa, S. Minato
2024arXiv.org0 citations
Semantic Scholar
Characterizations of the set of integer points in an integral bisubmodular polyhedron
Yuni Iwamasa
2023Discrete Mathematics0 citations Open access
Semantic Scholar
Algorithms for Coloring Reconfiguration Under Recolorability Digraphs
Soichiro Fujii, Yuni Iwamasa, Keiichi Kimura, Akira Suzuki
2022International Symposium on Algorithms and Computation0 citations
Semantic Scholar