Hugues Déprés

12 papers A* 2A 1Journal 7Unranked 1

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. J. Comb. Theory B Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
2024	—	`—`	Twin-width: lower bounds and approximation algorithms. (Twin-width: bornes inférieures et algorithmes d'approximation). Hugues Déprés
2023	A	`conf`	Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. STACS Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant
2023	A*	`conf`	Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. SODA Marthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
2023	J	`jnl`	Twin-width can be exponential in treewidth. J. Comb. Theory B Édouard Bonnet, Hugues Déprés
2022	J	`jnl`	Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. CoRR Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant
2022	A*	`conf`	Deciding Twin-Width at Most 4 Is NP-Complete. ICALP Pierre Bergé, Édouard Bonnet, Hugues Déprés
2022	J	`jnl`	Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. CoRR Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
2022	J	`jnl`	Twin-width can be exponential in treewidth. CoRR Édouard Bonnet, Hugues Déprés
2021	J	`jnl`	Deciding twin-width at most 4 is NP-complete. CoRR Pierre Bergé, Édouard Bonnet, Hugues Déprés
2021	—	`conf`	Improved Lower Bounds for the Cyclic Bandwidth Problem. ICCS (1) Hugues Déprés, Guillaume Fertin, Éric Monfroy
2020	J	`jnl`	Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments. Discret. Math. Jørgen Bang-Jensen, Hugues Déprés, Anders Yeo