Stéphan Thomassé

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 105

Top Venues

CoRR

J. Comb. Theory, Ser. B

SIAM J. Discret. Math.

SODA

Publications

Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé
Vertex-minor universal graphs for generating entangled quantum subsystems. CoRR (2024)
Edouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé
Factoring Pattern-Free Permutations into Separable ones. SODA (2024)
Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs. SIAM J. Comput. 53 (1) (2024)
Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. J. Comb. Theory B 167 (2024)
Stéphane Bessy, Stéphan Thomassé, Laurent Viennot
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. STACS (2024)
Pierre Charbit, Stéphan Thomassé
Dichromatic Number and Cycle Inversions. CoRR (2024)
Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé
Twin-width and permutations. Log. Methods Comput. Sci. 20 (3) (2024)
Tung Nguyen, Alexander Scott, Paul D. Seymour, Stéphan Thomassé
Clique covers of H-free graphs. Eur. J. Comb. 118 (2024)
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk
Twin-Width IV: Ordered Graphs and Matrices. J. ACM 71 (3) (2024)
Édouard Bonnet, Carl Feghali, Stéphan Thomassé, Nicolas Trotignon
Graphs without a 3-connected subgraph are 4-colorable. CoRR (2024)
Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé
Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems. ICALP (2024)
Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé
A quasi-quadratic vertex-kernel for Cograph Edge Editing. Discret. Appl. Math. 357 (2024)
Colin Geniet, Stéphan Thomassé
First Order Logic and Twin-Width in Tournaments. ESA (2023)
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé
Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication. STACS (2023)
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA (2023)
Édouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé
Factoring Pattern-Free Permutations into Separable ones. CoRR (2023)
Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé
Extremal Independent Set Reconfiguration. CoRR (2023)
Marthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. SODA (2023)
Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek
Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄. ESA (2023)
Stéphane Bessy, Stéphan Thomassé, Laurent Viennot
Temporalizing digraphs via linear-size balanced bi-trees. CoRR (2023)
Romain Bourneuf, Stéphan Thomassé
Bounded twin-width graphs are polynomially χ-bounded. CoRR (2023)
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR (2023)
Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek
. CoRR (2023)
Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé
Extremal Independent Set Reconfiguration. Electron. J. Comb. 30 (3) (2023)
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
Twin-width and Polynomial Kernels. Algorithmica 84 (11) (2022)
Stéphan Thomassé
A Brief Tour in Twin-Width (Invited Talk). ICALP (2022)
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk
Twin-width IV: ordered graphs and matrices. STOC (2022)
Tereza Klimosová, Stéphan Thomassé
Edge-partitioning 3-edge-connected graphs into paths. J. Comb. Theory, Ser. B 156 (2022)
Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
Graphs with polynomially many minimal separators. J. Comb. Theory, Ser. B 152 (2022)
Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé
(P6, triangle)-free digraphs have bounded dichromatic number. CoRR (2022)
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé
Twin-Width VIII: Delineation and Win-Wins. IPEC (2022)
Édouard Bonnet, Colin Geniet, Romain Tessera, Stéphan Thomassé
Twin-width VII: groups. CoRR (2022)
Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak
-free graphs with no large complete bipartite subgraphs. J. Comb. Theory, Ser. B 152 (2022)
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé
Twin-width V: linear minors, modular counting, and matrix multiplication. CoRR (2022)
Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé
A quasi-quadratic vertex Kernel for Cograph edge editing. CoRR (2022)
Colin Geniet, Stéphan Thomassé
First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs. CoRR (2022)
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé
Twin-width VIII: delineation and win-wins. CoRR (2022)
Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. CoRR (2022)
Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width I: Tractable FO Model Checking. J. ACM 69 (1) (2022)
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé
Twin-width VI: the lens of contraction sequences. SODA (2022)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR (2021)
Mateusz Skomra, Stéphan Thomassé
Convexly independent subsets of Minkowski sums of convex polygons. Discret. Math. 344 (8) (2021)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68 (2) (2021)
Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé
Disproving the normal graph conjecture. J. Comb. Theory, Ser. B 147 (2021)
Tereza Klimosová, Stéphan Thomassé
Edge-decomposing graphs into coprime forests. J. Graph Theory 97 (1) (2021)
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé
Twin-width IV: low complexity matrices. CoRR (2021)
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width III: Max Independent Set, Min Dominating Set, and Coloring. ICALP (2021)
Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé
Twin-width and permutations. CoRR (2021)
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width II: small classes. SODA (2021)
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé
Twin-width VI: the lens of contraction sequences. CoRR (2021)
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
Twin-Width and Polynomial Kernels. IPEC (2021)
Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon
)-free graphs. Part 2: Bounds on treewidth. J. Graph Theory 97 (4) (2021)
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
Twin-width and polynomial kernels. CoRR (2021)
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width II: small classes. CoRR (2020)
Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant
An algorithmic weakening of the Erdős-Hajnal conjecture. CoRR (2020)
Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width I: tractable FO model checking. CoRR (2020)
Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five. SIAM J. Discret. Math. 34 (2) (2020)
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica 82 (8) (2020)
Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant
An Algorithmic Weakening of the Erdős-Hajnal Conjecture. ESA (2020)
Vincent Despré, Michaël Rao, Stéphan Thomassé
Testing Balanced Splitting Cycles in Complete Triangulations. CCCG (2020)
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width III: Max Independent Set and Coloring. CoRR (2020)
Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon
)-free graphs. Part 2 : bounds on treewidth. CoRR (2020)
Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
-free graphs. SODA (2020)
Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width I: tractable FO model checking. FOCS (2020)
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Coloring Dense Digraphs. Comb. 39 (5) (2019)
Edin Husic, Stéphan Thomassé, Nicolas Trotignon
The Independent Set Problem Is FPT for Even-Hole-Free Graphs. IPEC (2019)
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Trans. Algorithms 15 (1) (2019)
Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. CoRR (2019)
Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
Maximum independent sets in (pyramid, even hole)-free graphs. CoRR (2019)
Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant
When Maximum Stable Set Can Be Solved in FPT Time. ISAAC (2019)
Mateusz Skomra, Stéphan Thomassé
Convexly independent subsets of Minkowski sums of convex polygons. CoRR (2019)
Louis Esperet, Ross J. Kang, Stéphan Thomassé
Separation Choosability and Dense Bipartite Induced Subgraphs. Comb. Probab. Comput. 28 (5) (2019)
Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, Stéphan Thomassé
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. Electron. J. Comb. 26 (3) (2019)
Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu
Coloring tournaments: From local to global. J. Comb. Theory, Ser. B 138 (2019)
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé
Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture. Comb. 39 (2) (2019)
Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant
When Maximum Stable Set can be solved in FPT time. CoRR (2019)
Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five. CoRR (2019)
Nicolas Bousquet, William Lochet, Stéphan Thomassé
A proof of the Erdős-Sands-Sauer-Woodrow conjecture. J. Comb. Theory, Ser. B 137 (2019)
Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. SODA (2018)
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
Parameterized Complexity of Independent Set in H-Free Graphs. CoRR (2018)
Louis Esperet, Ross J. Kang, Stéphan Thomassé
Separation choosability and dense bipartite induced subgraphs. CoRR (2018)
Maria Chudnovsky, Ringi Kim, Chun-Hung Liu, Paul D. Seymour, Stéphan Thomassé
Domination in tournaments. J. Comb. Theory, Ser. B 130 (2018)
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
Parameterized Complexity of Independent Set in H-Free Graphs. IPEC (2018)
Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
EPTAS for Max Clique on Disks and Unit Balls. FOCS (2018)
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Domination and Fractional Domination in Digraphs. Electron. J. Comb. 25 (3) (2018)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
EPTAS for Max Clique on Disks and Unit Balls. CoRR (2018)
Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé
Additive Bases and Flows in Graphs. SIAM J. Discret. Math. 32 (1) (2018)
Nicolas Bousquet, Jean Daligault, Stéphan Thomassé
Multicut Is FPT. SIAM J. Comput. 47 (1) (2018)
Tereza Klimosová, Stéphan Thomassé
Edge-decomposing graphs into coprime forests. CoRR (2018)
Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé
Additive bases and flows in graphs. Electron. Notes Discret. Math. 61 (2017)
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé
A proof of the Barát-Thomassen conjecture. J. Comb. Theory, Ser. B 124 (2017)
Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé
On the Complexity of Partial Derivatives. STACS (2017)
Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. Algorithmica 77 (3) (2017)
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Coloring dense digraphs. Electron. Notes Discret. Math. 61 (2017)
Tereza Klimosová, Stéphan Thomassé
Decomposing graphs into paths and trees. Electron. Notes Discret. Math. 61 (2017)
Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé
On the complexity of partial derivatives. CoRR (2016)
Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé
The Erdös-Hajnal Conjecture for Long Holes and Antiholes. SIAM J. Discret. Math. 30 (2) (2016)
Christophe Paul, Anthony Perez, Stéphan Thomassé
Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique. J. Comput. Syst. Sci. 82 (2) (2016)
Irena Penev, Stéphan Thomassé, Nicolas Trotignon
Isolating Highly Connected Induced Subgraphs. SIAM J. Discret. Math. 30 (1) (2016)
Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon
Perfect graphs of arbitrarily large clique-chromatic number. J. Comb. Theory, Ser. B 116 (2016)

Stéphan Thomassé.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Stéphan Thomassé