Havannah and TwixT are PSPACE-complete. - Edouard Bonnet; Florian Jamain; Abdallah Saffidine (Computers and Games, 2013)

On the Complexity of Trick-Taking Card Games. - Edouard Bonnet; Florian Jamain; Abdallah Saffidine (IJCAI, 2013)

Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. - Edouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Emeric Tourniaire (IPEC, 2013)

Multiparameterizations for max $k$-set cover and related satisfiability problems. - Edouard Bonnet; Vangelis Th. Paschos; Florian Sikora (CoRR, 2013)

On the Complexity of General Game Playing. - Édouard Bonnet; Abdallah Saffidine (CGW@ECAI, 2014)

On the approximation of maximum $k$-vertex cover in bipartite graphs. - Edouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Georgios Stamoulis (CoRR, 2014)

Parameterized (in)approximability of subset problems. - Edouard Bonnet; Vangelis Th. Paschos (Oper. Res. Lett., 2014)

Positive and Negative Results in Approximation and Parameterized Complexity. (Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée). - Édouard Bonnet (2014)

Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game. - Edouard Bonnet; Florian Jamain; Abdallah Saffidine (ACG, 2015)

On Subexponential and FPT-Time Inapproximability. - Edouard Bonnet; Bruno Escoffier; Eun Jung Kim 002; Vangelis Th. Paschos (Algorithmica, 2015)

Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. - Edouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Emeric Tourniaire (Algorithmica, 2015)

The parameterized complexity of Graph Motif relatively to the structure of the input graph. - Edouard Bonnet; Florian Sikora (CoRR, 2015)

Fixed-Parameter Approximability of Boolean MinCSPs. - Édouard Bonnet; László Egri; Dániel Marx (ESA, 2016)

The Complexity of Playing Durak. - Édouard Bonnet (IJCAI, 2016)

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. - Édouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Georgios Stamoulis (LATIN, 2016)

Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. - Édouard Bonnet; Nick Brettell; O-joung Kwon; Dániel Marx (WG, 2016)

Flip Distance to a Non-crossing Perfect Matching. - Édouard Bonnet; Tillmann Miltzow (CoRR, 2016)

The Parameterized Hardness of the Art Gallery Problem. - Édouard Bonnet; Tillmann Miltzow (CoRR, 2016)

A Note on Edge Isoperimetric Numbers and Regular Graphs. - Édouard Bonnet; Florian Sikora (Int. J. Found. Comput. Sci., 2016)

Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems. - Édouard Bonnet; Vangelis Th. Paschos; Florian Sikora (RAIRO Theor. Informatics Appl., 2016)

On the complexity of connection games. - Édouard Bonnet; Florian Jamain; Abdallah Saffidine (Theor. Comput. Sci., 2016)

An Approximation Algorithm for the Art Gallery Problem. - Édouard Bonnet; Tillmann Miltzow (SoCG, 2017)

The Parameterized Complexity of Positional Games. - Édouard Bonnet; Serge Gaspers; Antonin Lambilliotte; Stefan Rümmele; Abdallah Saffidine (ICALP, 2017)

The Graph Motif problem parameterized by the structure of the input graph. - Édouard Bonnet; Florian Sikora (Discret. Appl. Math., 2017)

Dual parameterization and parameterized approximability of subset graph problems. - Édouard Bonnet; Vangelis Th. Paschos (RAIRO Oper. Res., 2017)

On the complexity of various parameterizations of common induced subgraph isomorphism. - Faisal N. Abu-Khzam; Édouard Bonnet; Florian Sikora (Theor. Comput. Sci., 2017)

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. - Édouard Bonnet; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora (SoCG, 2018)

EPTAS for Max Clique on Disks and Unit Balls. - Marthe Bonamy; Edouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Stéphan Thomassé (FOCS, 2018)

The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration. - Édouard Bonnet; Florian Sikora (IPEC, 2018)

Sparsification and subexponential approximation. - Édouard Bonnet; Vangelis Th. Paschos (Acta Informatica, 2018)

Complexity of Token Swapping and Its Variants. - Édouard Bonnet; Tillmann Miltzow; Pawel Rzazewski (Algorithmica, 2018)

