8 citations · 17 across the 4 of their papers we have counts for
5 papers
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…
Locally checkable problems parameterized by clique-width
Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries +1
We continue the study initiated by Bonomo-Braberman and Gonzalez in 2020 on -locally checkable problems. We propose a dynamic programming algorithm that takes as input a graph w…
Thinness of product graphs
Flavia Bonomo-Braberman, Carolina L. Gonzalez, Fabiano S. Oliveira +2
The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be sol…
A new approach on locally checkable problems
Flavia Bonomo-Braberman, Carolina Lucía Gonzalez
By providing a new framework, we extend previous results on locally checkable problems in bounded treewidth graphs. As a consequence, we show how to solve, in polynomial time for b…
Characterising circular-arc contact -VPG graphs
Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez
A contact -VPG graph is a graph for which there exists a collection of nontrivial pairwise interiorly disjoint horizontal and vertical segments in one-to-one correspondence wi…