Ignasi Sau

activity

20082025

most citedAn FPT 2-Approximation for Tree-Cut Decomposition

23 citations · 60 across the 50 of their papers we have counts for

collaborators

Showing 2024Show all

4 papers · 1 filter

cs.DS2024

Vertex identification to a forest

Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos

Let $H$ be a graph class and $k \in N$ . We say a graph $G$ admits a \emph{ $k$ -identification to $H$ } if there is a partition $P$ of some set $X…

cs.DS2024

Constant congestion linkages in polynomially strong digraphs in polynomial time

Raul Lopes, Ignasi Sau

Given integers $k, c > 0$ , we say that a digraph $D$ is $(k, c)$ -linked if for every pair of ordered sets ${s_{1}, \dots, s_{k}}$ and ${t_{1}, \dots, t_{k}}$ of vertices of $D$ , there…

cs.LO2024

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes

Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos

Given a graph $G$ and a vertex set $X$ , the annotated treewidth tw $(G, X)$ of $X$ in $G$ is the maximum treewidth of an $X$ -rooted minor of $G$ , i.e., a minor $H$ where the model of…

cs.DS2024

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations

Marin Bougeret, Bart M. P. Jansen, Ignasi Sau

For a fixed graph $H$ , the $H$ -SUBGRAPH HITTING problem consists in deleting the minimum number of vertices from an input graph to obtain a graph without any occurrence of $H$ as a…