╔douard Bonnet
╔douard Bonnet
ENS Lyon, LIP, France
Verified email at - Homepage
Cited by
Cited by
Twin-width I: tractable FO model checking
╔ Bonnet, EJ Kim, S ThomassÚ, R Watrigant
ACM Journal of the ACM (JACM) 69 (1), 1-46, 2021
Twin-width II: small classes
╔ Bonnet, C Geniet, EJ Kim, S ThomassÚ, R Watrigant
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODAá…, 2021
On subexponential and FPT-time inapproximability
E Bonnet, B Escoffier, EJ Kim, VT Paschos
Algorithmica 71 (3), 541-565, 2015
Complexity of token swapping and its variants
╔ Bonnet, T Miltzow, P Rzążewski
Algorithmica 80 (9), 2656-2682, 2018
An approximation algorithm for the art gallery problem
╔ Bonnet, T Miltzow
arXiv preprint arXiv:1607.05527, 2016
The Parameterized Hardness of Art Gallery Problems
╔ Bonnet, T Miltzow
arXiv preprint arXiv:1603.08116, 2016
Twin-width III: max independent set, min dominating set, and coloring
╔ Bonnet, C Geniet, EJ Kim, S ThomassÚ, R Watrigant
arXiv preprint arXiv:2007.14161, 2020
Twin-width IV: ordered graphs and matrices
╔ Bonnet, U Giocanti, P Ossona de Mendez, P Simon, S ThomassÚ, ...
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computingá…, 2022
The PACE 2018 parameterized algorithms and computational experiments challenge: The third iteration
╔ Bonnet, F Sikora
IPEC 2018, 2018
Twin-width and permutations
╔ Bonnet, J Nešetřil, PO de Mendez, S Siebertz, S ThomassÚ
arXiv preprint arXiv:2102.06880, 2021
Designing RNA secondary structures is hard
╔ Bonnet, P Rzążewski, F Sikora
Journal of Computational Biology 27 (3), 302-316, 2020
Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems
╔ Bonnet, VT Paschos, F Sikora
RAIRO-Theoretical Informatics and Applications 50 (3), 227-240, 2016
On the complexity of trick-taking card games
╔ Bonnet, F Jamain, A Saffidine
Twenty-Third International Joint Conference on Artificial Intelligence, 2013
Parameterized complexity of independent set in H-free graphs
╔ Bonnet, N Bousquet, P Charbit, S ThomassÚ, R Watrigant
Algorithmica 82 (8), 2360-2394, 2020
The graph motif problem parameterized by the structure of the input graph
╔ Bonnet, F Sikora
Discrete Applied Mathematics 231, 78-94, 2017
Complexity of Grundy coloring and its variants
╔ Bonnet, F Foucaud, EJ Kim, F Sikora
Discrete Applied Mathematics 243, 99-114, 2018
Time-approximation trade-offs for inapproximable problems
╔ Bonnet, M Lampis, VT Paschos
Journal of Computer and System Sciences 92, 171-180, 2018
Multi-parameter analysis for local graph partitioning problems: Using greediness for parameterization
E Bonnet, B Escoffier, VT Paschos, E Tourniaire
Algorithmica 71 (3), 566-580, 2015
Twin-width VI: the lens of contraction sequences∗
╔ Bonnet, EJ Kim, A Reinald, S ThomassÚ
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithmsá…, 2022
Parameterized Intractability of Even Set and Shortest<? brk?> Vector Problem
A Bhattacharyya, ╔ Bonnet, L Egri, S Ghoshal, B Lin, P Manurangsi, ...
Journal of the ACM (JACM) 68 (3), 1-40, 2021
The system can't perform the operation now. Try again later.
Articles 1–20