The inverse Voronoi problem in graphs. - Édouard Bonnet; Sergio Cabello; Bojan Mohar; Hebert Pérez-Rosés (CoRR, 2018)

Complexity of Grundy coloring and its variants. - Édouard Bonnet; Florent Foucaud; Eun Jung Kim 002; Florian Sikora (Discret. Appl. Math., 2018)

Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. - Édouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Georgios Stamoulis (Discret. Optim., 2018)

Time-approximation trade-offs for inapproximable problems. - Édouard Bonnet; Michael Lampis; Vangelis Th. Paschos (J. Comput. Syst. Sci., 2018)

Fine-grained complexity of coloring unit disks and balls. - Csaba Biró; Édouard Bonnet; Dániel Marx; Tillmann Miltzow; Pawel Rzazewski (J. Comput. Geom., 2018)

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. - Édouard Bonnet; Yoichi Iwata; Bart M. P. Jansen; Lukasz Kowalik (ESA, 2019)

Parameterized Streaming Algorithms for Min-Ones d-SAT. - Akanksha Agrawal 001; Arindam Biswas 001; Édouard Bonnet; Nick Brettell; Radu Curticapean; Dániel Marx; Tillmann Miltzow; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2019)

When Maximum Stable Set Can Be Solved in FPT Time. - Édouard Bonnet; Nicolas Bousquet 001; Stéphan Thomassé; Rémi Watrigant (ISAAC, 2019)

Constraint Generation Algorithm for the Minimum Connectivity Inference Problem. - Édouard Bonnet; Diana-Elena Falamas; Rémi Watrigant (SEA², 2019)

Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms. - Édouard Bonnet; Nick Brettell; O-joung Kwon; Dániel Marx (Algorithmica, 2019)

Optimality Program in Segment and String Graphs. - Édouard Bonnet; Pawel Rzazewski (Algorithmica, 2019)

Parameterized Intractability of Even Set and Shortest Vector Problem. - Arnab Bhattacharyya 001; Édouard Bonnet; László Egri; Suprovat Ghoshal; Karthik C. S. 001; Bingkai Lin; Pasin Manurangsi; Dániel Marx (Electron. Colloquium Comput. Complex., 2019)

Orthogonal Terrain Guarding is NP-complete. - Édouard Bonnet; Panos Giannopoulos (J. Comput. Geom., 2019)

On the parameterized complexity of red-blue points separation. - Edouard Bonnet; Panos Giannopoulos; Michael Lampis (J. Comput. Geom., 2019)

An Algorithmic Weakening of the Erdős-Hajnal Conjecture. - Édouard Bonnet; Stéphan Thomassé; Xuan Thang Tran; Rémi Watrigant (ESA, 2020)

Maximum Clique in Disk-Like Intersection Graphs. - Édouard Bonnet; Nicolas Grelier; Tillmann Miltzow (FSTTCS, 2020)

Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. - Benjamin Bergougnoux; Édouard Bonnet; Nick Brettell; O-joung Kwon (IPEC, 2020)

Grundy Coloring & Friends, Half-Graphs, Bicliques. - Pierre Aboulker; Édouard Bonnet; Eun Jung Kim 002; Florian Sikora (STACS, 2020)

Parameterized Complexity of Independent Set in H-Free Graphs. - Édouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Stéphan Thomassé; Rémi Watrigant (Algorithmica, 2020)

The Inverse Voronoi Problem in Graphs I: Hardness. - Édouard Bonnet; Sergio Cabello; Bojan Mohar; Hebert Pérez-Rosés (Algorithmica, 2020)

Twin-width III: Max Independent Set and Coloring. - Édouard Bonnet; Colin Geniet; Eun Jung Kim 002; Stéphan Thomassé; Rémi Watrigant (CoRR, 2020)

Designing RNA Secondary Structures Is Hard. - Édouard Bonnet; Pawel Rzazewski; Florian Sikora (J. Comput. Biol., 2020)

Parameterized Hardness of Art Gallery Problems. - Édouard Bonnet; Tillmann Miltzow (ACM Trans. Algorithms, 2020)

4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^{4/3}. - Édouard Bonnet (ICALP, 2021)

Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio. - Édouard Bonnet (STACS, 2021)

