6 citations · 13 across the 8 of their papers we have counts for
5 papers · 1 filter
Exact and Parameterized Algorithms for the Independent Cutset Problem
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
The Independent Cutset problem asks whether there is a set of vertices in a given graph that is both independent and a cutset. Such a problem is -complete even when th…
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…
Hitting forbidden induced subgraphs on bounded treewidth graphs
Ignasi Sau, Uéverton S. Souza
For a fixed graph , the -IS-Deletion problem asks, given a graph , for the minimum size of a set such that does not contain as an ind…
FPT algorithms to recognize well covered graphs
Rafael Araujo, Eurinardo Costa, Sulamita Klein +2
Given a graph , let and be the sizes of a minimum and a maximum minimal vertex covers of , respectively. We say that is well covered if …
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.…