37 citations · 115 across the 24 of their papers we have counts for
4 papers · 1 filter
FPT and kernelization algorithms for the k-in-a-tree problem
Guilherme C. M. Gomes, Vinicius F. dos Santos, Murilo V. G. da Silva +1
The three-in-a-tree problem asks for an induced tree of the input graph containing three mandatory vertices. In 2006, Chudnovsky and Seymour [Combinatorica, 2010] presented the fir…
Precedence thinness in graphs
Flavia Bonomo-Braberman, Fabiano S. Oliveira, Moysés S. Sampaio +1
Interval and proper interval graphs are very well-known graph classes, for which there is a wide literature. As a consequence, some generalizations of interval graphs have been pro…
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…
Linear-time Algorithms for Eliminating Claws in Graphs
Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano S. Oliveira +2
Since many NP-complete graph problems have been shown polynomial-time solvable when restricted to claw-free graphs, we study the problem of determining the distance of a given grap…