research
∙
08/29/2023
On the hardness of inclusion-wise minimal separators enumeration
Enumeration problems are often encountered as key subroutines in the exa...
share
research
∙
01/10/2023
Contact graphs of boxes with unidirectional contacts
This paper is devoted to the study of particular classes of geometricall...
research
∙
04/10/2022
On dually-CPT and strong-CPT posets
A poset is a containment of paths in a tree (CPT) if it admits a represe...
research
∙
10/26/2021
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
The Grundy number of a graph is the maximum number of colours used by th...
research
∙
07/13/2021
Polynomial delay algorithm for minimal chordal completions
Motivated by the problem of enumerating all tree decompositions of a gra...
research
∙
07/02/2020
