Indivisibility and Alpha-morphisms. - Stéphan Thomassé (Eur. J. Comb., 1997)

2-Partition-Transitive Tournaments. - Barry Guiduli; András Gyárfás; Stéphan Thomassé; Peter Weidl (J. Comb. Theory B, 1998)

Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture. - Frédéric Havet; Stéphan Thomassé (J. Comb. Theory B, 2000)

Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture. - Frédéric Havet; Stéphan Thomassé (J. Graph Theory, 2000)

Countable alpha-extendable graphs. - Jean-Luc Rullière; Stéphan Thomassé (Discret. Math., 2001)

Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas' Conjecture. - Stéphan Thomassé (J. Comb. Theory B, 2001)

Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1. - Anthony Bonato; Peter J. Cameron; Dejan Delic; Stéphan Thomassé (Eur. J. Comb., 2002)

Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. - Jørgen Bang-Jensen; Stéphan Thomassé (Discret. Appl. Math., 2003)

Every strong digraph has a spanning strong subgraph with at most n+2 alpha-2 arcs. - Stéphane Bessy; Stéphan Thomassé (J. Comb. Theory B, 2003)

Small degree out-branchings. - Jørgen Bang-Jensen; Stéphan Thomassé; Anders Yeo (J. Graph Theory, 2003)

Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. - Stéphane Bessy; Stéphan Thomassé (IPCO, 2004)

The C3-structure of the tournaments. - Abderrahim Boussaïri; Pierre Ille; Gérard Lopez; Stéphan Thomassé (Discret. Math., 2004)

The categorical product of two 5-chromatic digraphs can be 3-chromatic. - Stéphane Bessy; Stéphan Thomassé (Discret. Math., 2005)

Preface. - Gena Hahn; Pierre Ille; Stéphan Thomassé (Discret. Math., 2005)

Density Conditions For Triangles In Multipartite Graphs. - J. Adrian Bondy; Jian Shen; Stéphan Thomassé; Carsten Thomassen (Comb., 2006)

Spanning a strong digraph by alpha circuits: A proof of Gallai's conjecture. - Stéphane Bessy; Stéphan Thomassé (Comb., 2007)

Total domination of graphs and small transversals of hypergraphs. - Stéphan Thomassé; Anders Yeo (Comb., 2007)

Graphs with Large Girth Not Embeddable in the Sphere. - Pierre Charbit; Stéphan Thomassé (Comb. Probab. Comput., 2007)

The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. - Pierre Charbit; Stéphan Thomassé; Anders Yeo (Comb. Probab. Comput., 2007)

Paths with two blocks in n-chromatic digraphs. - Louigi Addario-Berry; Frédéric Havet; Stéphan Thomassé (J. Comb. Theory B, 2007)

Guarding Art Galleries: The Extra Cost for Sculptures Is Linear. - Louigi Addario-Berry; Omid Amini; Jean-Sébastien Sereni; Stéphan Thomassé (SWAT, 2008)

Hoàng-Reed conjecture holds for tournaments. - Frédéric Havet; Stéphan Thomassé; Anders Yeo (Discret. Math., 2008)

Finding a vector orthogonal to roughly half a collection of vectors. - Pierre Charbit; Emmanuel Jeandel; Pascal Koiran; Sylvain Perifel; Stéphan Thomassé (J. Complex., 2008)

On Finding Directed Trees with Many Leaves. - Jean Daligault; Stéphan Thomassé (IWPEC, 2009)

A quadratic kernel for feedback vertex set. - Stéphan Thomassé (SODA, 2009)

A Polynomial Kernel for Multicut in Trees. - Nicolas Bousquet 001; Jean Daligault; Stéphan Thomassé; Anders Yeo (STACS, 2009)

Complexity of (p, 1)-total labelling. - Frédéric Havet; Stéphan Thomassé (Discret. Appl. Math., 2009)

Submodular partition functions. - Omid Amini; Frédéric Mazoit; Nicolas Nisse; Stéphan Thomassé (Discret. Math., 2009)

