
Computing the Largest Bond and the Maximum Connected Cut of a Graph
The cutset ∂(S) of a graph G=(V,E) is the set of edges that have one en...
read it

Reducing graph transversals via edge contractions
For a graph parameter π, the Contraction(π) problem consists in, given a...
read it

Hitting forbidden induced subgraphs on bounded treewidth graphs
For a fixed graph H, the HISDeletion problem asks, given a graph G, fo...
read it

Lineartime Algorithms for Eliminating Claws in Graphs
Since many NPcomplete graph problems have been shown polynomialtime so...
read it

Width Parameterizations for Knotfree Vertex Deletion on Digraphs
A knot in a directed graph G is a strongly connected subgraph Q of G wit...
read it

Computing the largest bond of a graph
A bond of a graph G is an inclusionwise minimal disconnecting set of G,...
read it

The Complexity of HellyB_1 EPG Graph Recognition
Golumbic, Lipshteyn and Stern defined in 2009 the class of EPG graphs, a...
read it

FPT algorithms to recognize well covered graphs
Given a graph G, let vc(G) and vc^+(G) be the sizes of a minimum and a m...
read it

Maximum cuts in edgecolored graphs
The input of the Maximum Colored Cut problem consists of a graph G=(V,E)...
read it

Eliminating Odd Cycles by Removing a Matching
We study the problem of determining whether a given graph G=(V, E) admit...
read it
Uéverton S. Souza
is this you? claim profile