Édouard Bonnet
Édouard Bonnet
ENS Lyon, LIP, France
Verified email at ens-lyon.fr - Homepage
Cited by
Cited by
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
Parameterized hardness of art gallery problems
É Bonnet, T Miltzow
ACM Transactions on Algorithms (TALG) 16 (4), 1-23, 2020
An approximation algorithm for the art gallery problem
É Bonnet, T Miltzow
arXiv preprint arXiv:1607.05527, 2016
On the Complexity of Trick-Taking Card Games.
É Bonnet, F Jamain, A Saffidine
IJCAI, 482-488, 2013
Complexity of Grundy coloring and its variants
É Bonnet, F Foucaud, EJ Kim, F Sikora
Discrete Applied Mathematics 243, 99-114, 2018
The graph motif problem parameterized by the structure of the input graph
É Bonnet, F Sikora
Discrete Applied Mathematics 231, 78-94, 2017
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
Fixed-parameter approximability of Boolean MinCSPs
É Bonnet, L Egri, B Lin, D Marx
arXiv preprint arXiv:1601.04935, 2016
Time-approximation trade-offs for inapproximable problems
É Bonnet, M Lampis, VT Paschos
Journal of Computer and System Sciences 92, 171-180, 2018
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
On the complexity of connection games
É Bonnet, F Jamain, A Saffidine
Theoretical Computer Science 644, 2-28, 2016
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
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
On the parameterized complexity of red-blue points separation
É Bonnet, P Giannopoulos, M Lampis
arXiv preprint arXiv:1710.00637, 2017
Optimality program in segment and string graphs
É Bonnet, P Rzążewski
Algorithmica 81 (7), 3047-3073, 2019
EPTAS for max clique on disks and unit balls
M Bonamy, E Bonnet, N Bousquet, P Charbit, S Thomassé
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
Sparsification and subexponential approximation
É Bonnet, VT Paschos
Acta Informatica 55 (1), 1-15, 2018
Fine-grained complexity of coloring unit disks and balls
C Biró, É Bonnet, D Marx, T Miltzow, P Rzążewski
The system can't perform the operation now. Try again later.
Articles 1–20