Edge Growth in Graph Cubes - Matt DeVos; Stéphan Thomassé (CoRR, 2010)

WDM and Directed Star Arboricity. - Omid Amini; Frédéric Havet; Florian Huc; Stéphan Thomassé (Comb. Probab. Comput., 2010)

Partitions versus sets: A case of duality. - Laurent Lyaudet; Frédéric Mazoit; Stéphan Thomassé (Eur. J. Comb., 2010)

Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture. - Stéphane Bessy; Stéphan Thomassé (J. Comb. Theory B, 2010)

Well-Quasi-Order of Relabel Functions. - Jean Daligault; Michaël Rao; Stéphan Thomassé (Order, 2010)

A 4k2 kernel for feedback vertex set. - Stéphan Thomassé (ACM Trans. Algorithms, 2010)

Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. - Robert Crowston; Michael R. Fellows; Gregory Z. Gutin; Mark Jones 001; Frances A. Rosamond; Stéphan Thomassé; Anders Yeo (FSTTCS, 2011)

Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. - Christophe Paul; Anthony Perez 001; Stéphan Thomassé (MFCS, 2011)

Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems - Christophe Paul; Anthony Perez 001; Stéphan Thomassé (CoRR, 2011)

Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem. - Flavio Guiñez; Martín Matamala; Stéphan Thomassé (Discret. Appl. Math., 2011)

Kernels for feedback arc set in tournaments. - Stéphane Bessy; Fedor V. Fomin; Serge Gaspers; Christophe Paul; Anthony Perez 001; Saket Saurabh 001; Stéphan Thomassé (J. Comput. Syst. Sci., 2011)

The Domination Number of Grids. - Daniel Gonçalves 001; Alexandre Pinlou; Michaël Rao; Stéphan Thomassé (SIAM J. Discret. Math., 2011)

Kernel bounds for disjoint cycles and disjoint paths. - Hans L. Bodlaender; Stéphan Thomassé; Anders Yeo (Theor. Comput. Sci., 2011)

Symmetric Determinantal Representations in Characteristic 2 - Bruno Grenet; Thierry Monteil 002; Stéphan Thomassé (CoRR, 2012)

Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. - Nicolas Bousquet 001; Stéphan Thomassé (Comb. Probab. Comput., 2012)

On spanning galaxies in digraphs. - Daniel Gonçalves 001; Frédéric Havet; Alexandre Pinlou; Stéphan Thomassé (Discret. Appl. Math., 2012)

A stability theorem on fractional covering of triangles by edges. - Penny E. Haxell; Alexandr V. Kostochka; Stéphan Thomassé (Eur. J. Comb., 2012)

Packing and Covering Triangles in K 4-free Planar Graphs. - Penny E. Haxell; Alexandr V. Kostochka; Stéphan Thomassé (Graphs Comb., 2012)

Cyclic orderings and cyclic arboricity of matroids. - Jan van den Heuvel; Stéphan Thomassé (J. Comb. Theory B, 2012)

Graph coloring, communication complexity and the stubborn problem (Invited talk). - Nicolas Bousquet 001; Aurélie Lagoutte; Stéphan Thomassé (STACS, 2013)

A tau-conjecture for Newton polygons. - Pascal Koiran; Natacha Portier; Sébastien Tavenas; Stéphan Thomassé (CoRR, 2013)

Parameterized algorithm for weighted independent set problem in bull-free graphs. - Stéphan Thomassé; Nicolas Trotignon; Kristina Vuskovic (CoRR, 2013)

Oriented trees in digraphs. - Louigi Addario-Berry; Frédéric Havet; Cláudia Linhares Sales; Bruce A. Reed; Stéphan Thomassé (Discret. Math., 2013)

A linear vertex kernel for maximum internal spanning tree. - Fedor V. Fomin; Serge Gaspers; Saket Saurabh 001; Stéphan Thomassé (J. Comput. Syst. Sci., 2013)

