#### Filter Results:

- Full text PDF available (31)

#### Publication Year

2013

2018

- This year (7)
- Last 5 years (49)
- Last 10 years (49)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
- Algorithmica
- 2014

We study the parameterized complexity of a broad class of problems called “local graph partitioning problems” that includes the classical fixed cardinality problems as max $$k$$ k -vertex cover,… (More)

- Édouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
- Algorithmica
- 2013

Fixed-parameter algorithms, approximation algorithms and moderately exponential algorithms are three major approaches to algorithm design. While each of them being very active in its own, there is an… (More)

- Édouard Bonnet, Tillmann Miltzow
- Symposium on Computational Geometry
- 2017

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 P. The Point Guard Art Gallery problem asks for a… (More)

- Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
- COCOON
- 2015

- Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx
- IPEC
- 2017

It has long been known that Feedback Vertex Set can be solved in time 2Opw logwqnOp1q on graphs of treewidth w, but it was only recently that this running time was improved to 2OpwqnOp1q, that is, to… (More)

- Édouard Bonnet, Tillmann Miltzow
- ArXiv
- 2016

A perfect straight-line matching M on a finite set P of points in the plane is a set of segments such that each point in P is an endpoint of exactly one segment. M is non-crossing if no two segments… (More)

- Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski
- STACS
- 2017

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 destinations, using… (More)

- Édouard Bonnet, Tillmann Miltzow
- ESA
- 2016

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 P. The point guard art gallery problem asks for a… (More)

- Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos
- STACS
- 2016

- Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski
- Symposium on Computational Geometry
- 2017

On planar graphs, many classic algorithmic problems enjoy a certain “square root phenomenon” and can be solved significantly faster than what is known to be possible on general graphs: for example,… (More)