Stéphan Thomassé

203 papers A* 16A 12B 11Journal 158Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	First order logic and twin-width in tournaments and dense oriented graphs. Eur. J. Comb. Colin Geniet, Stéphan Thomassé
2026	J	`jnl`	Maximum Independent Set when Excluding an Induced Minor: K Algorithmica Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek
2025	A*	`conf`	A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number. FOCS Romain Bourneuf, Pierre Charbit, Stéphan Thomassé
2025	J	`jnl`	A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number. CoRR Romain Bourneuf, Pierre Charbit, Stéphan Thomassé
2025	A	`conf`	A Polynomial-Time Approximation Algorithm for Complete Interval Minors. APPROX/RANDOM Romain Bourneuf, Julien Cocquet, Chaoliang Tang, Stéphan Thomassé
2025	J	`jnl`	A Polynomial-Time Approximation Algorithm for Complete Interval Minors. CoRR Romain Bourneuf, Julien Cocquet, Chaoliang Tang, Stéphan Thomassé
2025	B	`conf`	A Structural Description of Zykov and Blanche Descartes Graphs. WG Malory Marin, Stéphan Thomassé, Nicolas Trotignon, Rémi Watrigant
2025	J	`jnl`	Graphs without a 3-Connected Subgraph are 4-Colourable. Electron. J. Comb. Édouard Bonnet, Carl Feghali, Tung Nguyen, Alex Scott, Paul D. Seymour, Stéphan Thomassé, Nicolas Trotignon
2025	A*	`conf`	On the Complexity of Client-Waiter and Waiter-Client Games. ICALP Valentin Gledel, Nacim Oijid, Sébastien Tavenas, Stéphan Thomassé
2024	J	`jnl`	($\overrightarrow{P_6}$, triangle)-Free Digraphs Have Bounded Dichromatic Number. Electron. J. Comb. Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé
2024	J	`jnl`	A quasi-quadratic vertex-kernel for Cograph Edge Editing. Discret. Appl. Math. Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé
2024	J	`jnl`	A structural description of Zykov and Blanche Descartes graphs. CoRR Malory Marin, Stéphan Thomassé, Nicolas Trotignon, Rémi Watrigant
2024	J	`jnl`	Clique covers of H-free graphs. Eur. J. Comb. Tung Nguyen, Alexander Scott, Paul D. Seymour, Stéphan Thomassé
2024	J	`jnl`	Dichromatic Number and Cycle Inversions. CoRR Pierre Charbit, Stéphan Thomassé
2024	A*	`conf`	Factoring Pattern-Free Permutations into Separable ones. SODA Edouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé
2024	J	`jnl`	Graphs without a 3-connected subgraph are 4-colorable. CoRR Édouard Bonnet, Carl Feghali, Stéphan Thomassé, Nicolas Trotignon
2024	J	`jnl`	Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in $\boldsymbol{H}$-Free Graphs. SIAM J. Comput. Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
2024	J	`jnl`	Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. J. Comb. Theory B Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
2024	A	`conf`	Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. STACS Stéphane Bessy, Stéphan Thomassé, Laurent Viennot
2024	J	`jnl`	Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring. SIAM J. Comput. Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2024	J	`jnl`	Twin-Width IV: Ordered Graphs and Matrices. J. ACM Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk
2024	J	`jnl`	Twin-width and permutations. Log. Methods Comput. Sci. Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé
2024	A*	`conf`	Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems. ICALP Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé
2024	J	`jnl`	Vertex-minor universal graphs for generating entangled quantum subsystems. CoRR Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé
2023	J	`jnl`	Bounded twin-width graphs are polynomially χ-bounded. CoRR Romain Bourneuf, Stéphan Thomassé
2023	J	`jnl`	Extremal Independent Set Reconfiguration. Electron. J. Comb. Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé
2023	J	`jnl`	Extremal Independent Set Reconfiguration. CoRR Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé
2023	J	`jnl`	Factoring Pattern-Free Permutations into Separable ones. CoRR Édouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé
2023	A	`conf`	First Order Logic and Twin-Width in Tournaments. ESA Colin Geniet, Stéphan Thomassé
2023	A	`conf`	Lossy Kernelization for (Implicit) Hitting Set Problems. ESA Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2023	J	`jnl`	Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2023	A	`conf`	Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄. ESA Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek
2023	J	`jnl`	Maximum Independent Set when excluding an induced minor: K CoRR Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek
2023	A*	`conf`	Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. SODA Marthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
2023	J	`jnl`	Temporalizing digraphs via linear-size balanced bi-trees. CoRR Stéphane Bessy, Stéphan Thomassé, Laurent Viennot
2023	A	`conf`	Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication. STACS Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé
2022	J	`jnl`	(P6, triangle)-free digraphs have bounded dichromatic number. CoRR Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé
2022	A*	`conf`	A Brief Tour in Twin-Width (Invited Talk). ICALP Stéphan Thomassé
2022	J	`jnl`	A quasi-quadratic vertex Kernel for Cograph edge editing. CoRR Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé
2022	J	`jnl`	Degeneracy of J. Comb. Theory B Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak
2022	J	`jnl`	Edge-partitioning 3-edge-connected graphs into paths. J. Comb. Theory B Tereza Klimosová, Stéphan Thomassé
2022	J	`jnl`	First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs. CoRR Colin Geniet, Stéphan Thomassé
2022	J	`jnl`	Graphs with polynomially many minimal separators. J. Comb. Theory B Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
2022	J	`jnl`	Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. CoRR Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
2022	B	`conf`	Twin-Width VIII: Delineation and Win-Wins. IPEC Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé
2022	J	`jnl`	Twin-width I: Tractable FO Model Checking. J. ACM Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2022	J	`jnl`	Twin-width II: small classes. Comb. Theory Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2022	A*	`conf`	Twin-width IV: ordered graphs and matrices. STOC Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk
2022	J	`jnl`	Twin-width V: linear minors, modular counting, and matrix multiplication. CoRR Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé
2022	A*	`conf`	Twin-width VI: the lens of contraction sequences. SODA Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé
2022	J	`jnl`	Twin-width VII: groups. CoRR Édouard Bonnet, Colin Geniet, Romain Tessera, Stéphan Thomassé
2022	J	`jnl`	Twin-width VIII: delineation and win-wins. CoRR Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé
2022	J	`jnl`	Twin-width and Polynomial Kernels. Algorithmica Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
2021	J	`jnl`	(Theta, triangle)-free and (even hole, K J. Graph Theory Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon
2021	J	`jnl`	Convexly independent subsets of Minkowski sums of convex polygons. Discret. Math. Mateusz Skomra, Stéphan Thomassé
2021	J	`jnl`	Disproving the normal graph conjecture. J. Comb. Theory B Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé
2021	J	`jnl`	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021	J	`jnl`	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021	J	`jnl`	Edge-decomposing graphs into coprime forests. J. Graph Theory Tereza Klimosová, Stéphan Thomassé
2021	B	`conf`	Twin-Width and Polynomial Kernels. IPEC Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
2021	A*	`conf`	Twin-width II: small classes. SODA Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2021	A*	`conf`	Twin-width III: Max Independent Set, Min Dominating Set, and Coloring. ICALP Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2021	J	`jnl`	Twin-width IV: ordered graphs and matrices. CoRR Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk
2021	J	`jnl`	Twin-width VI: the lens of contraction sequences. CoRR Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé
2021	J	`jnl`	Twin-width and permutations. CoRR Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé
2021	J	`jnl`	Twin-width and polynomial kernels. CoRR Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	(Theta, triangle)-free and (even hole, K CoRR Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon
2020	A	`conf`	An Algorithmic Weakening of the Erdős-Hajnal Conjecture. ESA Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant
2020	J	`jnl`	An algorithmic weakening of the Erdős-Hajnal conjecture. CoRR Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant
2020	J	`jnl`	On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five. SIAM J. Discret. Math. Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
2020	J	`jnl`	Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
2020	A*	`conf`	Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in SODA Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
2020	—	`conf`	Testing Balanced Splitting Cycles in Complete Triangulations. CCCG Vincent Despré, Michaël Rao, Stéphan Thomassé
2020	A*	`conf`	Twin-width I: tractable FO model checking. FOCS Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	Twin-width I: tractable FO model checking. CoRR Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	Twin-width II: small classes. CoRR Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	Twin-width III: Max Independent Set and Coloring. CoRR Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2019	J	`jnl`	A proof of the Erdős-Sands-Sauer-Woodrow conjecture. J. Comb. Theory B Nicolas Bousquet, William Lochet, Stéphan Thomassé
2019	J	`jnl`	Coloring Dense Digraphs. Comb. Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
2019	J	`jnl`	Coloring tournaments: From local to global. J. Comb. Theory B Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu
2019	J	`jnl`	Convexly independent subsets of Minkowski sums of convex polygons. CoRR Mateusz Skomra, Stéphan Thomassé
2019	J	`jnl`	Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture. Comb. Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé
2019	J	`jnl`	Maximum independent sets in (pyramid, even hole)-free graphs. CoRR Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
2019	J	`jnl`	On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five. CoRR Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
2019	J	`jnl`	Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. CoRR Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
2019	J	`jnl`	Separation Choosability and Dense Bipartite Induced Subgraphs. Comb. Probab. Comput. Louis Esperet, Ross J. Kang, Stéphan Thomassé
2019	J	`jnl`	Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. Electron. J. Comb. Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, Stéphan Thomassé
2019	J	`jnl`	Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Trans. Algorithms Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2019	B	`conf`	The Independent Set Problem Is FPT for Even-Hole-Free Graphs. IPEC Edin Husic, Stéphan Thomassé, Nicolas Trotignon
2019	B	`conf`	When Maximum Stable Set Can Be Solved in FPT Time. ISAAC Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant
2019	J	`jnl`	When Maximum Stable Set can be solved in FPT time. CoRR Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant
2018	J	`jnl`	Additive Bases and Flows in Graphs. SIAM J. Discret. Math. Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé
2018	J	`jnl`	Domination and Fractional Domination in Digraphs. Electron. J. Comb. Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
2018	J	`jnl`	Domination in tournaments. J. Comb. Theory B Maria Chudnovsky, Ringi Kim, Chun-Hung Liu, Paul D. Seymour, Stéphan Thomassé
2018	A*	`conf`	EPTAS for Max Clique on Disks and Unit Balls. FOCS Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
2018	J	`jnl`	EPTAS for Max Clique on Disks and Unit Balls. CoRR Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
2018	J	`jnl`	Edge-decomposing graphs into coprime forests. CoRR Tereza Klimosová, Stéphan Thomassé
2018	J	`jnl`	Multicut Is FPT. SIAM J. Comput. Nicolas Bousquet, Jean Daligault, Stéphan Thomassé
2018	B	`conf`	Parameterized Complexity of Independent Set in H-Free Graphs. IPEC Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
2018	J	`jnl`	Parameterized Complexity of Independent Set in H-Free Graphs. CoRR Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
2018	J	`jnl`	Separation choosability and dense bipartite induced subgraphs. CoRR Louis Esperet, Ross J. Kang, Stéphan Thomassé
2018	A*	`conf`	Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. SODA Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2017	J	`jnl`	A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. Algorithmica Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
2017	J	`jnl`	A proof of the Barát-Thomassen conjecture. J. Comb. Theory B Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé
2017	J	`jnl`	Additive bases and flows in graphs. Electron. Notes Discret. Math. Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé
2017	J	`jnl`	Coloring dense digraphs. Electron. Notes Discret. Math. Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
2017	J	`jnl`	Decomposing graphs into paths and trees. Electron. Notes Discret. Math. Tereza Klimosová, Stéphan Thomassé
2017	A	`conf`	On the Complexity of Partial Derivatives. STACS Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé
2016	J	`jnl`	Isolating Highly Connected Induced Subgraphs. SIAM J. Discret. Math. Irena Penev, Stéphan Thomassé, Nicolas Trotignon
2016	J	`jnl`	Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique. J. Comput. Syst. Sci. Christophe Paul, Anthony Perez, Stéphan Thomassé
2016	J	`jnl`	On the complexity of partial derivatives. CoRR Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé
2016	J	`jnl`	Perfect graphs of arbitrarily large clique-chromatic number. J. Comb. Theory B Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon
2016	J	`jnl`	The Erdös-Hajnal Conjecture for Long Holes and Antiholes. SIAM J. Discret. Math. Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé
2015	J	`jnl`	A $$\tau $$ τ -Conjecture for Newton Polygons. Found. Comput. Math. Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé
2015	J	`jnl`	Excluding clocks. Electron. Notes Discret. Math. Pierre Aboulker, Zhentao Li, Stéphan Thomassé
2015	J	`jnl`	Identifying Codes in Hereditary Classes of Graphs and VC-Dimension. SIAM J. Discret. Math. Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé
2015	J	`jnl`	The Erdős-Hajnal conjecture for paths and antipaths. J. Comb. Theory B Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé
2015	J	`jnl`	VC-dimension and Erdős-Pósa property. Discret. Math. Nicolas Bousquet, Stéphan Thomassé
2014	—	`conf`	A Note on the Minimum Distance of Quantum LDPC Codes. MFCS (2) Nicolas Delfosse, Zhentao Li, Stéphan Thomassé
2014	B	`conf`	A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. WG Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
2014	J	`jnl`	A note on the minimum distance of quantum LDPC codes. CoRR Nicolas Delfosse, Zhentao Li, Stéphan Thomassé
2014	J	`jnl`	Clique versus independent set. Eur. J. Comb. Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé
2014	J	`jnl`	Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. J. Graph Theory Jørgen Bang-Jensen, Stéphane Bessy, Stéphan Thomassé
2014	J	`jnl`	Graphs with large chromatic number induce $3k$-cycles. CoRR Marthe Bonamy, Pierre Charbit, Stéphan Thomassé
2014	J	`jnl`	Hitting and Harvesting Pumpkins. SIAM J. Discret. Math. Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2014	J	`jnl`	Identifying codes in hereditary classes of graphs and VC-dimension. CoRR Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé
2014	J	`jnl`	Parameterized Domination in Circle Graphs. Theory Comput. Syst. Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2014	J	`jnl`	Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. J. Comput. Syst. Sci. Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo
2014	J	`jnl`	The Erdős-Hajnal Conjecture for Long Holes and Anti-holes. CoRR Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé
2014	J	`jnl`	VC-dimension and Erdős-Pósa property. CoRR Nicolas Bousquet, Stéphan Thomassé
2013	J	`jnl`	A counterexample to a conjecture of Schwartz. Soc. Choice Welf. Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott, Paul D. Seymour, Stéphan Thomassé
2013	J	`jnl`	A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
2013	J	`jnl`	A tau-conjecture for Newton polygons. CoRR Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé
2013	J	`jnl`	Clique versus Independent Set CoRR Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé
2013	A	`conf`	Graph coloring, communication complexity and the stubborn problem (Invited talk). STACS Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé
2013	J	`jnl`	Oriented trees in digraphs. Discret. Math. Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce A. Reed, Stéphan Thomassé
2013	J	`jnl`	Parameterized algorithm for weighted independent set problem in bull-free graphs. CoRR Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
2013	J	`jnl`	The Erdős-Hajnal Conjecture for Paths and Antipaths CoRR Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé
2013	J	`jnl`	Tournaments and colouring. J. Comb. Theory B Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé
2012	J	`jnl`	A stability theorem on fractional covering of triangles by edges. Eur. J. Comb. Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé
2012	J	`jnl`	Cyclic orderings and cyclic arboricity of matroids. J. Comb. Theory B Jan van den Heuvel, Stéphan Thomassé
2012	J	`jnl`	On spanning galaxies in digraphs. Discret. Appl. Math. Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé
2012	J	`jnl`	Packing and Covering Triangles in K 4-free Planar Graphs. Graphs Comb. Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé
2012	J	`jnl`	Parameterized Domination in Circle Graphs CoRR Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2012	B	`conf`	Parameterized Domination in Circle Graphs. WG Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2012	J	`jnl`	Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. Comb. Probab. Comput. Nicolas Bousquet, Stéphan Thomassé
2012	J	`jnl`	Symmetric Determinantal Representations in Characteristic 2 CoRR Bruno Grenet, Thierry Monteil, Stéphan Thomassé
2011	B	`conf`	Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. MFCS Christophe Paul, Anthony Perez, Stéphan Thomassé
2011	J	`jnl`	Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems CoRR Christophe Paul, Anthony Perez, Stéphan Thomassé
2011	J	`jnl`	Hitting and Harvesting Pumpkins CoRR Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2011	A	`conf`	Hitting and Harvesting Pumpkins. ESA Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2011	J	`jnl`	Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo
2011	J	`jnl`	Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2011	A*	`conf`	Multicut is FPT. STOC Nicolas Bousquet, Jean Daligault, Stéphan Thomassé
2011	J	`jnl`	Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem. Discret. Appl. Math. Flavio Guiñez, Martín Matamala, Stéphan Thomassé
2011	—	`conf`	Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo
2011	J	`jnl`	The Domination Number of Grids CoRR Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
2011	J	`jnl`	The Domination Number of Grids. SIAM J. Discret. Math. Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
2010	J	`jnl`	A 4 ACM Trans. Algorithms Stéphan Thomassé
2010	J	`jnl`	Edge Growth in Graph Cubes CoRR Matt DeVos, Stéphan Thomassé
2010	J	`jnl`	Multicut is FPT CoRR Nicolas Bousquet, Jean Daligault, Stéphan Thomassé
2010	J	`jnl`	Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture. J. Comb. Theory B Stéphane Bessy, Stéphan Thomassé
2010	J	`jnl`	Partitions versus sets: A case of duality. Eur. J. Comb. Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé
2010	J	`jnl`	WDM and Directed Star Arboricity. Comb. Probab. Comput. Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé
2010	J	`jnl`	Well-Quasi-Order of Relabel Functions. Order Jean Daligault, Michaël Rao, Stéphan Thomassé
2009	J	`jnl`	A Linear Vertex Kernel for Maximum Internal Spanning Tree CoRR Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
2009	B	`conf`	A Linear Vertex Kernel for Maximum Internal Spanning Tree. ISAAC Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
2009	J	`jnl`	A Polynomial Kernel For Multicut In Trees CoRR Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo
2009	A	`conf`	A Polynomial Kernel for Multicut in Trees. STACS Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo
2009	A*	`conf`	A quadratic kernel for feedback vertex set. SODA Stéphan Thomassé
2009	J	`jnl`	Complexity of (p, 1)-total labelling. Discret. Appl. Math. Frédéric Havet, Stéphan Thomassé
2009	A	`conf`	Kernel Bounds for Disjoint Cycles and Disjoint Paths. ESA Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo
2009	J	`jnl`	Kernels for Feedback Arc Set In Tournaments CoRR Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2009	—	`conf`	Kernels for Feedback Arc Set In Tournaments. FSTTCS Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2009	J	`jnl`	On Finding Directed Trees with Many Leaves CoRR Jean Daligault, Stéphan Thomassé
2009	—	`conf`	On Finding Directed Trees with Many Leaves. IWPEC Jean Daligault, Stéphan Thomassé
2009	J	`jnl`	Partitions versus sets : a case of duality CoRR Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé
2009	J	`jnl`	Spanning galaxies in digraphs. Electron. Notes Discret. Math. Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet
2009	J	`jnl`	Submodular partition functions. Discret. Math. Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé
2008	J	`jnl`	Finding a vector orthogonal to roughly half a collection of vectors. J. Complex. Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé
2008	—	`conf`	Guarding Art Galleries: The Extra Cost for Sculptures Is Linear. SWAT Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé
2008	J	`jnl`	Hoàng-Reed conjecture holds for tournaments. Discret. Math. Frédéric Havet, Stéphan Thomassé, Anders Yeo
2007	J	`jnl`	Graphs with Large Girth Not Embeddable in the Sphere. Comb. Probab. Comput. Pierre Charbit, Stéphan Thomassé
2007	J	`jnl`	Paths with two blocks in n-chromatic digraphs. J. Comb. Theory B Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé
2007	J	`jnl`	Spanning a strong digraph by Comb. Stéphane Bessy, Stéphan Thomassé
2007	J	`jnl`	The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. Comb. Probab. Comput. Pierre Charbit, Stéphan Thomassé, Anders Yeo
2007	J	`jnl`	Total domination of graphs and small transversals of hypergraphs. Comb. Stéphan Thomassé, Anders Yeo
2007	J	`jnl`	WDM and Directed Star Arboricity CoRR Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé
2006	J	`jnl`	Density Conditions For Triangles In Multipartite Graphs. Comb. J. Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen
2005	J	`jnl`	Preface. Discret. Math. Gena Hahn, Pierre Ille, Stéphan Thomassé
2005	J	`jnl`	The categorical product of two 5-chromatic digraphs can be 3-chromatic. Discret. Math. Stéphane Bessy, Stéphan Thomassé
2004	J	`jnl`	The Discret. Math. Abderrahim Boussaïri, Pierre Ille, Gérard Lopez, Stéphan Thomassé
2004	B	`conf`	Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. IPCO Stéphane Bessy, Stéphan Thomassé
2003	J	`jnl`	Every strong digraph has a spanning strong subgraph with at most J. Comb. Theory B Stéphane Bessy, Stéphan Thomassé
2003	J	`jnl`	Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Stéphan Thomassé
2003	J	`jnl`	Small degree out-branchings. J. Graph Theory Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo
2002	J	`jnl`	Generalized Pigeonhole Properties of Graphs and Oriented Graphs Eur. J. Comb. Anthony Bonato, Peter J. Cameron, Dejan Delic, Stéphan Thomassé
2001	J	`jnl`	Countable alpha-extendable graphs. Discret. Math. Jean-Luc Rullière, Stéphan Thomassé
2001	J	`jnl`	Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas' Conjecture. J. Comb. Theory B Stéphan Thomassé
2000	J	`jnl`	Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture. J. Graph Theory Frédéric Havet, Stéphan Thomassé
2000	J	`jnl`	Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture. J. Comb. Theory B Frédéric Havet, Stéphan Thomassé
1998	J	`jnl`	2-Partition-Transitive Tournaments. J. Comb. Theory B Barry Guiduli, András Gyárfás, Stéphan Thomassé, Peter Weidl
1997	J	`jnl`	Indivisibility and Alpha-morphisms. Eur. J. Comb. Stéphan Thomassé