3 citations · 3 across the 11 of their papers we have counts for
5 papers · 1 filter
Computing diverse pair of solutions for tractable SAT
Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi +3
In many decision-making processes, one may prefer multiple solutions to a single solution, which allows us to choose an appropriate solution from the set of promising solutions tha…
Basis sequence reconfiguration in the union of matroids
Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi +2
Given a graph and two spanning trees and in , Spanning Tree Reconfiguration asks whether there is a step-by-step transformation from to such that all inter…
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…
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…
On the sizes of BDDs and ZDDs representing matroids
Hiromi Emoto, Yuni Iwamasa, Shin-ichi Minato
Matroids are often represented as oracles since there are no unified and compact representations for general matroids. This paper initiates the study of binary decision diagrams (B…