115 citations · 430 across the 53 of their papers we have counts for
4 papers · 1 filter
Parameterized Complexity of Independent Set in H-Free Graphs
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit +2
In this paper, we investigate the complexity of Maximum Independent Set (MIS) in the class of -free graphs, that is, graphs excluding a fixed graph as an induced subgraph. Given…
EPTAS for Max Clique on Disks and Unit Balls
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet +2
We propose a polynomial-time algorithm which takes as input a finite set of points of and compute, up to arbitrary precision, a maximum subset with diameter at most $…
Edge-decomposing graphs into coprime forests
Tereza Klimošová, Stéphan Thomassé
The Barat-Thomassen conjecture, recently proved in [Bensmail et al.: A proof of the Barat-Thomassen conjecture. J. Combin. Theory Ser. B, 124:39-55, 2017.], asserts that for every…
Separation choosability and dense bipartite induced subgraphs
Louis Esperet, Ross J. Kang, Stéphan Thomassé
We study a restricted form of list colouring, for which every pair of lists that correspond to adjacent vertices may not share more than one colour. The optimal list size such that…