Tournaments and colouring. - Eli Berger; Krzysztof Choromanski; Maria Chudnovsky; Jacob Fox; Martin Loebl; Alex Scott 001; Paul D. Seymour; Stéphan Thomassé (J. Comb. Theory B, 2013)

A counterexample to a conjecture of Schwartz. - Felix Brandt 001; Maria Chudnovsky; Ilhee Kim; Gaku Liu; Sergey Norin; Alex Scott 001; Paul D. Seymour; Stéphan Thomassé (Soc. Choice Welf., 2013)

A Note on the Minimum Distance of Quantum LDPC Codes. - Nicolas Delfosse; Zhentao Li; Stéphan Thomassé (MFCS (2), 2014)

The Erdős-Hajnal Conjecture for Long Holes and Anti-holes. - Marthe Bonamy; Nicolas Bousquet 001; Stéphan Thomassé (CoRR, 2014)

Graphs with large chromatic number induce $3k$-cycles. - Marthe Bonamy; Pierre Charbit; Stéphan Thomassé (CoRR, 2014)

Clique versus independent set. - Nicolas Bousquet 001; Aurélie Lagoutte; Stéphan Thomassé (Eur. J. Comb., 2014)

Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. - Robert Crowston; Michael R. Fellows; Gregory Z. Gutin; Mark Jones 001; Eun Jung Kim 002; Fran Rosamond; Imre Z. Ruzsa; Stéphan Thomassé; Anders Yeo (J. Comput. Syst. Sci., 2014)

Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. - Jørgen Bang-Jensen; Stéphane Bessy; Stéphan Thomassé (J. Graph Theory, 2014)

Parameterized Domination in Circle Graphs. - Nicolas Bousquet 001; Daniel Gonçalves 001; George B. Mertzios; Christophe Paul; Ignasi Sau; Stéphan Thomassé (Theory Comput. Syst., 2014)

Hitting and Harvesting Pumpkins. - Gwenaël Joret; Christophe Paul; Ignasi Sau; Saket Saurabh 001; Stéphan Thomassé (SIAM J. Discret. Math., 2014)

VC-dimension and Erdős-Pósa property. - Nicolas Bousquet 001; Stéphan Thomassé (Discret. Math., 2015)

Excluding clocks. - Pierre Aboulker; Zhentao Li; Stéphan Thomassé (Electron. Notes Discret. Math., 2015)

A $$ tau $$ τ -Conjecture for Newton Polygons. - Pascal Koiran; Natacha Portier; Sébastien Tavenas; Stéphan Thomassé (Found. Comput. Math., 2015)

The Erdős-Hajnal conjecture for paths and antipaths. - Nicolas Bousquet 001; Aurélie Lagoutte; Stéphan Thomassé (J. Comb. Theory B, 2015)

Identifying Codes in Hereditary Classes of Graphs and VC-Dimension. - Nicolas Bousquet 001; Aurélie Lagoutte; Zhentao Li; Aline Parreau; Stéphan Thomassé (SIAM J. Discret. Math., 2015)

Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique. - Christophe Paul; Anthony Perez 001; Stéphan Thomassé (J. Comput. Syst. Sci., 2016)

Perfect graphs of arbitrarily large clique-chromatic number. - Pierre Charbit; Irena Penev; Stéphan Thomassé; Nicolas Trotignon (J. Comb. Theory B, 2016)

The Erdös-Hajnal Conjecture for Long Holes and Antiholes. - Marthe Bonamy; Nicolas Bousquet 001; Stéphan Thomassé (SIAM J. Discret. Math., 2016)

Isolating Highly Connected Induced Subgraphs. - Irena Penev; Stéphan Thomassé; Nicolas Trotignon (SIAM J. Discret. Math., 2016)

On the Complexity of Partial Derivatives. - Ignacio García-Marco; Pascal Koiran; Timothée Pecatte; Stéphan Thomassé (STACS, 2017)

A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. - Stéphan Thomassé; Nicolas Trotignon; Kristina Vuskovic (Algorithmica, 2017)