The Inverse Voronoi Problem in Graphs II: Trees. - Édouard Bonnet; Sergio Cabello; Bojan Mohar; Hebert Pérez-Rosés (Algorithmica, 2021)

Metric Dimension Parameterized By Treewidth. - Édouard Bonnet; Nidhi Purohit (Algorithmica, 2021)

The complexity of mixed-connectivity. - Édouard Bonnet; Sergio Cabello (Ann. Oper. Res., 2021)

4 vs 7 sparse undirected unweighted Diameter is SETH-hard at time n4/3. - Édouard Bonnet (CoRR, 2021)

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. - Marthe Bonamy; Édouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora; Stéphan Thomassé (J. ACM, 2021)

Deciding Twin-Width at Most 4 Is NP-Complete. - Pierre Bergé; Édouard Bonnet; Hugues Déprés (ICALP, 2022)

Twin-Width VIII: Delineation and Win-Wins. - Édouard Bonnet; Dibyayan Chakraborty; Eun Jung Kim 002; Noleen Köhler; Raul Lopes 001; Stéphan Thomassé (IPEC, 2022)

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. - Édouard Bonnet; Jan Dreier; Jakub Gajarský; Stephan Kreutzer; Nikolas Mählmann; Pierre Simon; Szymon Torunczyk (LICS, 2022)

Twin-width VI: the lens of contraction sequences. - Édouard Bonnet; Eun Jung Kim 002; Amadeus Reinald; Stéphan Thomassé (SODA, 2022)

Twin-width and Polynomial Kernels. - Édouard Bonnet; Eun Jung Kim 002; Amadeus Reinald; Stéphan Thomassé; Rémi Watrigant (Algorithmica, 2022)

Twin-width II: small classes. - Édouard Bonnet; Colin Geniet; Eun Jung Kim 002; Stéphan Thomassé; Rémi Watrigant (Comb. Theory, 2022)

Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond). - Édouard Bonnet; O-joung Kwon; David R. Wood (CoRR, 2022)

Twin-width VII: groups. - Édouard Bonnet; Colin Geniet; Romain Tessera; Stéphan Thomassé (CoRR, 2022)

Twin-width I: Tractable FO Model Checking. - Édouard Bonnet; Eun Jung Kim 002; Stéphan Thomassé; Rémi Watrigant (J. ACM, 2022)

4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n4/3. - Édouard Bonnet (ACM Trans. Algorithms, 2022)

Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄. - Édouard Bonnet; Julien Duron; Colin Geniet; Stéphan Thomassé; Alexandra Wesolek (ESA, 2023)

Treewidth Is NP-Complete on Cubic Graphs. - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (IPEC, 2023)

Stretch-Width. - Édouard Bonnet; Julien Duron (IPEC, 2023)

PACE Solver Description: RedAlert - Heuristic Track. - Édouard Bonnet; Julien Duron (IPEC, 2023)

Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. - Pierre Bergé; Édouard Bonnet; Hugues Déprés; Rémi Watrigant (STACS, 2023)

Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication. - Édouard Bonnet; Ugo Giocanti; Patrice Ossona de Mendez; Stéphan Thomassé (STACS, 2023)

Grundy Coloring and Friends, Half-Graphs, Bicliques. - Pierre Aboulker; Édouard Bonnet; Eun Jung Kim 002; Florian Sikora (Algorithmica, 2023)

Treewidth is NP-Complete on Cubic Graphs (and related results). - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (CoRR, 2023)

Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4. - Édouard Bonnet; Julien Duron; Colin Geniet; Stéphan Thomassé; Alexandra Wesolek (CoRR, 2023)

Small But Unwieldy. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (CoRR, 2023)

Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor. - Édouard Bonnet; Jedrzej Hodor; Tuukka Korhonen; Tomás Masarík (CoRR, 2023)

RedAlert. - Édouard Bonnet; Julien Duron (Zenodo, 2023)

Twin-width can be exponential in treewidth. - Édouard Bonnet; Hugues Déprés (J. Comb. Theory B, 2023)

Maximum Matchings in Geometric Intersection Graphs. - Édouard Bonnet; Sergio Cabello; Wolfgang Mulzer (Discret. Comput. Geom., 2023)

