Édouard Bonnet

activity

20132026

most citedThe Graph Motif problem parameterized by the structure of the input graph

15 citations · 87 across the 33 of their papers we have counts for

collaborators

Showing 2016 · cs.CGShow all

2 papers · 2 filters

cs.CG2016

An Approximation Algorithm for the Art Gallery Problem

Édouard Bonnet, Tillmann Miltzow

Given a simple polygon $P$ on $n$ vertices, two points $x, y$ in $P$ are said to be visible to each other if the line segment between $x$ and $y$ is contained in…

cs.CG2016

The Parameterized Hardness of Art Gallery Problems

Édouard Bonnet, Tillmann Miltzow

Given a simple polygon $P$ on $n$ vertices, two points $x, y$ in $P$ are said to be visible to each other if the line segment between $x$ and $y$ is contained in…