3 papers
math.CO2025
Homotopy types of Hom complexes of graph homomorphisms whose codomains are cycles
Soichiro Fujii, Yuni Iwamasa, Kei Kimura +2
For simple graphs and , the Hom complex is a polyhedral complex whose vertices are the graph homomorphisms and whose edges connect the pairs of…
math.OC2025
Algorithmic aspects of semistability of quiver representations
Yuni Iwamasa, Taihei Oki, Tasuku Soma
We study the semistability of quiver representations from an algorithmic perspective. We present efficient algorithms for several fundamental computational problems on the semistab…
cs.DS2025
A general framework for finding diverse solutions via network flow and its applications
Yuni Iwamasa, Tomoki Matsuda, Shunya Morihira +1
In this paper, we present a general framework for efficiently computing diverse solutions to combinatorial optimization problems. Given a problem instance, the goal is to find …