Items where authors include "Bonnet, É"

Article

Bonnet, É orcid.org/0000-0002-1653-5822, Duron, J., Sylvester, J. orcid.org/0000-0002-6543-2934 et al. (2 more authors) (2024) Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SIAM Journal on Computing, 53 (5). pp. 1578-1601. ISSN 0097-5397

Bonnet, É, Chakraborty, D. orcid.org/0000-0003-0534-6417 and Duron, J. (2024) Cutting Barnette graphs perfectly is hard. Theoretical Computer Science, 1010. 114701. ISSN 0304-3975

Proceedings Paper

Ordyniak, S. orcid.org/0000-0003-1935-651X, Bodlaender, H., Bonnet, É et al. (6 more authors) (2023) Treewidth is NP-Complete on Cubic Graphs. In: Dagstuhl Reports. IPEC 2023: International Symposium on Parameterized and Exact Computation, 06-08 Sep 2023, Amsterdam, Netherlands. Leibniz International Proceedings in Informatics (LIPIcs), 285 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Wadern, Merzig-Wadern, Saarland , 7:1-7:13. ISBN 978-3-95977-305-8

Bonnet, É, Chakraborty, D. orcid.org/0000-0003-0534-6417, Kim, E.J. et al. (3 more authors) (2022) Twin-Width VIII: Delineation and Win-Wins. In: Leibniz International Proceedings in Informatics (LIPIcs). 17th International Symposium on Parameterized and Exact Computation, 07-09 Sep 2022, Potsdam, Germany. , Wadern, Germany . ISBN 9783959772600