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 2015 · cs.DSShow all

2 papers · 2 filters

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…

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