Stéphan Thomassé

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Claire Hilaire

> Home > Persons > Stéphan Thomassé

Publications

2024
[j90]
- view
  authority control:
- export record
  dblp key:
  - journals/jctb/BonamyBDEGHTW24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jctb/BonamyBDEGHTW24
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)
2023
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/BonamyBDEGHTW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BonamyBDEGHTW23
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
2022
[i47]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2206-00594
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2206-00594
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)

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.