researcher

Stéphan Thomassé

61 papers hereh-index 354.4k citations140 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

first author1
middle author18
last author42

Across the 61 of 61 papers where every author was matched, so the position is known.

fields

math.CO22
cs.DS17
cs.DM13
cs.CC3
cs.CG1
cs.LO1

same name

Stéphan Thomassé — 10 papers, h 6
Stéphan Thomassé — 10 papers, h 3
Stéphan Thomassé — 3 papers, h 1
Stéphan Thomassé — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity

20062023

most citedThe Domination Number of Grids

115 citations · 430 across the 53 of their papers we have counts for

collaborators

Showing 2023 · cs.DSShow all

2 papers · 2 filters

cs.DS2023

Lossy Kernelization for (Implicit) Hitting Set Problems

Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov +3

We re-visit the complexity of kernelization for the $d$ -Hitting Set problem. This is a classic problem in Parameterized Complexity, which encompasses several other of the most well…

cs.DS2023

Maximum Independent Set when excluding an induced minor: $K_{1} + t K_{2}$ and $t C_{3} ⊎ C_{4}$

Édouard Bonnet, Julien Duron, Colin Geniet +2

Dallard, Milanič, and Štorgel [arXiv '22] ask if for every class excluding a fixed planar graph $H$ as an induced minor, Maximum Independent Set can be solved in polynomial time, a…

Lossy Kernelization for (Implicit) Hitting Set Problems

Maximum Independent Set when excluding an induced minor: K1​+tK2​ and tC3​⊎C4​

Maximum Independent Set when excluding an induced minor: $K_{1} + t K_{2}$ and $t C_{3} ⊎ C_{4}$