Hugues Déprés

According to our database, Hugues Déprés authored at least 6 papers between 2020 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Twin-width can be exponential in treewidth.

Édouard Bonnet, Hugues Déprés

J. Comb. Theory, Ser. B, July, 2023

Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width.

Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.

Marthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Deciding Twin-Width at Most 4 Is NP-Complete.

Pierre Bergé, Édouard Bonnet, Hugues Déprés

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Improved Lower Bounds for the Cyclic Bandwidth Problem.

Hugues Déprés, Guillaume Fertin, Éric Monfroy

Proceedings of the Computational Science - ICCS 2021, 2021

2020

Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments.

Jørgen Bang-Jensen, Hugues Déprés, Anders Yeo

Discret. Math., 2020