Skip to Main content Skip to Navigation


lirmm-00433050v1  Conference papers
Daniel GonçalvesFrédéric HavetAlexandre PinlouStéphan Thomassé. Spanning galaxies in digraphs
EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.139-143, ⟨10.1016/j.endm.2009.07.023⟩
...
lirmm-00197151v1  Journal articles
Stéphan ThomasséFrédéric HavetLouigi Addario-Berry. Paths with two blocks in n-chromatic digraphs
Journal of Combinatorial Theory, Series B, Elsevier, 2007, 97, pp.620-626. ⟨10.1016/j.jctb.2006.10.001⟩
hal-01990651v1  Conference papers
Tereza KlimošováStéphan Thomassé. Decomposing graphs into paths and trees
The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), Aug 2017, Vienna, Austria. pp.751-757
hal-02935911v1  Journal articles
Maria ChudnovskyMarcin PilipczukMichał PilipczukStéphan Thomassé. On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2020, 34 (2), pp.1472-1483. ⟨10.1137/19M1249473⟩
hal-01433822v1  Conference papers
Louis EsperetRémi de Joannis de VerclosTien-Nam LeStéphan Thomassé. Additive bases and flows in graphs
The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), 2017, Vienne, Austria. pp.399-405, ⟨10.1016/j.endm.2017.06.066⟩
hal-01709239v1  Journal articles
Louis EsperetRémi de Joannis de VerclosTien-Nam LeStéphan Thomassé. Additive bases and flows in graphs
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (1), pp.534-542. ⟨10.1137/17M1113758⟩
hal-02055844v1  Journal articles
Fedor V. FominTien-Nam LeDaniel LokshtanovSaket SaurabhStéphan Thomassé et al.  Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems
ACM Transactions on Algorithms, Association for Computing Machinery, 2019, 15 (1), pp.1-44
hal-01990308v1  Journal articles
Pascal KoiranNatacha PortierSébastien TavenasStéphan Thomassé. A tau-Conjecture for Newton Polygons
Foundations of Computational Mathematics, Springer Verlag, 2015, 15 (1), pp.185-197
...
hal-01989763v1  Journal articles
Nathalie AubrunSebastián BarbieriStéphan Thomassé. Realization of aperiodic subshifts and uniform densities in groups
Groups, Geometry, and Dynamics, European Mathematical Society, 2019, 13 (1), pp.107-129
hal-02275202v1  Journal articles
Louis EsperetRoss KangStéphan Thomassé. Separation Choosability and Dense Bipartite Induced Subgraphs
Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2019, 28 (5), pp.720-732. ⟨10.1017/S0963548319000026⟩
hal-01324090v1  Journal articles
Nicolas BousquetStéphan Thomassé. VC-dimension and Erdős–Pósa property
Discrete Mathematics, Elsevier, 2015, 338, pp.2302-2317. ⟨10.1016/j.disc.2015.05.026⟩
hal-01324067v1  Journal articles
Irena PenevStéphan ThomasséNicolas Trotignon. Isolating Highly Connected Induced Subgraphs
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2016, 30, pp.592-619. ⟨10.1137/140981939⟩
hal-01993403v1  Journal articles
Maria ChudnovskyRingi KimChun-Hung LiuPaul SeymourStéphan Thomassé. Domination in tournaments
Journal of Combinatorial Theory, Series B, Elsevier, 2018, 130, pp.98-113
...
hal-02158330v2  Journal articles
Nicolas BousquetWilliam LochetStéphan Thomassé. A proof of the Erdős–Sands–Sauer–Woodrow conjecture
Journal of Combinatorial Theory, Series B, Elsevier, 2019, Elsevier Journal of Combinatorial Theory, Series B, 137, pp.316-319. ⟨10.1016/j.jctb.2018.11.005⟩
...
hal-00958647v1  Journal articles
Nicolas BousquetAurélie LagoutteStéphan Thomassé. Clique versus Independent Set
European Journal of Combinatorics, Elsevier, 2014, 40, pp.73-92. ⟨10.1016/j.ejc.2014.02.003⟩
...
hal-01134469v1  Journal articles
Nicolas BousquetAurélie LagoutteStéphan Thomassé. The Erdős–Hajnal conjecture for paths and antipaths
Journal of Combinatorial Theory, Series B, Elsevier, 2015, 113, pp.261-264. ⟨10.1016/j.jctb.2015.01.001⟩