Stéphan Thomassé
Stéphan Thomassé
Verified email at
Cited by
Cited by
Kernel bounds for disjoint cycles and disjoint paths
HL Bodlaender, S Thomassé, A Yeo
Theoretical Computer Science 412 (35), 4570-4578, 2011
A 4k2 kernel for feedback vertex set
S Thomassé
ACM Transactions on Algorithms (TALG) 6 (2), 1-8, 2010
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
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
Total domination of graphs and small transversals of hypergraphs
S Thomassé, A Yeo
Combinatorica 27, 473-487, 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
Multicut is FPT
N Bousquet, J Daligault, S Thomassé
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
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
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
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
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
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
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
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
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
On finding directed trees with many leaves
J Daligault, S Thomassé
International Workshop on Parameterized and Exact Computation, 86-97, 2009
A linear vertex kernel for maximum internal spanning tree
FV Fomin, S Gaspers, S Saurabh, S Thomassé
Journal of Computer and System Sciences 79 (1), 1-6, 2013
Submodular partition functions
O Amini, F Mazoit, N Nisse, S Thomassé
Discrete Mathematics 309 (20), 6000-6008, 2009
Analysis of data reduction: Transformations give evidence for non-existence of polynomial kernels
HL Bodlaender, S Thomassé, A Yeo
Technical Report UU-CS-2008-030, 2008
Density conditions for triangles in multipartite graphs
A Bondy, J Shen, S Thomassé, C Thomassen
Combinatorica 26, 121-131, 2006
The system can't perform the operation now. Try again later.
Articles 1–20