1 citations · 2 across the 3 of their papers we have counts for
4 papers
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…
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…
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…
Thinness and its variations on some graph families and coloring graphs of bounded thinness
Flavia Bonomo-Braberman, Eric Brandwein, Fabiano S. Oliveira +3
Interval graphs and proper interval graphs are well known graph classes, for which several generalizations have been proposed in the literature. In this work, we study the (proper)…