15 citations · 87 across the 33 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018
The inverse Voronoi problem in graphs
Édouard Bonnet, Sergio Cabello, Bojan Mohar +1
We introduce the inverse Voronoi diagram problem in graphs: given a graph with positive edge-lengths and a collection of subsets of vertices of , decide whet…
cs.DS2018
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…
cs.CG2018★ 4 cited
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 $…