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 show that determining if an n-vertex graph has twin-width at most 4 i...
On sparse graphs, Roditty and Williams [2013] proved that no
O(n^2-ε)-ti...
Median graphs form the class of graphs which is the most studied in metr...
The parameterized complexity of counting minimum cuts stands as a natura...