Twin-Width and Contraction Sequences. - Édouard Bonnet (2024)

Tight Bounds on Adjacency Labels for Monotone Graph Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (ICALP, 2024)

Symmetric-Difference (Degeneracy) and Signed Tree Models. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev (MFCS, 2024)

Factoring Pattern-Free Permutations into Separable ones. - Edouard Bonnet; Romain Bourneuf; Colin Geniet; Stéphan Thomassé (SODA, 2024)

Graphs without a 3-connected subgraph are 4-colorable. - Édouard Bonnet; Carl Feghali; Stéphan Thomassé; Nicolas Trotignon (CoRR, 2024)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. - Marthe Bonamy; Édouard Bonnet; Hugues Déprés; Louis Esperet; Colin Geniet; Claire Hilaire; Stéphan Thomassé; Alexandra Wesolek (J. Comb. Theory B, 2024)

Twin-width and permutations. - Édouard Bonnet; Jaroslav Nesetril; Patrice Ossona de Mendez; Sebastian Siebertz; Stéphan Thomassé (Log. Methods Comput. Sci., 2024)

Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (SIAM J. Comput., 2024)

Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring. - Édouard Bonnet; Colin Geniet; Eun Jung Kim 002; Stéphan Thomassé; Rémi Watrigant (SIAM J. Comput., 2024)

Cutting Barnette graphs perfectly is hard. - Édouard Bonnet; Dibyayan Chakraborty; Julien Duron (Theor. Comput. Sci., 2024)

Neighbourhood complexity of graphs of bounded twin-width. - Édouard Bonnet; Florent Foucaud; Tuomo Lehtilä; Aline Parreau (Eur. J. Comb., 2024)

Twin-Width IV: Ordered Graphs and Matrices. - Édouard Bonnet; Ugo Giocanti; Patrice Ossona de Mendez; Pierre Simon; Stéphan Thomassé; Szymon Torunczyk (J. ACM, 2024)

On the Twin-Width of Smooth Manifolds. - Édouard Bonnet; Kristóf Huszár (SoCG, 2025)

An 11/6-Approximation Algorithm for Vertex Cover on String Graphs. - Édouard Bonnet; Pawel Rzazewski (SoCG, 2025)

Induced Disjoint Paths Without an Induced Minor. - Pierre Aboulker; Édouard Bonnet; Timothé Picavet; Nicolas Trotignon (ICALP, 2025)

Mim-Width Is paraNP-Complete. - Benjamin Bergougnoux; Édouard Bonnet; Julien Duron (ICALP, 2025)

Separability Properties of Monadically Dependent Graph Classes. - Édouard Bonnet; Samuel Braunfeld; Ioannis Eleftheriadis; Colin Geniet; Nikolas Mählmann; Michal Pilipczuk; Wojciech Przybyszewski; Szymon Torunczyk (ICALP, 2025)

Adjacency Labeling Schemes for Small Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev (ITCS, 2025)

Temporal Valued Constraint Satisfaction Problems. - Manuel Bodirsky; Édouard Bonnet; Zaneta Semanisinová (MFCS, 2025)

Treewidth Inapproximability and Tight ETH Lower Bound. - Édouard Bonnet (STOC, 2025)

Graphs without a 3-Connected Subgraph are 4-Colourable. - Édouard Bonnet; Carl Feghali; Tung Nguyen 004; Alex Scott 001; Paul D. Seymour; Stéphan Thomassé; Nicolas Trotignon (Electron. J. Comb., 2025)

Sparse induced subgraphs of large treewidth. - Édouard Bonnet (J. Comb. Theory B, 2025)

Answering Related Questions. - Édouard Bonnet (CoRR, 2025)

Every Graph is Essential to Large Treewidth. - Bogdan Alecu; Édouard Bonnet; Pedro Bureo Villafana; Nicolas Trotignon (CoRR, 2025)

Induced Minors and Region Intersection Graphs. - Édouard Bonnet; Robert Hickingbotham (CoRR, 2025)

Treedepth Inapproximability and Exponential ETH Lower Bound. - Édouard Bonnet; Daniel Neuen; Marek Sokolowski 001 (CoRR, 2025)