( en | de | ru )

 

Disambiguation of "Déprés, Hugues"

Author of the publication

copydeleteadd this publication to your clipboard
Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments.

, , and . Discret. Math., 343 (12): 112129 (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hugues Lantuit

Olivier Hugues

Hugues Mirault

Hugues Salamin

Theodor Hugues

 

Other publications of authors with the same name

Deciding Twin-Width at Most 4 Is NP-Complete., , and . ICALP, volume 229 of LIPIcs, page 18:1-18:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Sparse graphs with bounded induced cycle packing number have logarithmic treewidth., , , , , , , and . CoRR, (2022)Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width., , , and . CoRR, (2022)Deciding twin-width at most 4 is NP-complete., , and . CoRR, (2021)Twin-width can be exponential in treewidth., and . J. Comb. Theory B, (July 2023)Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width., , , and . STACS, volume 254 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Improved Lower Bounds for the Cyclic Bandwidth Problem., , and . ICCS (1), volume 12742 of Lecture Notes in Computer Science, page 555-569. Springer, (2021)Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments., , and . Discret. Math., 343 (12): 112129 (2020)Sparse graphs with bounded induced cycle packing number have logarithmic treewidth., , , , , , , and . SODA, page 3006-3028. SIAM, (2023)Twin-width can be exponential in treewidth., and . CoRR, (2022)