research
∙
01/30/2023
The Leafed Induced Subtree in chordal and bounded treewidth graphs
In the Fully Leafed Induced Subtrees, one is given a graph G and two int...
share
research
∙
07/09/2019
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
For a fixed connected graph H, the {H}-M-DELETION problem asks, given a ...
research
∙
12/20/2018
