Items where Author is "Bonnet, Édouard"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | No Grouping
Number of items: 11.

2016

DateAuthor/TitleDocument Type
2016Bonnet, Édouard and Escoffier, B and Paschos, V T and Stamoulis, G
A 0.821-ratio purely combinatorial algorithm for maximum k-vertex cover in bipartite graphs
Article
2016Bonnet, Édouard and Miltzow, Tillmann
An Approximation Algorithm for the Art Gallery Problem
Conference or Workshop Item
2016Bonnet, Édouard and Egri, László and Marx, Dániel
Fixed-Parameter Approximability of Boolean MinCSPs
Book Section
2016Bonnet, Édouard and Miltzow, Tillmann
Flip Distance to a Non-crossing Perfect Matching
Conference or Workshop Item
2016Bonnet, Édouard and Sikora, F
A Note on Edge Isoperimetric Numbers and Regular Graphs
Article
2016Bonnet, Édouard and Jamain, F and Saffidine, A
On the complexity of connection games
Article
2016Bonnet, Édouard and Miltzow, Tillmann
Parameterized Hardness of Art Gallery Problems
Book Section
2016Bonnet, Édouard and Miltzow, Tillmann
Parameterized Hardness of Art Gallery Problems
Conference or Workshop Item
2016Bonnet, Édouard and Brettel, Nick and Kwon, O-joung and Marx, Dániel
Parameterized vertex deletion problems for hereditary graph classes with a block property
Article
2016Bonnet, Édouard and Lampis, M and Paschos, V T
Time-approximation trade-offs for inapproximable problems
Book Section
2016Bonnet, Édouard
The complexity of playing durak
Book Section
This list was generated on Fri Dec 3 03:09:37 2021 CET.