Hugues Déprés

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 11

Top Topics

Space Complexity

Top Venues

J. Comb. Theory B

Publications

Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. J. Comb. Theory B 167 (2024)
Édouard Bonnet, Hugues Déprés
Twin-width can be exponential in treewidth. J. Comb. Theory, Ser. B 161 (2023)
Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. STACS (2023)
Marthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. SODA (2023)
Pierre Bergé, Édouard Bonnet, Hugues Déprés
Deciding Twin-Width at Most 4 Is NP-Complete. ICALP (2022)
Édouard Bonnet, Hugues Déprés
Twin-width can be exponential in treewidth. CoRR (2022)
Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. CoRR (2022)
Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. CoRR (2022)
Pierre Bergé, Édouard Bonnet, Hugues Déprés
Deciding twin-width at most 4 is NP-complete. CoRR (2021)
Hugues Déprés, Guillaume Fertin, Éric Monfroy
Improved Lower Bounds for the Cyclic Bandwidth Problem. ICCS (1) (2021)
Jørgen Bang-Jensen, Hugues Déprés, Anders Yeo
Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments. Discret. Math. 343 (12) (2020)