Additive bases and flows in graphs. - Louis Esperet; Rémi de Joannis de Verclos; Tien-Nam Le; Stéphan Thomassé (Electron. Notes Discret. Math., 2017)

Coloring dense digraphs. - Ararat Harutyunyan; Tien-Nam Le; Alantha Newman; Stéphan Thomassé (Electron. Notes Discret. Math., 2017)

Decomposing graphs into paths and trees. - Tereza Klimosová; Stéphan Thomassé (Electron. Notes Discret. Math., 2017)

A proof of the Barát-Thomassen conjecture. - Julien Bensmail; Ararat Harutyunyan; Tien-Nam Le; Martin Merker; Stéphan Thomassé (J. Comb. Theory B, 2017)

EPTAS for Max Clique on Disks and Unit Balls. - Marthe Bonamy; Edouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Stéphan Thomassé (FOCS, 2018)

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. - Tien-Nam Le; Daniel Lokshtanov; Saket Saurabh 001; Stéphan Thomassé; Meirav Zehavi (SODA, 2018)

Domination and Fractional Domination in Digraphs. - Ararat Harutyunyan; Tien-Nam Le; Alantha Newman; Stéphan Thomassé (Electron. J. Comb., 2018)

Domination in tournaments. - Maria Chudnovsky; Ringi Kim; Chun-Hung Liu; Paul D. Seymour; Stéphan Thomassé (J. Comb. Theory B, 2018)

Multicut Is FPT. - Nicolas Bousquet 001; Jean Daligault; Stéphan Thomassé (SIAM J. Comput., 2018)

When Maximum Stable Set Can Be Solved in FPT Time. - Édouard Bonnet; Nicolas Bousquet 001; Stéphan Thomassé; Rémi Watrigant (ISAAC, 2019)

The Independent Set Problem Is FPT for Even-Hole-Free Graphs. - Edin Husic; Stéphan Thomassé; Nicolas Trotignon (IPEC, 2019)

Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture. - Julien Bensmail; Ararat Harutyunyan; Tien-Nam Le; Stéphan Thomassé (Comb., 2019)

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. - Pierre Aboulker; Nathann Cohen; Frédéric Havet; William Lochet; Phablo F. S. Moura; Stéphan Thomassé (Electron. J. Comb., 2019)

Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. - Maria Chudnovsky; Marcin Pilipczuk; Michal Pilipczuk; Stéphan Thomassé (CoRR, 2019)

Maximum independent sets in (pyramid, even hole)-free graphs. - Maria Chudnovsky; Stéphan Thomassé; Nicolas Trotignon; Kristina Vuskovic (CoRR, 2019)

Separation Choosability and Dense Bipartite Induced Subgraphs. - Louis Esperet; Ross J. Kang; Stéphan Thomassé (Comb. Probab. Comput., 2019)

A proof of the Erdős-Sands-Sauer-Woodrow conjecture. - Nicolas Bousquet 001; William Lochet; Stéphan Thomassé (J. Comb. Theory B, 2019)

Coloring tournaments: From local to global. - Ararat Harutyunyan; Tien-Nam Le; Stéphan Thomassé; Hehui Wu (J. Comb. Theory B, 2019)

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. - Fedor V. Fomin; Tien-Nam Le; Daniel Lokshtanov; Saket Saurabh 001; Stéphan Thomassé; Meirav Zehavi (ACM Trans. Algorithms, 2019)

Testing Balanced Splitting Cycles in Complete Triangulations. - Vincent Despré; Michaël Rao; Stéphan Thomassé (CCCG, 2020)

An Algorithmic Weakening of the Erdős-Hajnal Conjecture. - Édouard Bonnet; Stéphan Thomassé; Xuan Thang Tran; Rémi Watrigant (ESA, 2020)

Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. - Maria Chudnovsky; Marcin Pilipczuk; Michal Pilipczuk; Stéphan Thomassé (SODA, 2020)

