The following pages link to Hugues Déprés (Q2005722):
Displaying 6 items.
- Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments (Q2005723) (← links)
- Twin-width can be exponential in treewidth (Q6038574) (← links)
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6500104) (← links)
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6538647) (← links)
- Deciding twin-width at most 4 is NP-complete (Q6560802) (← links)
- Approximating highly inapproximable problems on graphs of bounded twin-width (Q6615109) (← links)
