default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStéphan Thomassé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j93]Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé:
A quasi-quadratic vertex-kernel for Cograph Edge Editing. Discret. Appl. Math. 357: 282-296 (2024)- [j92]Tung Nguyen, Alexander Scott, Paul D. Seymour, Stéphan Thomassé:
Clique covers of H-free graphs. Eur. J. Comb. 118: 103909 (2024) - [j91]É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): 21 (2024) - [j90]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: 215-249 (2024) - [j89]Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé:
Twin-width and permutations. Log. Methods Comput. Sci. 20(3) (2024) - [j88]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): 47-86 (2024) - [j87]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring. SIAM J. Comput. 53(5): 1602-1640 (2024) - [c41]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: 36:1-36:18 - [c40]Edouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé:
Factoring Pattern-Free Permutations into Separable ones. SODA 2024: 752-779 - [c39]Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. STACS 2024: 13:1-13:12 - [i59]Pierre Charbit, Stéphan Thomassé:
Dichromatic Number and Cycle Inversions. CoRR abs/2401.15130 (2024) - [i58]Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé:
Vertex-minor universal graphs for generating entangled quantum subsystems. CoRR abs/2402.06260 (2024) - [i57]Édouard Bonnet, Carl Feghali, Stéphan Thomassé, Nicolas Trotignon:
Graphs without a 3-connected subgraph are 4-colorable. CoRR abs/2402.06338 (2024) - [i56]Malory Marin, Stéphan Thomassé, Nicolas Trotignon, Rémi Watrigant:
A structural description of Zykov and Blanche Descartes graphs. CoRR abs/2410.06917 (2024) - 2023
- [j86]Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé:
Extremal Independent Set Reconfiguration. Electron. J. Comb. 30(3) (2023) - [c38]É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: 23:1-23:15 - [c37]Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA 2023: 49:1-49:14 - [c36]Colin Geniet, Stéphan Thomassé:
First Order Logic and Twin-Width in Tournaments. ESA 2023: 53:1-53:14 - [c35]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: 3006-3028 - [c34]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé:
Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication. STACS 2023: 15:1-15:16 - [i55]Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé:
Extremal Independent Set Reconfiguration. CoRR abs/2301.02020 (2023) - [i54]Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek:
Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4. CoRR abs/2302.08182 (2023) - [i53]Romain Bourneuf, Stéphan Thomassé:
Bounded twin-width graphs are polynomially χ-bounded. CoRR abs/2303.11231 (2023) - [i52]Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing digraphs via linear-size balanced bi-trees. CoRR abs/2304.03567 (2023) - [i51]Édouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé:
Factoring Pattern-Free Permutations into Separable ones. CoRR abs/2308.02981 (2023) - [i50]Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR abs/2308.05974 (2023) - 2022
- [j85]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-width and Polynomial Kernels. Algorithmica 84(11): 3300-3337 (2022) - [j84]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width II: small classes. Comb. Theory 2(2) (2022) - [j83]Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width I: Tractable FO Model Checking. J. ACM 69(1): 3:1-3:46 (2022) - [j82]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Graphs with polynomially many minimal separators. J. Comb. Theory B 152: 248-280 (2022) - [j81]Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak:
Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs. J. Comb. Theory B 152: 353-378 (2022) - [j80]Tereza Klimosová, Stéphan Thomassé:
Edge-partitioning 3-edge-connected graphs into paths. J. Comb. Theory B 156: 250-293 (2022) - [c33]Stéphan Thomassé:
A Brief Tour in Twin-Width (Invited Talk). ICALP 2022: 6:1-6:5 - [c32]Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé:
Twin-Width VIII: Delineation and Win-Wins. IPEC 2022: 9:1-9:18 - [c31]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé:
Twin-width VI: the lens of contraction sequences. SODA 2022: 1036-1056 - [c30]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk:
Twin-width IV: ordered graphs and matrices. STOC 2022: 924-937 - [i49]Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé:
Twin-width VIII: delineation and win-wins. CoRR abs/2204.00722 (2022) - [i48]Édouard Bonnet, Colin Geniet, Romain Tessera, Stéphan Thomassé:
Twin-width VII: groups. CoRR abs/2204.12330 (2022) - [i47]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 abs/2206.00594 (2022) - [i46]Colin Geniet, Stéphan Thomassé:
First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs. CoRR abs/2207.07683 (2022) - [i45]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé:
Twin-width V: linear minors, modular counting, and matrix multiplication. CoRR abs/2209.12023 (2022) - [i44]Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé:
(P6, triangle)-free digraphs have bounded dichromatic number. CoRR abs/2212.02272 (2022) - [i43]Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé:
A quasi-quadratic vertex Kernel for Cograph edge editing. CoRR abs/2212.14814 (2022) - 2021
- [j79]Mateusz Skomra, Stéphan Thomassé:
Convexly independent subsets of Minkowski sums of convex polygons. Discret. Math. 344(8): 112472 (2021) - [j78]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): 9:1-9:38 (2021) - [j77]Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé:
Disproving the normal graph conjecture. J. Comb. Theory B 147: 238-251 (2021) - [j76]Tereza Klimosová, Stéphan Thomassé:
Edge-decomposing graphs into coprime forests. J. Graph Theory 97(1): 21-33 (2021) - [j75]Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon:
(Theta, triangle)-free and (even hole, K4)-free graphs. Part 2: Bounds on treewidth. J. Graph Theory 97(4): 624-641 (2021) - [c29]É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: 35:1-35:20 - [c28]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-Width and Polynomial Kernels. IPEC 2021: 10:1-10:16 - [c27]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width II: small classes. SODA 2021: 1977-1996 - [i42]Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk:
Twin-width IV: ordered graphs and matrices. CoRR abs/2102.03117 (2021) - [i41]Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé:
Twin-width and permutations. CoRR abs/2102.06880 (2021) - [i40]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-width and polynomial kernels. CoRR abs/2107.02882 (2021) - [i39]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 abs/2110.15419 (2021) - [i38]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé:
Twin-width VI: the lens of contraction sequences. CoRR abs/2111.00282 (2021) - 2020
- [j74]Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica 82(8): 2360-2394 (2020) - [j73]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): 1472-1483 (2020) - [c26]Vincent Despré, Michaël Rao, Stéphan Thomassé:
Testing Balanced Splitting Cycles in Complete Triangulations. CCCG 2020: 167-173 - [c25]Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant:
An Algorithmic Weakening of the Erdős-Hajnal Conjecture. ESA 2020: 23:1-23:18 - [c24]Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width I: tractable FO model checking. FOCS 2020: 601-612 - [c23]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. SODA 2020: 2260-2278 - [i37]Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon:
(Theta, triangle)-free and (even hole, K4)-free graphs. Part 2 : bounds on treewidth. CoRR abs/2001.01607 (2020) - [i36]Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant:
An algorithmic weakening of the Erdős-Hajnal conjecture. CoRR abs/2004.12166 (2020) - [i35]Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width I: tractable FO model checking. CoRR abs/2004.14789 (2020) - [i34]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width II: small classes. CoRR abs/2006.09877 (2020) - [i33]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width III: Max Independent Set and Coloring. CoRR abs/2007.14161 (2020)
2010 – 2019
- 2019
- [j72]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): 239-263 (2019) - [j71]Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Coloring Dense Digraphs. Comb. 39(5): 1021-1053 (2019) - [j70]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): 3 (2019) - [j69]Louis Esperet, Ross J. Kang, Stéphan Thomassé:
Separation Choosability and Dense Bipartite Induced Subgraphs. Comb. Probab. Comput. 28(5): 720-732 (2019) - [j68]Nicolas Bousquet, William Lochet, Stéphan Thomassé:
A proof of the Erdős-Sands-Sauer-Woodrow conjecture. J. Comb. Theory B 137: 316-319 (2019) - [j67]Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu:
Coloring tournaments: From local to global. J. Comb. Theory B 138: 166-171 (2019) - [j66]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): 13:1-13:44 (2019) - [c22]Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant:
When Maximum Stable Set Can Be Solved in FPT Time. ISAAC 2019: 49:1-49:22 - [c21]Edin Husic, Stéphan Thomassé, Nicolas Trotignon:
The Independent Set Problem Is FPT for Even-Hole-Free Graphs. IPEC 2019: 21:1-21:12 - [i32]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 abs/1903.04761 (2019) - [i31]Mateusz Skomra, Stéphan Thomassé:
Convexly independent subsets of Minkowski sums of convex polygons. CoRR abs/1903.11287 (2019) - [i30]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 abs/1907.04585 (2019) - [i29]Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant:
When Maximum Stable Set can be solved in FPT time. CoRR abs/1909.08426 (2019) - [i28]Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Maximum independent sets in (pyramid, even hole)-free graphs. CoRR abs/1912.11246 (2019) - 2018
- [j65]Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Domination and Fractional Domination in Digraphs. Electron. J. Comb. 25(3): 3 (2018) - [j64]Maria Chudnovsky, Ringi Kim, Chun-Hung Liu, Paul D. Seymour, Stéphan Thomassé:
Domination in tournaments. J. Comb. Theory B 130: 98-113 (2018) - [j63]Nicolas Bousquet, Jean Daligault, Stéphan Thomassé:
Multicut Is FPT. SIAM J. Comput. 47(1): 166-207 (2018) - [j62]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): 534-542 (2018) - [c20]Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé:
EPTAS for Max Clique on Disks and Unit Balls. FOCS 2018: 568-579 - [c19]Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. IPEC 2018: 17:1-17:13 - [c18]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: 331-342 - [i27]Louis Esperet, Ross J. Kang, Stéphan Thomassé:
Separation choosability and dense bipartite induced subgraphs. CoRR abs/1802.03727 (2018) - [i26]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé:
EPTAS for Max Clique on Disks and Unit Balls. CoRR abs/1803.01822 (2018) - [i25]Tereza Klimosová, Stéphan Thomassé:
Edge-decomposing graphs into coprime forests. CoRR abs/1803.03704 (2018) - [i24]Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. CoRR abs/1810.04620 (2018) - 2017
- [j61]Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. Algorithmica 77(3): 619-641 (2017) - [j60]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: 399-405 (2017) - [j59]Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Coloring dense digraphs. Electron. Notes Discret. Math. 61: 577-583 (2017) - [j58]Tereza Klimosová, Stéphan Thomassé:
Decomposing graphs into paths and trees. Electron. Notes Discret. Math. 61: 751-757 (2017) - [j57]Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé:
A proof of the Barát-Thomassen conjecture. J. Comb. Theory B 124: 39-55 (2017) - [c17]Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé:
On the Complexity of Partial Derivatives. STACS 2017: 37:1-37:13 - 2016
- [j56]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): 366-379 (2016) - [j55]Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon:
Perfect graphs of arbitrarily large clique-chromatic number. J. Comb. Theory B 116: 456-464 (2016) - [j54]Irena Penev, Stéphan Thomassé, Nicolas Trotignon:
Isolating Highly Connected Induced Subgraphs. SIAM J. Discret. Math. 30(1): 592-619 (2016) - [j53]Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé:
The Erdös-Hajnal Conjecture for Long Holes and Antiholes. SIAM J. Discret. Math. 30(2): 1159-1164 (2016) - [i23]Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé:
On the complexity of partial derivatives. CoRR abs/1607.05494 (2016) - 2015
- [j52]Nicolas Bousquet, Stéphan Thomassé:
VC-dimension and Erdős-Pósa property. Discret. Math. 338(12): 2302-2317 (2015) - [j51]Pierre Aboulker, Zhentao Li, Stéphan Thomassé:
Excluding clocks. Electron. Notes Discret. Math. 50: 103-108 (2015) - [j50]Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé:
A $$\tau $$ τ -Conjecture for Newton Polygons. Found. Comput. Math. 15(1): 185-197 (2015) - [j49]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
The Erdős-Hajnal conjecture for paths and antipaths. J. Comb. Theory B 113: 261-264 (2015) - [j48]Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé:
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension. SIAM J. Discret. Math. 29(4): 2047-2064 (2015) - 2014
- [j47]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
Clique versus independent set. Eur. J. Comb. 40: 73-92 (2014) - [j46]Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo:
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. J. Comput. Syst. Sci. 80(4): 687-696 (2014) - [j45]Jørgen Bang-Jensen, Stéphane Bessy, Stéphan Thomassé:
Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. J. Graph Theory 75(3): 284-302 (2014) - [j44]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. Theory Comput. Syst. 54(1): 45-72 (2014) - [j43]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé:
Hitting and Harvesting Pumpkins. SIAM J. Discret. Math. 28(3): 1363-1390 (2014) - [c16]Nicolas Delfosse, Zhentao Li, Stéphan Thomassé:
A Note on the Minimum Distance of Quantum LDPC Codes. MFCS (2) 2014: 239-250 - [c15]Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. WG 2014: 408-419 - [i22]Nicolas Delfosse, Zhentao Li, Stéphan Thomassé:
A note on the minimum distance of quantum LDPC codes. CoRR abs/1404.6441 (2014) - [i21]Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé:
Identifying codes in hereditary classes of graphs and VC-dimension. CoRR abs/1407.5833 (2014) - [i20]Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé:
The Erdős-Hajnal Conjecture for Long Holes and Anti-holes. CoRR abs/1408.1964 (2014) - [i19]Marthe Bonamy, Pierre Charbit, Stéphan Thomassé:
Graphs with large chromatic number induce $3k$-cycles. CoRR abs/1408.2172 (2014) - [i18]Nicolas Bousquet, Stéphan Thomassé:
VC-dimension and Erdős-Pósa property. CoRR abs/1412.1793 (2014) - 2013
- [j42]Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce A. Reed, Stéphan Thomassé:
Oriented trees in digraphs. Discret. Math. 313(8): 967-974 (2013) - [j41]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé:
A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. 79(1): 1-6 (2013) - [j40]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé:
Tournaments and colouring. J. Comb. Theory B 103(1): 1-20 (2013) - [j39]Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott, Paul D. Seymour, Stéphan Thomassé:
A counterexample to a conjecture of Schwartz. Soc. Choice Welf. 40(3): 739-743 (2013) - [c14]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
Graph coloring, communication complexity and the stubborn problem (Invited talk). STACS 2013: 3-4 - [i17]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
Clique versus Independent Set. CoRR abs/1301.2474 (2013) - [i16]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
The Erdős-Hajnal Conjecture for Paths and Antipaths. CoRR abs/1303.5205 (2013) - [i15]Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé:
A tau-conjecture for Newton polygons. CoRR abs/1308.2286 (2013) - [i14]Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Parameterized algorithm for weighted independent set problem in bull-free graphs. CoRR abs/1310.6205 (2013) - 2012
- [j38]Nicolas Bousquet, Stéphan Thomassé:
Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. Comb. Probab. Comput. 21(4): 512-514 (2012) - [j37]Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé:
On spanning galaxies in digraphs. Discret. Appl. Math. 160(6): 744-754 (2012) - [j36]Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé:
A stability theorem on fractional covering of triangles by edges. Eur. J. Comb. 33(5): 799-806 (2012) - [j35]Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé:
Packing and Covering Triangles in K 4-free Planar Graphs. Graphs Comb. 28(5): 653-662 (2012) - [j34]Jan van den Heuvel, Stéphan Thomassé:
Cyclic orderings and cyclic arboricity of matroids. J. Comb. Theory B 102(3): 638-646 (2012) - [c13]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. WG 2012: 308-319 - [i13]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. CoRR abs/1205.3728 (2012) - [i12]Bruno Grenet, Thierry Monteil, Stéphan Thomassé:
Symmetric Determinantal Representations in Characteristic 2. CoRR abs/1210.5879 (2012) - 2011
- [j33]Flavio Guiñez, Martín Matamala, Stéphan Thomassé:
Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem. Discret. Appl. Math. 159(1): 23-30 (2011) - [j32]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé:
Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. 77(6): 1071-1078 (2011) - [j31]Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé:
The Domination Number of Grids. SIAM J. Discret. Math. 25(3): 1443-1453 (2011) - [j30]Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo:
Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35): 4570-4578 (2011) - [c12]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé:
Hitting and Harvesting Pumpkins. ESA 2011: 394-407 - [c11]Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo:
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS 2011: 229-240 - [c10]Christophe Paul, Anthony Perez, Stéphan Thomassé:
Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. MFCS 2011: 497-507 - [c9]Nicolas Bousquet, Jean Daligault, Stéphan Thomassé:
Multicut is FPT. STOC 2011: 459-468 - [i11]Christophe Paul, Anthony Perez, Stéphan Thomassé:
Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems. CoRR abs/1101.4491 (2011) - [i10]Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé:
The Domination Number of Grids. CoRR abs/1102.5206 (2011) - [i9]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé:
Hitting and Harvesting Pumpkins. CoRR abs/1105.2704 (2011) - 2010
- [j29]Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé:
WDM and Directed Star Arboricity. Comb. Probab. Comput. 19(2): 161-182 (2010) - [j28]Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé:
Partitions versus sets: A case of duality. Eur. J. Comb. 31(3): 681-687 (2010) - [j27]Stéphane Bessy, Stéphan Thomassé:
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture. J. Comb. Theory B 100(2): 176-180 (2010) - [j26]Jean Daligault, Michaël Rao, Stéphan Thomassé:
Well-Quasi-Order of Relabel Functions. Order 27(3): 301-315 (2010) - [j25]Stéphan Thomassé:
A 4k2 kernel for feedback vertex set. ACM Trans. Algorithms 6(2): 32:1-32:8 (2010) - [i8]Matt DeVos, Stéphan Thomassé:
Edge Growth in Graph Cubes. CoRR abs/1009.0343 (2010) - [i7]Nicolas Bousquet, Jean Daligault, Stéphan Thomassé:
Multicut is FPT. CoRR abs/1010.5197 (2010)
2000 – 2009
- 2009
- [j24]Frédéric Havet, Stéphan Thomassé:
Complexity of (p, 1)-total labelling. Discret. Appl. Math. 157(13): 2859-2870 (2009) - [j23]Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé:
Submodular partition functions. Discret. Math. 309(20): 6000-6008 (2009) - [j22]Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet:
Spanning galaxies in digraphs. Electron. Notes Discret. Math. 34: 139-143 (2009) - [c8]Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo:
Kernel Bounds for Disjoint Cycles and Disjoint Paths. ESA 2009: 635-646 - [c7]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé:
Kernels for Feedback Arc Set In Tournaments. FSTTCS 2009: 37-47 - [c6]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé:
A Linear Vertex Kernel for Maximum Internal Spanning Tree. ISAAC 2009: 275-282 - [c5]Jean Daligault, Stéphan Thomassé:
On Finding Directed Trees with Many Leaves. IWPEC 2009: 86-97 - [c4]Stéphan Thomassé:
A quadratic kernel for feedback vertex set. SODA 2009: 115-119 - [c3]Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo:
A Polynomial Kernel for Multicut in Trees. STACS 2009: 183-194 - [i6]Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo:
A Polynomial Kernel For Multicut In Trees. CoRR abs/0902.1047 (2009) - [i5]Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé:
Partitions versus sets : a case of duality. CoRR abs/0903.2100 (2009) - [i4]Jean Daligault, Stéphan Thomassé:
On Finding Directed Trees with Many Leaves. CoRR abs/0904.2658 (2009) - [i3]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé:
Kernels for Feedback Arc Set In Tournaments. CoRR abs/0907.2165 (2009) - [i2]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé:
A Linear Vertex Kernel for Maximum Internal Spanning Tree. CoRR abs/0907.3208 (2009) - 2008
- [j21]Frédéric Havet, Stéphan Thomassé, Anders Yeo:
Hoàng-Reed conjecture holds for tournaments. Discret. Math. 308(15): 3412-3415 (2008) - [j20]Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé:
Finding a vector orthogonal to roughly half a collection of vectors. J. Complex. 24(1): 39-53 (2008) - [c2]Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé:
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear. SWAT 2008: 41-52 - 2007
- [j19]Stéphan Thomassé, Anders Yeo:
Total domination of graphs and small transversals of hypergraphs. Comb. 27(4): 473-487 (2007) - [j18]Stéphane Bessy, Stéphan Thomassé:
Spanning a strong digraph by alpha circuits: A proof of Gallai's conjecture. Comb. 27(6): 659-667 (2007) - [j17]Pierre Charbit, Stéphan Thomassé, Anders Yeo:
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. Comb. Probab. Comput. 16(1): 1-4 (2007) - [j16]Pierre Charbit, Stéphan Thomassé:
Graphs with Large Girth Not Embeddable in the Sphere. Comb. Probab. Comput. 16(6): 829-832 (2007) - [j15]Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé:
Paths with two blocks in n-chromatic digraphs. J. Comb. Theory B 97(4): 620-626 (2007) - [i1]Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé:
WDM and Directed Star Arboricity. CoRR abs/0705.0315 (2007) - 2006
- [j14]J. Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen:
Density Conditions For Triangles In Multipartite Graphs. Comb. 26(2): 121-131 (2006) - 2005
- [j13]Gena Hahn, Pierre Ille, Stéphan Thomassé:
Preface. Discret. Math. 291(1-3): 1- (2005) - [j12]Stéphane Bessy, Stéphan Thomassé:
The categorical product of two 5-chromatic digraphs can be 3-chromatic. Discret. Math. 305(1-3): 344-346 (2005) - 2004
- [j11]Abderrahim Boussaïri, Pierre Ille, Gérard Lopez, Stéphan Thomassé:
The C3-structure of the tournaments. Discret. Math. 277(1-3): 29-43 (2004) - [c1]Stéphane Bessy, Stéphan Thomassé:
Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. IPCO 2004: 132-138 - 2003
- [j10]Jørgen Bang-Jensen, Stéphan Thomassé:
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. Discret. Appl. Math. 131(2): 555-559 (2003) - [j9]Stéphane Bessy, Stéphan Thomassé:
Every strong digraph has a spanning strong subgraph with at most n+2 alpha-2 arcs. J. Comb. Theory B 87(2): 289-299 (2003) - [j8]Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo:
Small degree out-branchings. J. Graph Theory 42(4): 297-307 (2003) - 2002
- [j7]Anthony Bonato, Peter J. Cameron, Dejan Delic, Stéphan Thomassé:
Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1. Eur. J. Comb. 23(3): 257-274 (2002) - 2001
- [j6]Jean-Luc Rullière, Stéphan Thomassé:
Countable alpha-extendable graphs. Discret. Math. 239(1-3): 53-67 (2001) - [j5]Stéphan Thomassé:
Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas' Conjecture. J. Comb. Theory B 83(2): 331-333 (2001) - 2000
- [j4]Frédéric Havet, Stéphan Thomassé:
Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture. J. Comb. Theory B 78(2): 243-273 (2000) - [j3]Frédéric Havet, Stéphan Thomassé:
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture. J. Graph Theory 35(4): 244-256 (2000)
1990 – 1999
- 1998
- [j2]Barry Guiduli, András Gyárfás, Stéphan Thomassé, Peter Weidl:
2-Partition-Transitive Tournaments. J. Comb. Theory B 72(2): 181-196 (1998) - 1997
- [j1]Stéphan Thomassé:
Indivisibility and Alpha-morphisms. Eur. J. Comb. 18(4): 445-454 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 01:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
