12 citations · 37 across the 22 of their papers we have counts for
4 papers · 1 filter
Finding a Maximum Restricted -Matching via Boolean Edge-CSP
Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa
The problem of finding a maximum -matching without short cycles has received significant attention due to its relevance to the Hamilton cycle problem. This problem is generalize…
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
Hiroshi Hirai, Yuni Iwamasa, Taihei Oki +1
We address the computation of the degrees of minors of a noncommutative symbolic matrix of form \[ A[c] := \sum_{k=1}^m A_k t^{c_k} x_k, \] where are matrices over a field $\…
Reconfiguration of Time-Respecting Arborescences
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama +4
An arborescence, which is a directed analogue of a spanning tree in an undirected graph, is one of the most fundamental combinatorial objects in a digraph. In this paper, we study…
Characterizations of the set of integer points in an integral bisubmodular polyhedron
Yuni Iwamasa
In this note, we provide two characterizations of the set of integer points in an integral bisubmodular polyhedron. Our characterizations do not require the assumption that a given…