13 citations · 15 across the 5 of their papers we have counts for
6 papers
Maximum cuts in edge-colored graphs
Luerbio Faria, Sulamita Klein, Ignasi Sau +2
The input of the Maximum Colored Cut problem consists of a graph with an edge-coloring and a positive integer , and the question is wheth…
On the (parameterized) complexity of recognizing well-covered (r,l)-graphs
Sancrey R. Alves, Konrad K. Dabrowski, Luerbio Faria +3
An -partition of a graph is a partition of its vertex set into independent sets and cliques. A graph is if it admits an -partition.…
Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs
Luerbio Faria, Sulamita Klein, Ignasi Sau +1
A graph is signed if each edge is assigned or . A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign if and only if its…
Parameterized complexity dichotomy for -Vertex Deletion
Julien Baste, Luerbio Faria, Sulamita Klein +1
For two integers , a graph is an -graph if can be partitioned into independent sets and cliques. In the parameterized $(r,\ell…
On Complexities of Minus Domination
Luérbio Faria, Wing-Kai Hon, Ton Kloks +3
A function f: V \rightarrow \{-1,0,1\} is a minus-domination function of a graph G=(V,E) if the values over the vertices in each closed neighborhood sum to a positive number. The w…
Odd cycle transversals and independent sets in fullerene graphs
Luerbio Faria, Sulamita Klein, Matěj Stehlík
A fullerene graph is a cubic bridgeless plane graph with all faces of size 5 and 6. We show that that every fullerene graph on n vertices can be made bipartite by deleting at most…