Enumeration problems are often encountered as key subroutines in the exa...
Finding a maximum cardinality common independent set in two matroids (al...
Large-scale quantum information processing requires the use of quantum e...
Directed Token Sliding asks, given a directed graph and two sets of
pair...
K-best enumeration, which asks to output k best solutions without
duplic...
We investigate the complexity of finding a transformation from a given
s...
We study the problem of checking the existence of a step-by-step
transfo...
In this paper, we investigate the computational complexity of subgraph
r...
Enumerating matchings is a classical problem in the field of enumeration...
In this paper, we consider enumeration problems for edge-distinct and
ve...
Let G = (V, E) be a undirected graph and let W ⊆ V be a set of
terminals...
A property Π on a finite set U is monotone if for every X
⊆ U satisfying...
Let G be a graph and T_1,T_2 be two spanning trees of G. We say that
T_1...
In this study, we address the independent set enumeration problem. Altho...
In this paper, we address the independent set enumeration problem. Altho...
We study the perfect matching reconfiguration problem: Given two perfect...
In this paper, we propose a characterization of chordal bipartite graphs...
The girth of a graph is the length of its shortest cycle. Due to its
rel...
Subgraph enumeration problems ask to output all subgraphs of an input gr...
Dominating sets are fundamental graph structures. However, enumeration o...