12 citations · 17 across the 16 of their papers we have counts for
5 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…
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…
Distance geometry approach for special graph coloring problems
Rosiane de Freitas, Bruno Dias, Nelson Maculan +1
One of the most important combinatorial optimization problems is graph coloring. There are several variations of this problem involving additional constraints either on vertices or…
Parameterized mixed cluster editing via modular decomposition
Maise Dantas da Silva, Fábio Protti, Jayme Luiz Szwarcfiter
In this paper we introduce a natural generalization of the well-known problems Cluster Editing and Bicluster Editing, whose parameterized versions have been intensively investigate…
An time algorithm for minimum weighted dominating induced matching
Min Chih Lin, Michel J. Mizrahi, Jayme L. Szwarcfiter
Say that an edge of a graph dominates itself and every other edge adjacent to it. An edge dominating set of a graph is a subset of edges which domina…