| 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 | 103 | 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 | 58 | 2021 |
| Complexity of token swapping and its variants É Bonnet, T Miltzow, P Rzążewski Algorithmica 80, 2656-2682, 2018 | 47 | 2018 |
| On subexponential and FPT-time inapproximability E Bonnet, B Escoffier, EJ Kim, VT Paschos Algorithmica 71, 541-565, 2015 | 46 | 2015 |
| 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 | 38 | 2020 |
| An approximation algorithm for the art gallery problem É Bonnet, T Miltzow arXiv preprint arXiv:1607.05527, 2016 | 37 | 2016 |
| 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 | 34 | 2022 |
| The Parameterized Hardness of Art Gallery Problems É Bonnet, T Miltzow arXiv preprint arXiv:1603.08116, 2016 | 34* | 2016 |
| Twin-width and permutations É Bonnet, J Nešetřil, PO de Mendez, S Siebertz, S Thomassé arXiv preprint arXiv:2102.06880, 2021 | 28 | 2021 |
| The PACE 2018 parameterized algorithms and computational experiments challenge: The third iteration É Bonnet, F Sikora IPEC 2018, 2018 | 27 | 2018 |
| Designing RNA secondary structures is hard É Bonnet, P Rzążewski, F Sikora Journal of Computational Biology 27 (3), 302-316, 2020 | 26 | 2020 |
| Parameterized exact and approximation algorithms for maximum -set cover and related satisfiability problems É Bonnet, VT Paschos, F Sikora RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2016 | 23 | 2016 |
| Parameterized complexity of independent set in H-free graphs É Bonnet, N Bousquet, P Charbit, S Thomassé, R Watrigant Algorithmica 82 (8), 2360-2394, 2020 | 22 | 2020 |
| The graph motif problem parameterized by the structure of the input graph É Bonnet, F Sikora Discrete Applied Mathematics 231, 78-94, 2017 | 21 | 2017 |
| On the Complexity of Trick-Taking Card Games. É Bonnet, F Jamain, A Saffidine IJCAI, 482-488, 2013 | 21 | 2013 |
| 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 | 20 | 2022 |
| Twin-width and polynomial kernels É Bonnet, EJ Kim, A Reinald, S Thomassé, R Watrigant Algorithmica 84 (11), 3300-3337, 2022 | 19 | 2022 |
| Time-approximation trade-offs for inapproximable problems É Bonnet, M Lampis, VT Paschos Journal of Computer and System Sciences 92, 171-180, 2018 | 19 | 2018 |
| 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 | 18 | 2021 |
| Complexity of Grundy coloring and its variants É Bonnet, F Foucaud, EJ Kim, F Sikora Discrete Applied Mathematics 243, 99-114, 2018 | 18 | 2018 |
Eun Jung KimLAMSADEVerified email at dauphine.fr
