3 papers
cs.DS2026
Kernelization dichotomies for hitting minors under structural parameterizations
Marin Bougeret, Eric Brandwein, Ignasi Sau
For a finite collection of connected graphs , the -MINOR-DELETION problem consists in, given a graph and an integer , deciding whether conta…
cs.DS2025
Computing parameters that generalize interval graphs using restricted modular partitions
Flavia Bonomo-Braberman, Eric Brandwein, Ignasi Sau
Recently, Lafond and Luo [MFCS 2023] defined the -modular cardinality of a graph as the minimum size of a partition of into modules that belong to a graph c…
cs.DS2025
On the thinness of trees
Flavia Bonomo-Braberman, Eric Brandwein, Carolina LucÃa González +1
The study of structural graph width parameters like tree-width, clique-width and rank-width has been ongoing during the last five decades, and their algorithmic use has also been i…