| 2026 | ESA | Answering Related Questions. | douard Bonnet |
| 2026 | ESA | Moderately Beyond Clique-Width: Reduced Component Max-Leaf and Related Parameters. | douard Bonnet, Yeonsu Chang, Julien Duron, Colin Geniet, O-joung Kwon |
| 2026 | ICALP | Fast Shortest Path in Graphs with Sparse Signed Tree Models and Applications. | douard Bonnet, Colin Geniet, Eun Jung Kim, Sungmin Moon |
| 2026 | STOC | Separator Theorem for Minor-Free Graphs in Linear Time. | douard Bonnet, Tuukka Korhonen, Hung Le, Jason Li, Toms Masark |
| 2025 | ICALP | Induced Disjoint Paths Without an Induced Minor. | Pierre Aboulker, douard Bonnet, Timoth Picavet, Nicolas Trotignon |
| 2025 | ICALP | Mim-Width Is paraNP-Complete. | Benjamin Bergougnoux, douard Bonnet, Julien Duron |
| 2025 | ICALP | Separability Properties of Monadically Dependent Graph Classes. | douard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mhlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2025 | MFCS | Temporal Valued Constraint Satisfaction Problems. | Manuel Bodirsky, douard Bonnet, Zaneta Semanisinov |
| 2025 | STOC | Treewidth Inapproximability and Tight ETH Lower Bound. | douard Bonnet |
| 2024 | ICALP | Tight Bounds on Adjacency Labels for Monotone Graph Classes. | douard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii |
| 2024 | MFCS | Symmetric-Difference (Degeneracy) and Signed Tree Models. | douard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev |
| 2023 | ESA | Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄. | douard Bonnet, Julien Duron, Colin Geniet, Stphan Thomass, Alexandra Wesolek |
| 2023 | STACS | Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. | Pierre Berg, douard Bonnet, Hugues Dprs, Rmi Watrigant |
| 2023 | STACS | Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication. | douard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stphan Thomass |
| 2023 | WG | Cutting Barnette Graphs Perfectly is Hard. | douard Bonnet, Dibyayan Chakraborty, Julien Duron |
| 2022 | ICALP | Deciding Twin-Width at Most 4 Is NP-Complete. | Pierre Berg, douard Bonnet, Hugues Dprs |
| 2022 | LICS | Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. | douard Bonnet, Jan Dreier, Jakub Gajarsk, Stephan Kreutzer, Nikolas Mhlmann, Pierre Simon, Szymon Torunczyk |
| 2022 | SODA | Twin-width VI: the lens of contraction sequences. | douard Bonnet, Eun Jung Kim, Amadeus Reinald, Stphan Thomass |
| 2022 | STOC | Twin-width IV: ordered graphs and matrices. | douard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stphan Thomass, Szymon Torunczyk |
| 2021 | ICALP | 4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^{4/3}. | douard Bonnet |
| 2021 | ICALP | Twin-width III: Max Independent Set, Min Dominating Set, and Coloring. | douard Bonnet, Colin Geniet, Eun Jung Kim, Stphan Thomass, Rmi Watrigant |
| 2021 | SODA | Twin-width II: small classes. | douard Bonnet, Colin Geniet, Eun Jung Kim, Stphan Thomass, Rmi Watrigant |
| 2021 | STACS | Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio. | douard Bonnet |
| 2020 | ESA | An Algorithmic Weakening of the Erdős-Hajnal Conjecture. | douard Bonnet, Stphan Thomass, Xuan Thang Tran, Rmi Watrigant |
| 2020 | FOCS | Twin-width I: tractable FO model checking. | douard Bonnet, Eun Jung Kim, Stphan Thomass, Rmi Watrigant |
| 2020 | STACS | Grundy Coloring & Friends, Half-Graphs, Bicliques. | Pierre Aboulker, douard Bonnet, Eun Jung Kim, Florian Sikora |
| 2020 | STACS | Maximum Matchings in Geometric Intersection Graphs. | douard Bonnet, Sergio Cabello, Wolfgang Mulzer |
| 2019 | ESA | Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. | douard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik |
| 2019 | ISAAC | When Maximum Stable Set Can Be Solved in FPT Time. | douard Bonnet, Nicolas Bousquet, Stphan Thomass, Rmi Watrigant |
| 2018 | RECOMB | Designing RNA Secondary Structures Is Hard. | douard Bonnet, Pawel Rzazewski, Florian Sikora |
| 2018 | WG | Optimality Program in Segment and String Graphs. | douard Bonnet, Pawel Rzazewski |
| 2017 | ICALP | The Parameterized Complexity of Positional Games. | douard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rmmele, Abdallah Saffidine |
| 2017 | STACS | Complexity of Token Swapping and its Variants. | douard Bonnet, Tillmann Miltzow, Pawel Rzazewski |
| 2016 | ESA | Fixed-Parameter Approximability of Boolean MinCSPs. | douard Bonnet, Lszl Egri, Dniel Marx |
| 2016 | ESA | Parameterized Hardness of Art Gallery Problems. | douard Bonnet, Tillmann Miltzow |
| 2016 | IJCAI | The Complexity of Playing Durak. | douard Bonnet |
| 2016 | LATIN | A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. | douard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis |
| 2016 | STACS | Time-Approximation Trade-offs for Inapproximable Problems. | douard Bonnet, Michael Lampis, Vangelis Th. Paschos |
| 2016 | WG | Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. | douard Bonnet, Nick Brettell, O-joung Kwon, Dniel Marx |
| 2014 | ECAI | On the Complexity of General Game Playing. | douard Bonnet, Abdallah Saffidine |