
Reconfiguring Directed Trees in a Digraph
In this paper, we investigate the computational complexity of subgraph r...
read it

Quantaloidal approach to constraint satisfaction
The constraint satisfaction problem (CSP) is a computational problem tha...
read it

A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with 2 × 2 submatrices
In this paper, we consider the problem of computing the degree of the de...
read it

A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 × 2 submatrices
In this paper, we consider the problem of computing the rank of a block...
read it

Optimal matroid bases with intersection constraints: Valuated matroids, Mconvex functions, and their applications
For two matroids M_1 and M_2 with the same ground set V and two cost fun...
read it

A tractable class of binary VCSPs via Mconvex intersection
A binary VCSP is a general framework for the minimization problem of a f...
read it
Yuni Iwamasa
is this you? claim profile