For any ε > 0, we give a polynomial-time
n^ε-approximation algorithm for...
In the 70s, Berge introduced 1-extendable graphs (also called B-graphs),...
We study the existence of polynomial kernels, for parameterized problems...
We recently introduced the graph invariant twin-width, and showed that
f...
The twin-width of a graph G is the minimum integer d such that G has a
d...
Inspired by a width invariant defined on permutations by Guillemot and M...
We study the approximability of the Maximum Independent Set (MIS) proble...
Maximum Independent Set (MIS for short) is in general graphs the paradig...
Given a hypergraph H, the Minimum Connectivity Inference problem asks fo...
In this paper, we investigate the complexity of Maximum Independent Set ...