| 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 | 226 | 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 | 132 | 2021 |
| Twin-width IV: ordered graphs and matrices É Bonnet, U Giocanti, PO de Mendez, P Simon, S Thomassé, S Toruńczyk Journal of the ACM 71 (3), 1-45, 2024 | 102 | 2024 |
| Twin-width III: max independent set, min dominating set, and coloring É Bonnet, C Geniet, EJ Kim, S Thomassé, R Watrigant SIAM Journal on Computing 53 (5), 1602-1640, 2024 | 99 | 2024 |
| Complexity of token swapping and its variants É Bonnet, T Miltzow, P Rzążewski Algorithmica 80, 2656-2682, 2018 | 66 | 2018 |
| Twin-width and permutations É Bonnet, J Nešetřil, PO de Mendez, S Siebertz, S Thomassé Logical Methods in Computer Science 20, 2024 | 58 | 2024 |
| 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 | 56 | 2022 |
| Twin-width and polynomial kernels É Bonnet, EJ Kim, A Reinald, S Thomassé, R Watrigant Algorithmica 84 (11), 3300-3337, 2022 | 55 | 2022 |
| Deciding twin-width at most 4 is NP-complete P Bergé, É Bonnet, H Déprés arXiv preprint arXiv:2112.08953, 2021 | 54 | 2021 |
| Designing RNA secondary structures is hard É Bonnet, P Rzążewski, F Sikora Journal of Computational Biology 27 (3), 302-316, 2020 | 54 | 2020 |
| On subexponential and FPT-time inapproximability E Bonnet, B Escoffier, EJ Kim, VT Paschos Algorithmica 71, 541-565, 2015 | 51 | 2015 |
| The Parameterized Hardness of Art Gallery Problems É Bonnet, T Miltzow arXiv preprint arXiv:1603.08116, 2016 | 44* | 2016 |
| An approximation algorithm for the art gallery problem É Bonnet, T Miltzow arXiv preprint arXiv:1607.05527, 2016 | 43 | 2016 |
| Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond) É Bonnet, O Kwon, DR Wood arXiv preprint arXiv:2202.11858, 2022 | 41 | 2022 |
| Sparse graphs with bounded induced cycle packing number have logarithmic treewidth M Bonamy, É Bonnet, H Déprés, L Esperet, C Geniet, C Hilaire, ... Journal of Combinatorial Theory, Series B 167, 215-249, 2024 | 39 | 2024 |
| Twin-width VIII: delineation and win-wins É Bonnet, D Chakraborty, EJ Kim, N Köhler, R Lopes, S Thomassé arXiv preprint arXiv:2204.00722, 2022 | 37 | 2022 |
| The PACE 2018 parameterized algorithms and computational experiments challenge: The third iteration É Bonnet, F Sikora IPEC 2018, 2018 | 36 | 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 | 34 | 2021 |
| The graph motif problem parameterized by the structure of the input graph É Bonnet, F Sikora Discrete Applied Mathematics 231, 78-94, 2017 | 31 | 2017 |
| EPTAS and subexponential algorithm for maximum clique on disk and unit ball graphs M Bonamy, É Bonnet, N Bousquet, P Charbit, P Giannopoulos, EJ Kim, ... Journal of the ACM (JACM) 68 (2), 1-38, 2021 | 29 | 2021 |
Eun Jung KimKAIST, CNRSПотвърден имейл адрес: kaist.ac.kr
