| Bounded twin-width graphs are polynomially -bounded R Bourneuf, S Thomassé arXiv preprint arXiv:2303.11231, 2023 | 6 | 2023 |
| On polynomial degree-boundedness R Bourneuf, M Bucić, L Cook, J Davies arXiv preprint arXiv:2311.03341, 2023 | 3 | 2023 |
| A tamed family of triangle-free graphs with unbounded chromatic number É Bonnet, R Bourneuf, J Duron, C Geniet, S Thomassé, N Trotignon arXiv preprint arXiv:2304.04296, 2023 | 3 | 2023 |
| PPP-completeness and extremal combinatorics R Bourneuf, L Folwarczný, P Hubáček, A Rosen, NI Schwartzbach arXiv preprint arXiv:2209.04827, 2022 | 3 | 2022 |
| Factoring Pattern-Free Permutations into Separable ones É Bonnet, R Bourneuf, C Geniet, S Thomassé Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 1 | 2024 |
| M2 Internship: On the chromatic number of graphs of bounded twin-width R Bourneuf, S Thomassé | | |
