12 citations · 37 across the 22 of their papers we have counts for
4 papers · 1 filter
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura +6
We initiate the study of -edge-connected orientations of undirected graphs through edge flips for . We prove that in every orientation of an undirected -edge-conne…
Reconfiguring (non-spanning) arborescences
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi +3
In this paper, we investigate the computational complexity of subgraph reconfiguration problems in directed graphs. More specifically, we focus on the problem of reconfiguring arbo…
Quantaloidal Approach to Constraint Satisfaction
Soichiro Fujii, Yuni Iwamasa, Kei Kimura
The constraint satisfaction problem (CSP) is a computational problem that includes a range of important problems in computer science. We point out that fundamental concepts of the…
A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with submatrices
Yuni Iwamasa
In this paper, we consider the problem of computing the entire sequence of the maximum degree of minors of a block-structured symbolic matrix (a generic partitioned polynomial matr…