Enumeration problems are often encountered as key subroutines in the exa...
At STOC 2002, Eiter, Gottlob, and Makino presented a technique called or...
Graphs of bounded degeneracy are known to contain induced paths of order...
The t-onion star is the digraph obtained from a star with 2t leaves by
r...
The Grundy number of a graph is the maximum number of colours used by th...
Soon after his 1964 seminal paper on edge colouring, Vizing asked the
fo...
At IPEC 2020, Bergougnoux, Bonnet, Brettell, and Kwon showed that a numb...
Tree-cut width is a graph parameter introduced by Wollan that is an anal...
Enumerating minimal transversals in a hypergraph is a notoriously hard
p...
We prove a recent conjecture of Beisegel et al. that for every positive
...
It is well known that every closure system can be represented by an
impl...
In this paper, we study the dualization in distributive lattices, a
gene...
It was recently proved that the dualization in lattices given by
implica...
It is a long-standing open problem whether the minimal dominating sets o...
We investigate two different approaches to enumerate minimal dominating ...