An arborescence, which is a directed analogue of a spanning tree in an
u...
In this note, we provide two characterizations of the set of integer poi...
In 1973, Fisk proved that any 4-coloring of a 3-colorable triangulation
...
In this paper, we consider a transformation of k disjoint paths in a gra...
We consider the problem of reforming an envy-free matching when each age...
Directed Token Sliding asks, given a directed graph and two sets of
pair...
We initiate the study of k-edge-connected orientations of undirected gra...
In this paper, we investigate the computational complexity of subgraph
r...
The constraint satisfaction problem (CSP) is a computational problem tha...
In this paper, we consider the problem of computing the degree of the
de...
In this paper, we consider the problem of computing the rank of a
block-...
For two matroids M_1 and M_2 with the same ground set V and two cost
fun...
A binary VCSP is a general framework for the minimization problem of a
f...