12 citations · 37 across the 22 of their papers we have counts for
4 papers · 1 filter
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…
The quadratic M-convexity testing problem
Yuni Iwamasa
M-convex functions, which are a generalization of valuated matroids, play a central role in discrete convex analysis. Quadratic M-convex functions constitute a basic and important…
On a general framework for network representability in discrete optimization
Yuni Iwamasa
In discrete optimization, representing an objective function as an - cut function of a network is a basic technique to design an efficient minimization algorithm. A network r…
On k-Submodular Relaxation
Hiroshi Hirai, Yuni Iwamasa
-submodular functions, introduced by Huber and Kolmogorov, are functions defined on satisfying certain submodular-type inequalities. -submodular fun…