15 citations · 87 across the 33 of their papers we have counts for
8 papers · 1 filter
An Approximation Algorithm for the Art Gallery Problem
Édouard Bonnet, Tillmann Miltzow
Given a simple polygon on vertices, two points in are said to be visible to each other if the line segment between and is contained in…
Complexity of Token Swapping and its Variants
Édouard Bonnet, Tillmann Miltzow, Paweł Rzążewski
In the Token Swapping problem we are given a graph with a token placed on each vertex. Each token has exactly one destination vertex, and we try to move all the tokens to their des…
On the Complexity of Connection Games
Édouard Bonnet, Florian Jamain, Abdallah Saffidine
In this paper, we study three connection games among the most widely played: Havannah, Twixt, and Slither. We show that determining the outcome of an arbitrary input position is PS…
Parameterized vertex deletion problems for hereditary graph classes with a block property
Édouard Bonnet, Nick Brettell, O-joung Kwon +1
For a class of graphs , the Bounded -Block Vertex Deletion problem asks, given a graph on vertices and positive integers and , whether ther…
The Parameterized Hardness of Art Gallery Problems
Édouard Bonnet, Tillmann Miltzow
Given a simple polygon on vertices, two points in are said to be visible to each other if the line segment between and is contained in…
Flip Distance to a Non-crossing Perfect Matching
Édouard Bonnet, Tillmann Miltzow
A perfect straight-line matching on a finite set of points in the plane is a set of segments such that each point in is an endpoint of exactly one segment. is non-c…
A note on Edge Isoperimetric Numbers and Regular Graphs
Edouard Bonnet, Florian Sikora
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It shows an equivalence between regular graphs and graphs for which a sequence of in…
Fixed-parameter Approximability of Boolean MinCSPs
Édouard Bonnet, László Egri, Bingkai Lin +1
The minimum unsatisfiability version of a constraint satisfaction problem (MinCSP) asks for an assignment where the number of unsatisfied constraints is minimum possible, or equiva…