5 citations · 15 across the 12 of their papers we have counts for
3 papers · 1 filter
The complexity of partitioning into disjoint cliques and a triangle-free graph
Marin Bougeret, Pascal Ochem
Motivated by Chudnovsky's structure theorem of bull-free graphs, Abu-Khzam, Feghali, and Müller have recently proved that deciding if a graph has a vertex partition into disjoint c…
On independent set on B1-EPG graphs
Marin Bougeret, Stephane Bessy, Daniel Gonçalves +1
In this paper we consider the Maximum Independent Set problem (MIS) on -EPG graphs. EPG (for Edge intersection graphs of Paths on a Grid) was introduced in ~\cite{edgeintersin…
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations
Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau +1
In this article we focus on the parameterized complexity of the Multidimensional Binary Vector Assignment problem (called \BVA). An input of this problem is defined by disjoint…