Hugues Déprés



  1. Twin-width can be exponential in treewidth . With É.Bonnet.


  1. Deciding twin-width at most 4 is NP-complete. With P.Bergé and É.Bonnet, accepted to ICALP 2022
  2. Improved Lower Bounds for the Cyclic Bandwidth Problem. With G.Fertin and É.Monfroy, ICCS 2021


  1. Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments. With J.Bang-Jensen and A.Yeo, Discrete Mathematics 2020.

Other contributions

  1. Suite de permutations lors d'une course de n coureurs de vitesses constantes. HAL 2017