Enumeration problems are often encountered as key subroutines in the exa...
The Grundy number of a graph is the maximum number of colours used by th...
A dominating set in a directed graph is a set of vertices S such that al...
Motivated by the problem of enumerating all tree decompositions of a gra...
In this paper, we are interested in algorithms that take in input an
arb...