Parameterized Complexity of Independent Set in H-Free Graphs. - Édouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Stéphan Thomassé; Rémi Watrigant (Algorithmica, 2020)

Twin-width III: Max Independent Set and Coloring. - Édouard Bonnet; Colin Geniet; Eun Jung Kim 002; Stéphan Thomassé; Rémi Watrigant (CoRR, 2020)

On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five. - Maria Chudnovsky; Marcin Pilipczuk; Michal Pilipczuk; Stéphan Thomassé (SIAM J. Discret. Math., 2020)

Convexly independent subsets of Minkowski sums of convex polygons. - Mateusz Skomra; Stéphan Thomassé (Discret. Math., 2021)

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. - Marthe Bonamy; Édouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora; Stéphan Thomassé (J. ACM, 2021)

Disproving the normal graph conjecture. - Ararat Harutyunyan; Lucas Pastor; Stéphan Thomassé (J. Comb. Theory B, 2021)

Edge-decomposing graphs into coprime forests. - Tereza Klimosová; Stéphan Thomassé (J. Graph Theory, 2021)

(Theta, triangle)-free and (even hole, K4)-free graphs. Part 2: Bounds on treewidth. - Marcin Pilipczuk; Ni Luh Dewi Sintiari; Stéphan Thomassé; Nicolas Trotignon (J. Graph Theory, 2021)

A Brief Tour in Twin-Width (Invited Talk). - Stéphan Thomassé (ICALP, 2022)

Twin-Width VIII: Delineation and Win-Wins. - Édouard Bonnet; Dibyayan Chakraborty; Eun Jung Kim 002; Noleen Köhler; Raul Lopes 001; Stéphan Thomassé (IPEC, 2022)

Twin-width VI: the lens of contraction sequences. - Édouard Bonnet; Eun Jung Kim 002; Amadeus Reinald; Stéphan Thomassé (SODA, 2022)

Twin-width and Polynomial Kernels. - Édouard Bonnet; Eun Jung Kim 002; Amadeus Reinald; Stéphan Thomassé; Rémi Watrigant (Algorithmica, 2022)

Twin-width II: small classes. - Édouard Bonnet; Colin Geniet; Eun Jung Kim 002; Stéphan Thomassé; Rémi Watrigant (Comb. Theory, 2022)

Twin-width VII: groups. - Édouard Bonnet; Colin Geniet; Romain Tessera; Stéphan Thomassé (CoRR, 2022)

First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs. - Colin Geniet; Stéphan Thomassé (CoRR, 2022)

(P6, triangle)-free digraphs have bounded dichromatic number. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit; Stéphan Thomassé (CoRR, 2022)

Twin-width I: Tractable FO Model Checking. - Édouard Bonnet; Eun Jung Kim 002; Stéphan Thomassé; Rémi Watrigant (J. ACM, 2022)

Graphs with polynomially many minimal separators. - Tara Abrishami; Maria Chudnovsky; Cemil Dibek; Stéphan Thomassé; Nicolas Trotignon; Kristina Vuskovic (J. Comb. Theory B, 2022)

Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs. - Marthe Bonamy; Nicolas Bousquet 001; Michal Pilipczuk; Pawel Rzazewski; Stéphan Thomassé; Bartosz Walczak (J. Comb. Theory B, 2022)

Edge-partitioning 3-edge-connected graphs into paths. - Tereza Klimosová; Stéphan Thomassé (J. Comb. Theory B, 2022)

Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄. - Édouard Bonnet; Julien Duron; Colin Geniet; Stéphan Thomassé; Alexandra Wesolek (ESA, 2023)

Lossy Kernelization for (Implicit) Hitting Set Problems. - Fedor V. Fomin; Tien-Nam Le; Daniel Lokshtanov; Saket Saurabh 001; Stéphan Thomassé; Meirav Zehavi (ESA, 2023)

