Édouard Bonnet

181 papers A* 21A 13B 21Journal 120Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications.
CoRR
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Sungmin Moon
2026 J jnl
Maximum Independent Set when Excluding an Induced Minor: K
Algorithmica
Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek
2026 J jnl
QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes.
CoRR
Édouard Bonnet, Jadwiga Czyzewska, Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski
2026 J jnl
Reduced bandwidth: A qualitative strengthening of twin-width in minor-closed classes (and beyond).
J. Comb. Theory B
Édouard Bonnet, O-joung Kwon, David R. Wood
2025 A conf
Adjacency Labeling Schemes for Small Classes.
ITCS
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
2025 A* conf
An 11/6-Approximation Algorithm for Vertex Cover on String Graphs.
SoCG
Édouard Bonnet, Pawel Rzazewski
2025 J jnl
Answering Related Questions.
CoRR
Édouard Bonnet
2025 J jnl
Coloring Hardness on Low Twin-Width Graphs.
CoRR
Édouard Bonnet
2025 J jnl
Every Graph is Essential to Large Treewidth.
CoRR
Bogdan Alecu, Édouard Bonnet, Pedro Bureo Villafana, Nicolas Trotignon
2025 J jnl
Excluding a Forest Induced Minor.
CoRR
Édouard Bonnet, Benjamin Duhamel, Robert Hickingbotham
2025 J jnl
Graphs without a 3-Connected Subgraph are 4-Colourable.
Electron. J. Comb.
Édouard Bonnet, Carl Feghali, Tung Nguyen, Alex Scott, Paul D. Seymour, Stéphan Thomassé, Nicolas Trotignon
2025 A* conf
Induced Disjoint Paths Without an Induced Minor.
ICALP
Pierre Aboulker, Édouard Bonnet, Timothé Picavet, Nicolas Trotignon
2025 J jnl
Induced Disjoint Paths Without an Induced Minor.
CoRR
Pierre Aboulker, Édouard Bonnet, Timothé Picavet, Nicolas Trotignon
2025 J jnl
Induced Minors and Region Intersection Graphs.
CoRR
Édouard Bonnet, Robert Hickingbotham
2025 A* conf
Mim-Width Is paraNP-Complete.
ICALP
Benjamin Bergougnoux, Édouard Bonnet, Julien Duron
2025 J jnl
Mim-Width is paraNP-complete.
CoRR
Benjamin Bergougnoux, Édouard Bonnet, Julien Duron
2025 A* conf
On the Twin-Width of Smooth Manifolds.
SoCG
Édouard Bonnet, Kristóf Huszár
2025 A* conf
Separability Properties of Monadically Dependent Graph Classes.
ICALP
Édouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mählmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2025 J jnl
Separability Properties of Monadically Dependent Graph Classes.
CoRR
Édouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mählmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2025 J jnl
Separator Theorem for Minor-Free Graphs in Linear Time.
CoRR
Édouard Bonnet, Tuukka Korhonen, Hung Le, Jason Li, Tomás Masarík
2025 J jnl
Sparse induced subgraphs of large treewidth.
J. Comb. Theory B
Édouard Bonnet
2025 B conf
Temporal Valued Constraint Satisfaction Problems.
MFCS
Manuel Bodirsky, Édouard Bonnet, Zaneta Semanisinová
2025 B conf
Treedepth Inapproximability and Exponential ETH Lower Bound.
IPEC
Édouard Bonnet, Daniel Neuen, Marek Sokolowski
2025 J jnl
Treedepth Inapproximability and Exponential ETH Lower Bound.
CoRR
Édouard Bonnet, Daniel Neuen, Marek Sokolowski
2025 A* conf
Treewidth Inapproximability and Tight ETH Lower Bound.
STOC
Édouard Bonnet
2025 J jnl
Treewidth is NP-Complete on Cubic Graphs.
Electron. J. Comb.
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2024 B ed.
19th International Symposium on Parameterized and Exact Computation, IPEC 2024, Royal Holloway, University of London, Egham, United Kingdom, September 4-6, 2024
IPEC
Édouard Bonnet, Pawel Rzazewski
2024 J jnl
Adjacency Labeling Schemes for Small Classes.
CoRR
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
2024 J jnl
An 11/6-Approximation Algorithm for Vertex Cover on String Graphs.
CoRR
Édouard Bonnet, Pawel Rzazewski
2024 J jnl
Cutting Barnette graphs perfectly is hard.
Theor. Comput. Sci.
Édouard Bonnet, Dibyayan Chakraborty, Julien Duron
2024 J jnl
Graphs without a 3-connected subgraph are 4-colorable.
CoRR
Édouard Bonnet, Carl Feghali, Stéphan Thomassé, Nicolas Trotignon
2024 J jnl
Neighbourhood complexity of graphs of bounded twin-width.
Eur. J. Comb.
Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau
2024 J jnl
On the twin-width of smooth manifolds.
CoRR
Édouard Bonnet, Kristóf Huszár
2024 J jnl
Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes.
SIAM J. Comput.
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2024 J jnl
Sparse Induced Subgraphs of Large Treewidth.
CoRR
Édouard Bonnet
2024 J jnl
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.
J. Comb. Theory B
Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
2024 B conf
Symmetric-Difference (Degeneracy) and Signed Tree Models.
MFCS
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
2024 J jnl
Symmetric-Difference (Degeneracy) and Signed Tree Models.
CoRR
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
2024 J jnl
Temporal Valued Constraint Satisfaction Problems.
CoRR
Manuel Bodirsky, Édouard Bonnet, Zaneta Semanisinová
2024 A* conf
Tight Bounds on Adjacency Labels for Monotone Graph Classes.
ICALP
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2024 J jnl
Treewidth Inapproximability and Tight ETH Lower Bound.
CoRR
Édouard Bonnet
2024 J jnl
Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring.
SIAM J. Comput.
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2024 J jnl
Twin-Width IV: Ordered Graphs and Matrices.
J. ACM
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk
2024 — book
Twin-Width and Contraction Sequences.
Édouard Bonnet
2024 J jnl
Twin-width and permutations.
Log. Methods Comput. Sci.
Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé
2023 A conf
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width.
STACS
Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant
2023 B conf
Cutting Barnette Graphs Perfectly is Hard.
WG
Édouard Bonnet, Dibyayan Chakraborty, Julien Duron
2023 J jnl
Cutting Barnette graphs perfectly is hard.
CoRR
Édouard Bonnet, Dibyayan Chakraborty, Julien Duron
2023 J jnl
Factoring Pattern-Free Permutations into Separable ones.
CoRR
Édouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé
2023 J jnl
Grundy Coloring and Friends, Half-Graphs, Bicliques.
Algorithmica
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
2023 A conf
Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄.
ESA
Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek
2023 J jnl
Maximum Independent Set when excluding an induced minor: K
CoRR
Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek
2023 J jnl
Maximum Matchings in Geometric Intersection Graphs.
Discret. Comput. Geom.
Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer
2023 J jnl
Neighbourhood complexity of graphs of bounded twin-width.
CoRR
Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau
2023 B conf
PACE Solver Description: RedAlert - Heuristic Track.
IPEC
Édouard Bonnet, Julien Duron
2023 J jnl
Small But Unwieldy.
CoRR
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2023 B conf
Stretch-Width.
IPEC
Édouard Bonnet, Julien Duron
2023 J jnl
Stretch-width.
CoRR
Édouard Bonnet, Julien Duron
2023 J jnl
Tight bounds on adjacency labels for monotone graph classes.
CoRR
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2023 B conf
Treewidth Is NP-Complete on Cubic Graphs.
IPEC
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2023 J jnl
Treewidth is NP-Complete on Cubic Graphs (and related results).
CoRR
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2023 J jnl
Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor.
CoRR
Édouard Bonnet, Jedrzej Hodor, Tuukka Korhonen, Tomás Masarík
2023 A conf
Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication.
STACS
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé
2023 J jnl
Twin-width can be exponential in treewidth.
J. Comb. Theory B
Édouard Bonnet, Hugues Déprés
2022 J jnl
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time
ACM Trans. Algorithms
Édouard Bonnet
2022 J jnl
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width.
CoRR
Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant
2022 A* conf
Deciding Twin-Width at Most 4 Is NP-Complete.
ICALP
Pierre Bergé, Édouard Bonnet, Hugues Déprés
2022 A* conf
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.
LICS
Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk
2022 J jnl
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.
CoRR
Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk
2022 J jnl
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond).
CoRR
Édouard Bonnet, O-joung Kwon, David R. Wood
2022 J jnl
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.
CoRR
Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
2022 B conf
Twin-Width VIII: Delineation and Win-Wins.
IPEC
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé
2022 J jnl
Twin-width I: Tractable FO Model Checking.
J. ACM
Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2022 J jnl
Twin-width II: small classes.
Comb. Theory
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2022 A* conf
Twin-width IV: ordered graphs and matrices.
STOC
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk
2022 J jnl
Twin-width V: linear minors, modular counting, and matrix multiplication.
CoRR
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé
2022 A* conf
Twin-width VI: the lens of contraction sequences.
SODA
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé
2022 J jnl
Twin-width VII: groups.
CoRR
Édouard Bonnet, Colin Geniet, Romain Tessera, Stéphan Thomassé
2022 J jnl
Twin-width VIII: delineation and win-wins.
CoRR
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé
2022 J jnl
Twin-width and Polynomial Kernels.
Algorithmica
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
2022 J jnl
Twin-width can be exponential in treewidth.
CoRR
Édouard Bonnet, Hugues Déprés
2021 A* conf
4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^{4/3}.
ICALP
Édouard Bonnet
2021 J jnl
4 vs 7 sparse undirected unweighted Diameter is SETH-hard at time n
CoRR
Édouard Bonnet
2021 J jnl
Deciding twin-width at most 4 is NP-complete.
CoRR
Pierre Bergé, Édouard Bonnet, Hugues Déprés
2021 J jnl
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.
CoRR
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021 J jnl
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.
J. ACM
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021 A conf
Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio.
STACS
Édouard Bonnet
2021 J jnl
Metric Dimension Parameterized By Treewidth.
Algorithmica
Édouard Bonnet, Nidhi Purohit
2021 J jnl
Parameterized Intractability of Even Set and Shortest Vector Problem.
J. ACM
Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx
2021 J jnl
The Inverse Voronoi Problem in Graphs II: Trees.
Algorithmica
Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés
2021 J jnl
The complexity of mixed-connectivity.
Ann. Oper. Res.
Édouard Bonnet, Sergio Cabello
2021 B conf
Twin-Width and Polynomial Kernels.
IPEC
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
2021 A* conf
Twin-width II: small classes.
SODA
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2021 A* conf
Twin-width III: Max Independent Set, Min Dominating Set, and Coloring.
ICALP
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2021 J jnl
Twin-width IV: ordered graphs and matrices.
CoRR
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk
2021 J jnl
Twin-width VI: the lens of contraction sequences.
CoRR
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé
2021 J jnl
Twin-width and permutations.
CoRR
Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé
2021 J jnl
Twin-width and polynomial kernels.
CoRR
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
2020 A conf
An Algorithmic Weakening of the Erdős-Hajnal Conjecture.
ESA
Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant
2020 J jnl
An algorithmic weakening of the Erdős-Hajnal conjecture.
CoRR
Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant
2020 B conf
Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth.
IPEC
Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon
2020 J jnl
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth.
CoRR
Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon
2020 J jnl
Designing RNA Secondary Structures Is Hard.
J. Comput. Biol.
Édouard Bonnet, Pawel Rzazewski, Florian Sikora
2020 A conf
Grundy Coloring & Friends, Half-Graphs, Bicliques.
STACS
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
2020 J jnl
Grundy Coloring & friends, Half-Graphs, Bicliques.
CoRR
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
2020 J jnl
Inapproximability of Diameter in super-linear time: Beyond the 5/3 ratio.
CoRR
Édouard Bonnet
2020 — conf
Maximum Clique in Disk-Like Intersection Graphs.
FSTTCS
Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow
2020 J jnl
Maximum Clique in Disk-Like Intersection Graphs.
CoRR
Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow
2020 A conf
Maximum Matchings in Geometric Intersection Graphs.
STACS
Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer
2020 J jnl
Parameterized Complexity of Independent Set in H-Free Graphs.
Algorithmica
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
2020 J jnl
Parameterized Hardness of Art Gallery Problems.
ACM Trans. Algorithms
Édouard Bonnet, Tillmann Miltzow
2020 J jnl
The Complexity of Mixed-Connectivity.
CoRR
Édouard Bonnet, Sergio Cabello
2020 J jnl
The Inverse Voronoi Problem in Graphs I: Hardness.
Algorithmica
Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés
2020 A* conf
Twin-width I: tractable FO model checking.
FOCS
Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020 J jnl
Twin-width I: tractable FO model checking.
CoRR
Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020 J jnl
Twin-width II: small classes.
CoRR
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020 J jnl
Twin-width III: Max Independent Set and Coloring.
CoRR
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2019 — conf
Constraint Generation Algorithm for the Minimum Connectivity Inference Problem.
SEA²
Édouard Bonnet, Diana-Elena Falamas, Rémi Watrigant
2019 J jnl
Constraint Generation Algorithm for the Minimum Connectivity Inference Problem.
CoRR
Édouard Bonnet, Diana-Elena Falamas, Rémi Watrigant
2019 A conf
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP.
ESA
Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
2019 J jnl
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP.
CoRR
Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
2019 J jnl
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms.
Algorithmica
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2019 J jnl
Maximum Matchings in Geometric Intersection Graphs.
CoRR
Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer
2019 B conf
Metric Dimension Parameterized by Treewidth.
IPEC
Édouard Bonnet, Nidhi Purohit
2019 J jnl
Metric Dimension Parameterized by Treewidth.
CoRR
Édouard Bonnet, Nidhi Purohit
2019 J jnl
Optimality Program in Segment and String Graphs.
Algorithmica
Édouard Bonnet, Pawel Rzazewski
2019 J jnl
Orthogonal Terrain Guarding is NP-complete.
J. Comput. Geom.
Édouard Bonnet, Panos Giannopoulos
2019 J jnl
Parameterized Intractability of Even Set and Shortest Vector Problem.
CoRR
Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx
2019 J jnl
Parameterized Intractability of Even Set and Shortest Vector Problem.
Electron. Colloquium Comput. Complex.
Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx
2019 — conf
Parameterized Streaming Algorithms for Min-Ones d-SAT.
FSTTCS
Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh
2019 B conf
When Maximum Stable Set Can Be Solved in FPT Time.
ISAAC
Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant
2019 J jnl
When Maximum Stable Set can be solved in FPT time.
CoRR
Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant
2018 J jnl
Complexity of Grundy coloring and its variants.
Discret. Appl. Math.
Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
2018 J jnl
Complexity of Token Swapping and Its Variants.
Algorithmica
Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski
2018 B conf
Designing RNA Secondary Structures Is Hard.
RECOMB
Édouard Bonnet, Pawel Rzazewski, Florian Sikora
2018 J jnl
EPTAS for Max Clique on Disks and Unit Balls.
CoRR
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
2018 J jnl
Fine-grained complexity of coloring unit disks and balls.
J. Comput. Geom.
Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski
2018 B conf
Optimality Program in Segment and String Graphs.
WG
Édouard Bonnet, Pawel Rzazewski
2018 A* conf
Orthogonal Terrain Guarding is NP-complete.
SoCG
Édouard Bonnet, Panos Giannopoulos
2018 B conf
Parameterized Complexity of Independent Set in H-Free Graphs.
IPEC
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
2018 J jnl
Parameterized Complexity of Independent Set in H-Free Graphs.
CoRR
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
2018 J jnl
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs.
Discret. Optim.
Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
2018 A* conf
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs.
SoCG
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
2018 J jnl
Sparsification and subexponential approximation.
Acta Informatica
Édouard Bonnet, Vangelis Th. Paschos
2018 B conf
The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration.
IPEC
Édouard Bonnet, Florian Sikora
2018 J jnl
The inverse Voronoi problem in graphs.
CoRR
Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés
2018 J jnl
Time-approximation trade-offs for inapproximable problems.
J. Comput. Syst. Sci.
Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos
2017 A* conf
An Approximation Algorithm for the Art Gallery Problem.
SoCG
Édouard Bonnet, Tillmann Miltzow
2017 A conf
Complexity of Token Swapping and its Variants.
STACS
Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski
2017 J jnl
Designing RNA Secondary Structures is Hard.
CoRR
Édouard Bonnet, Pawel Rzazewski, Florian Sikora
2017 J jnl
Dual parameterization and parameterized approximability of subset graph problems.
RAIRO Oper. Res.
Édouard Bonnet, Vangelis Th. Paschos
2017 A* conf
Fine-Grained Complexity of Coloring Unit Disks and Balls.
SoCG
Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski
2017 B conf
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms.
IPEC
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2017 J jnl
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms.
CoRR
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2017 B conf
On the Parameterized Complexity of Red-Blue Points Separation.
IPEC
Édouard Bonnet, Panos Giannopoulos, Michael Lampis
2017 J jnl
On the Parameterized Complexity of Red-Blue Points Separation.
CoRR
Édouard Bonnet, Panos Giannopoulos, Michael Lampis
2017 J jnl
On the complexity of various parameterizations of common induced subgraph isomorphism.
Theor. Comput. Sci.
Faisal N. Abu-Khzam, Édouard Bonnet, Florian Sikora
2017 J jnl
Optimality Program in Segment and String Graphs.
CoRR
Édouard Bonnet, Pawel Rzazewski
2017 J jnl
Orthogonal Terrain Guarding is NP-complete.
CoRR
Édouard Bonnet, Panos Giannopoulos
2017 J jnl
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs.
CoRR
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
2017 J jnl
The Graph Motif problem parameterized by the structure of the input graph.
Discret. Appl. Math.
Édouard Bonnet, Florian Sikora
2017 A* conf
The Parameterized Complexity of Positional Games.
ICALP
Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine
2017 J jnl
The Parameterized Complexity of Positional Games.
CoRR
Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine
2016 B conf
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs.
LATIN
Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
2016 J jnl
A Note on Edge Isoperimetric Numbers and Regular Graphs.
Int. J. Found. Comput. Sci.
Édouard Bonnet, Florian Sikora
2016 J jnl
An Approximation Algorithm for the Art Gallery Problem.
CoRR
Édouard Bonnet, Tillmann Miltzow
2016 J jnl
Complexity of Token Swapping and its Variants.
CoRR
Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski
2016 A conf
Fixed-Parameter Approximability of Boolean MinCSPs.
ESA
Édouard Bonnet, László Egri, Dániel Marx
2016 J jnl
Fixed-parameter Approximability of Boolean MinCSPs.
CoRR
Édouard Bonnet, László Egri, Dániel Marx
2016 J jnl
Flip Distance to a Non-crossing Perfect Matching.
CoRR
Édouard Bonnet, Tillmann Miltzow
2016 J jnl
On the Complexity of Connection Games.
CoRR
Édouard Bonnet, Florian Jamain, Abdallah Saffidine
2016 J jnl
On the complexity of connection games.
Theor. Comput. Sci.
Édouard Bonnet, Florian Jamain, Abdallah Saffidine
2016 A conf
Parameterized Hardness of Art Gallery Problems.
ESA
Édouard Bonnet, Tillmann Miltzow
2016 B conf
Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property.
WG
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2016 J jnl
Parameterized exact and approximation algorithms for maximum
RAIRO Theor. Informatics Appl.
Édouard Bonnet, Vangelis Th. Paschos, Florian Sikora
2016 J jnl
Parameterized vertex deletion problems for hereditary graph classes with a block property.
CoRR
Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
2016 A* conf
The Complexity of Playing Durak.
IJCAI
Édouard Bonnet
2016 J jnl
The Parameterized Hardness of the Art Gallery Problem.
CoRR
Édouard Bonnet, Tillmann Miltzow
2016 A conf
Time-Approximation Trade-offs for Inapproximable Problems.
STACS
Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos
2014 — conf
On the Complexity of General Game Playing.
CGW@ECAI
Édouard Bonnet, Abdallah Saffidine
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