╔douard Bonnet
╔douard Bonnet
ENS Lyon, LIP, France
Geverifieerd e-mailadres voor ens-lyon.fr - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
On subexponential and FPT-time inapproximability
E Bonnet, B Escoffier, EJ Kim, VT Paschos
Algorithmica 71 (3), 541-565, 2015
322015
Complexity of token swapping and its variants
╔ Bonnet, T Miltzow, P Rzążewski
Algorithmica 80 (9), 2656-2682, 2018
302018
Parameterized hardness of art gallery problems
╔ Bonnet, T Miltzow
ACM Transactions on Algorithms (TALG) 16 (4), 1-23, 2020
232020
An approximation algorithm for the art gallery problem
╔ Bonnet, T Miltzow
arXiv preprint arXiv:1607.05527, 2016
202016
On the Complexity of Trick-Taking Card Games.
╔ Bonnet, F Jamain, A Saffidine
IJCAI, 482-488, 2013
172013
Designing RNA secondary structures is hard
╔ Bonnet, P Rzążewski, F Sikora
Journal of Computational Biology 27 (3), 302-316, 2020
152020
Complexity of Grundy coloring and its variants
╔ Bonnet, F Foucaud, EJ Kim, F Sikora
Discrete Applied Mathematics 243, 99-114, 2018
142018
The graph motif problem parameterized by the structure of the input graph
╔ Bonnet, F Sikora
Discrete Applied Mathematics 231, 78-94, 2017
142017
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
142016
Fixed-parameter approximability of Boolean MinCSPs
╔ Bonnet, L Egri, B Lin, D Marx
arXiv preprint arXiv:1601.04935, 2016
112016
Time-approximation trade-offs for inapproximable problems
╔ Bonnet, M Lampis, VT Paschos
Journal of Computer and System Sciences 92, 171-180, 2018
102018
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
92016
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
92015
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
82019
The PACE 2018 parameterized algorithms and computational experiments challenge: The third iteration
╔ Bonnet, F Sikora
82018
On the parameterized complexity of red-blue points separation
╔ Bonnet, P Giannopoulos, M Lampis
arXiv preprint arXiv:1710.00637, 2017
8*2017
Twin-width I: tractable FO model checking
╔ Bonnet, EJ Kim, S ThomassÚ, R Watrigant
arXiv preprint arXiv:2004.14789, 2020
72020
Optimality program in segment and string graphs
╔ Bonnet, P Rzążewski
Algorithmica 81 (7), 3047-3073, 2019
72019
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
72018
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20