╔douard Bonnet
╔douard Bonnet
ENS Lyon, LIP, France
Verified email at ens-lyon.fr - Homepage
Title
Cited by
Cited by
Year
Complexity of token swapping and its variants
╔ Bonnet, T Miltzow, P Rzążewski
Algorithmica 80 (9), 2656-2682, 2018
362018
On subexponential and FPT-time inapproximability
E Bonnet, B Escoffier, EJ Kim, VT Paschos
Algorithmica 71 (3), 541-565, 2015
332015
An approximation algorithm for the art gallery problem
╔ Bonnet, T Miltzow
arXiv preprint arXiv:1607.05527, 2016
232016
The Parameterized Hardness of Art Gallery Problems
╔ Bonnet, T Miltzow
arXiv preprint arXiv:1603.08116, 2016
23*2016
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
202016
On the Complexity of Trick-Taking Card Games.
╔ Bonnet, F Jamain, A Saffidine
IJCAI, 482-488, 2013
192013
The graph motif problem parameterized by the structure of the input graph
╔ Bonnet, F Sikora
Discrete Applied Mathematics 231, 78-94, 2017
172017
Designing RNA secondary structures is hard
╔ Bonnet, P Rzążewski, F Sikora
Journal of Computational Biology 27 (3), 302-316, 2020
162020
Twin-width I: tractable FO model checking
╔ Bonnet, EJ Kim, S ThomassÚ, R Watrigant
arXiv preprint arXiv:2004.14789, 2020
142020
Complexity of Grundy coloring and its variants
╔ Bonnet, F Foucaud, EJ Kim, F Sikora
Discrete Applied Mathematics 243, 99-114, 2018
142018
Time-approximation trade-offs for inapproximable problems
╔ Bonnet, M Lampis, VT Paschos
Journal of Computer and System Sciences 92, 171-180, 2018
132018
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
122021
The PACE 2018 parameterized algorithms and computational experiments challenge: The third iteration
╔ Bonnet, F Sikora
IPEC 2018, 2018
122018
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
122015
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
╔ Bonnet, N Brettell, O Kwon, D Marx
Algorithmica 81 (10), 3890-3935, 2019
112019
Fixed-parameter approximability of Boolean MinCSPs
╔ Bonnet, L Egri, B Lin, D Marx
arXiv preprint arXiv:1601.04935, 2016
112016
QPTAS and subexponential algorithm for maximum clique on disk graphs
╔ Bonnet, P Giannopoulos, EJ Kim, P Rzążewski, F Sikora
arXiv preprint arXiv:1712.05010, 2017
102017
On the complexity of connection games
╔ Bonnet, F Jamain, A Saffidine
Theoretical Computer Science 644, 2-28, 2016
102016
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
92021
Parameterized complexity of independent set in H-free graphs
╔ Bonnet, N Bousquet, P Charbit, S ThomassÚ, R Watrigant
Algorithmica 82 (8), 2360-2394, 2020
82020
The system can't perform the operation now. Try again later.
Articles 1–20