Skip to Main content
Number of documents

7

Nicolas Trotignon (CNRS researcher)


Stéphan Thomassé   

Journal articles5 documents

  • Stéphan Thomassé, Nicolas Trotignon, Kristina Vušković. A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. Algorithmica, Springer Verlag, 2017, 77 (3), pp.619 - 641. ⟨10.1007/s00453-015-0083-x⟩. ⟨hal-01482301⟩
  • Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon. Perfect graphs of arbitrarily large clique-chromatic number. Journal of Combinatorial Theory, Series B, Elsevier, 2016, 116, pp.456-464. ⟨10.1016/j.jctb.2015.09.008⟩. ⟨hal-01324052⟩
  • Irena Penev, Sté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-01324067⟩
  • Andras Gyarfas, Zhentao Li, Raphael Machado, András Sebő, Stéphan Thomassé, et al.. Complements of nearly perfect graphs. The Electronic Journal of Combinatorics, Open Journal Systems, 2013, 4 (3), pp.299 - 310. ⟨10.4310/JOC.2013.v4.n3.a2⟩. ⟨hal-01592744⟩
  • András Sebő, Zhentao Li, Raphael Machado, Stéphan Thomassé, Nicolas Trotignon. Complements of not so perfect graphs. European Journal of Combinatorics, Elsevier, 2013, 4 (3), pp.299 - 310. ⟨hal-00909511⟩

Conference papers1 document

  • Stéphan Thomassé, Nicolas Trotignon, Kristina Vušković. A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. WG 2014, Jun 2014, Orleans, France. pp.408-419. ⟨hal-01993372⟩

Preprints, Working Papers, ...1 document

  • Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon, Kristina Vušković. Maximum independent sets in (pyramid, even hole)-free graphs. 2021. ⟨hal-02424059⟩