research
∙
08/10/2023
Comparing Width Parameters on Graph Classes
We study how the relationship between non-equivalent width parameters ch...
share
research
∙
07/11/2023
Computing Subset Vertex Covers in H-Free Graphs
We consider a natural generalization of Vertex Cover: the Subset Vertex ...
research
∙
08/20/2020
Solving problems on generalized convex graphs via mim-width
A bipartite graph G=(A,B,E) is H-convex, for some family of graphs H, if...
research
∙
08/03/2020
List k-Colouring P_t-Free Graphs with No Induced 1-Subdivision of K_1,s: a Mim-width Perspective
A colouring of a graph G=(V,E) is a mapping c V→{1,2,…} such that c(u)≠ ...
research
∙
07/28/2020
Computing Weighted Subset Transversals in H-Free Graphs
For the Odd Cycle Transversal problem, the task is to find a small set S...
research
∙
07/28/2020
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth
The Cut Count technique and the rank-based approach have lead to sin...
research
∙
05/28/2020
Computing Subset Transversals in H-Free Graphs
We study the computational complexity of two well-known graph transversa...
research
∙
04/16/2020
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective
We consider the classical problems (Edge) Steiner Tree and Vertex Steine...
research
∙
04/10/2020
Colouring (sP_1+P_5)-Free Graphs: a Mim-Width Perspective
We prove that the class of (K_t,sP_1+P_5)-free graphs has bounded mim-wi...
research
∙
04/10/2020