| Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo Theoretical Computer Science 412 (35), 4570-4578, 2011 | 303 | 2011 |
| A 4k2 kernel for feedback vertex set S Thomassé ACM Transactions on Algorithms (TALG) 6 (2), 1-8, 2010 | 278 | 2010 |
| 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 | 214 | 2021 |
| The minimum feedback arc set problem is NP-hard for tournaments P Charbit, S Thomassé, A Yeo Combinatorics, Probability and Computing 16 (1), 1-4, 2007 | 194 | 2007 |
| The domination number of grids D Gonçalves, A Pinlou, M Rao, S Thomassé SIAM Journal on Discrete Mathematics 25 (3), 1443-1453, 2011 | 158 | 2011 |
| Total domination of graphs and small transversals of hypergraphs S Thomassé, A Yeo Combinatorica 27, 473-487, 2007 | 150 | 2007 |
| 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 | 127 | 2021 |
| Multicut is FPT N Bousquet, J Daligault, S Thomassé Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 122 | 2011 |
| 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 | 108* | 2024 |
| Median orders of tournaments: a tool for the second neighborhood problem and Sumner's conjecture F Havet, S Thomassé Journal of Graph Theory 35 (4), 244-256, 2000 | 107 | 2000 |
| 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 | 103* | 2024 |
| Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture S Bessy, S Thomassé Journal of Combinatorial Theory, Series B 100 (2), 176-180, 2010 | 89 | 2010 |
| Tournaments and colouring E Berger, K Choromanski, M Chudnovsky, J Fox, M Loebl, A Scott, ... Journal of Combinatorial Theory, Series B 103 (1), 1-20, 2013 | 79 | 2013 |
| Kernels for feedback arc set in tournaments S Bessy, FV Fomin, S Gaspers, C Paul, A Perez, S Saurabh, S Thomassé Journal of Computer and System Sciences 77 (6), 1071-1078, 2011 | 76 | 2011 |
| Oriented Hamiltonian paths in tournaments: a proof of Rosenfeld's conjecture F Havet, S Thomasse Journal of Combinatorial Theory, Series B 78 (2), 243-273, 2000 | 72 | 2000 |
| Submodular partition functions O Amini, F Mazoit, N Nisse, S Thomassé Discrete Mathematics 309 (20), 6000-6008, 2009 | 64 | 2009 |
| Twin-width and permutations É Bonnet, J Nešetřil, PO de Mendez, S Siebertz, S Thomassé Logical Methods in Computer Science 20, 2024 | 56 | 2024 |
| Oriented trees in digraphs L Addario-Berry, F Havet, CL Sales, B Reed, S Thomassé Discrete Mathematics 313 (8), 967-974, 2013 | 55 | 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 | 54 | 2022 |
| Dense triangle-free graphs are four-colorable: A solution to the Erdos-Simonovits problem S Brandt, S Thomassé preprint, 172, 2011 | 54 | 2011 |
