L. Faria

activity

20122018

most citedOdd cycle transversals and independent sets in fullerene graphs

13 citations · 15 across the 5 of their papers we have counts for

collaborators

Showing cs.DSShow all

4 papers · 1 filter

cs.DS2018

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 $G = (V, E)$ with an edge-coloring $c : E \to {1, 2, 3, \dots, p}$ and a positive integer $k$ , and the question is wheth…

cs.DS2017

On the (parameterized) complexity of recognizing well-covered (r,l)-graphs

Sancrey R. Alves, Konrad K. Dabrowski, Luerbio Faria +3

An $(r, ℓ)$ -partition of a graph $G$ is a partition of its vertex set into $r$ independent sets and $ℓ$ cliques. A graph is $(r, ℓ)$ if it admits an $(r, ℓ)$ -partition.…

cs.DS2015

Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs

Luerbio Faria, Sulamita Klein, Ignasi Sau +1

A graph $G$ 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…

cs.DS2015★ 2 cited

Parameterized complexity dichotomy for $(r, ℓ)$ -Vertex Deletion

Julien Baste, Luerbio Faria, Sulamita Klein +1

For two integers $r, ℓ \geq 0$ , a graph $G = (V, E)$ is an $(r, ℓ)$ -graph if $V$ can be partitioned into $r$ independent sets and $ℓ$ cliques. In the parameterized $(r,\ell…

Maximum cuts in edge-colored graphs

On the (parameterized) complexity of recognizing well-covered (r,l)-graphs

Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs

Parameterized complexity dichotomy for (r,ℓ)-Vertex Deletion

Parameterized complexity dichotomy for $(r, ℓ)$ -Vertex Deletion