( en | de | ru )

 

Disambiguation of "Thomassé, Stéphan"

Author of the publication

copydeleteadd this publication to your clipboard
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.

, , , , , , , and . SODA, page 3006-3028. SIAM, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stéphan Lechner

Stéphan Barbe

Stéphan Stahl

Stephan

Stephan Frantzen

Enzymimmunologische und immunhistochemische Untersuchungen zum Einfluss von Matrix Metalloproteinasen und ihrer Inhibitoren auf die Entstehung der Dupuytren'schen Kontraktur. TU Aachen, (2009)
 

Other publications of authors with the same name

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems., , , , and . SODA, page 331-342. SIAM, (2018)Twin-width III: Max Independent Set, Min Dominating Set, and Coloring., , , , and . ICALP, volume 198 of LIPIcs, page 35:1-35:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Brief Tour in Twin-Width (Invited Talk).. ICALP, volume 229 of LIPIcs, page 6:1-6:5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs., and . IPCO, volume 3064 of Lecture Notes in Computer Science, page 132-138. Springer, (2004)A Linear Vertex Kernel for Maximum Internal Spanning Tree., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 275-282. Springer, (2009)Parameterized Complexity of Independent Set in H-Free Graphs., , , , and . Algorithmica, 82 (8): 2360-2394 (2020)Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1., , , and . Eur. J. Comb., 23 (3): 257-274 (2002)The categorical product of two 5-chromatic digraphs can be 3-chromatic., and . Discret. Math., 305 (1-3): 344-346 (2005)VC-dimension and Erdős-Pósa property., and . Discret. Math., 338 (12): 2302-2317 (2015)The Independent Set Problem Is FPT for Even-Hole-Free Graphs., , and . IPEC, volume 148 of LIPIcs, page 21:1-21:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)