For any ε > 0, we give a polynomial-time
n^ε-approximation algorithm for...
A graph is O_k-free if it does not contain k pairwise vertex-disjoint an...
For any small positive real ε and integer t >
1/ε, we build a graph with...
We show that determining if an n-vertex graph has twin-width at most 4 i...
share