First Order Logic and Twin-Width in Tournaments. - Colin Geniet; Stéphan Thomassé (ESA, 2023)

Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication. - Édouard Bonnet; Ugo Giocanti; Patrice Ossona de Mendez; Stéphan Thomassé (STACS, 2023)

Extremal Independent Set Reconfiguration. - Nicolas Bousquet 001; Bastien Durain; Théo Pierron; Stéphan Thomassé (Electron. J. Comb., 2023)

Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4. - Édouard Bonnet; Julien Duron; Colin Geniet; Stéphan Thomassé; Alexandra Wesolek (CoRR, 2023)

Bounded twin-width graphs are polynomially χ-bounded. - Romain Bourneuf; Stéphan Thomassé (CoRR, 2023)

Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems. - Maxime Cautrès; Nathan Claudet; Mehdi Mhalla; Simon Perdrix; Valentin Savin; Stéphan Thomassé (ICALP, 2024)

Factoring Pattern-Free Permutations into Separable ones. - Edouard Bonnet; Romain Bourneuf; Colin Geniet; Stéphan Thomassé (SODA, 2024)

Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. - Stéphane Bessy; Stéphan Thomassé; Laurent Viennot (STACS, 2024)

($ overrightarrow{P_6}$, triangle)-Free Digraphs Have Bounded Dichromatic Number. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit; Stéphan Thomassé (Electron. J. Comb., 2024)

Dichromatic Number and Cycle Inversions. - Pierre Charbit; Stéphan Thomassé (CoRR, 2024)

Graphs without a 3-connected subgraph are 4-colorable. - Édouard Bonnet; Carl Feghali; Stéphan Thomassé; Nicolas Trotignon (CoRR, 2024)

A structural description of Zykov and Blanche Descartes graphs. - Malory Marin; Stéphan Thomassé; Nicolas Trotignon; Rémi Watrigant (CoRR, 2024)

A quasi-quadratic vertex-kernel for Cograph Edge Editing. - Christophe Crespelle; Rémi Pellerin; Stéphan Thomassé (Discret. Appl. Math., 2024)

Clique covers of H-free graphs. - Tung Nguyen 004; Alexander Scott 001; Paul D. Seymour; Stéphan Thomassé (Eur. J. Comb., 2024)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. - Marthe Bonamy; Édouard Bonnet; Hugues Déprés; Louis Esperet; Colin Geniet; Claire Hilaire; Stéphan Thomassé; Alexandra Wesolek (J. Comb. Theory B, 2024)

Twin-width and permutations. - Édouard Bonnet; Jaroslav Nesetril; Patrice Ossona de Mendez; Sebastian Siebertz; Stéphan Thomassé (Log. Methods Comput. Sci., 2024)

Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring. - Édouard Bonnet; Colin Geniet; Eun Jung Kim 002; Stéphan Thomassé; Rémi Watrigant (SIAM J. Comput., 2024)

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in ( boldsymbol{H} )-Free Graphs. - Maria Chudnovsky; Marcin Pilipczuk; Michal Pilipczuk; Stéphan Thomassé (SIAM J. Comput., 2024)

Twin-Width IV: Ordered Graphs and Matrices. - Édouard Bonnet; Ugo Giocanti; Patrice Ossona de Mendez; Pierre Simon; Stéphan Thomassé; Szymon Torunczyk (J. ACM, 2024)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors. - Romain Bourneuf; Julien Cocquet; Chaoliang Tang; Stéphan Thomassé (APPROX/RANDOM, 2025)

On the Complexity of Client-Waiter and Waiter-Client Games. - Valentin Gledel; Nacim Oijid; Sébastien Tavenas; Stéphan Thomassé (ICALP, 2025)

Graphs without a 3-Connected Subgraph are 4-Colourable. - Édouard Bonnet; Carl Feghali; Tung Nguyen 004; Alex Scott 001; Paul D. Seymour; Stéphan Thomassé; Nicolas Trotignon (Electron. J. Comb., 2025)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number. - Romain Bourneuf; Pierre Charbit; Stéphan Thomassé (CoRR, 2025)