Édouard Bonnet

According to our database1, Édouard Bonnet authored at least 66 papers between 2013 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Time-approximation trade-offs for inapproximable problems.
J. Comput. Syst. Sci., 2018

Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs.
Discrete Optimization, 2018

Complexity of Grundy coloring and its variants.
Discrete Applied Mathematics, 2018

EPTAS for Max Clique on Disks and Unit Balls.
CoRR, 2018

Complexity of Token Swapping and Its Variants.
Algorithmica, 2018

Sparsification and subexponential approximation.
Acta Inf., 2018

Optimality Program in Segment and String Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Designing RNA Secondary Structures Is Hard.
Proceedings of the Research in Computational Molecular Biology, 2018

Orthogonal Terrain Guarding is NP-complete.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
On the complexity of various parameterizations of common induced subgraph isomorphism.
Theor. Comput. Sci., 2017

Dual parameterization and parameterized approximability of subset graph problems.
RAIRO - Operations Research, 2017

The Graph Motif problem parameterized by the structure of the input graph.
Discrete Applied Mathematics, 2017

Optimality Program in Segment and String Graphs.
CoRR, 2017

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs.
CoRR, 2017

Designing RNA Secondary Structures is Hard.
CoRR, 2017

On the Parameterized Complexity of Red-Blue Points Separation.
CoRR, 2017

Orthogonal Terrain Guarding is NP-complete.
CoRR, 2017

The Parameterized Complexity of Positional Games.
CoRR, 2017

Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms.
CoRR, 2017

Complexity of Token Swapping and its Variants.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

On the Parameterized Complexity of Red-Blue Points Separation.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

The Parameterized Complexity of Positional Games.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

An Approximation Algorithm for the Art Gallery Problem.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Fine-Grained Complexity of Coloring Unit Disks and Balls.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
On the complexity of connection games.
Theor. Comput. Sci., 2016

Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems.
RAIRO - Theor. Inf. and Applic., 2016

A Note on Edge Isoperimetric Numbers and Regular Graphs.
Int. J. Found. Comput. Sci., 2016

A note on Edge Isoperimetric Numbers and Regular Graphs.
CoRR, 2016

Complexity of Token Swapping and its Variants.
CoRR, 2016

An Approximation Algorithm for the Art Gallery Problem.
CoRR, 2016

The Parameterized Hardness of the Art Gallery Problem.
CoRR, 2016

Flip Distance to a Non-crossing Perfect Matching.
CoRR, 2016

On the Complexity of Connection Games.
CoRR, 2016

Fixed-parameter Approximability of Boolean MinCSPs.
CoRR, 2016

Parameterized vertex deletion problems for hereditary graph classes with a block property.
CoRR, 2016

Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Time-Approximation Trade-offs for Inapproximable Problems.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

The Complexity of Playing Durak.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Parameterized Hardness of Art Gallery Problems.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Fixed-Parameter Approximability of Boolean MinCSPs.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
The parameterized complexity of Graph Motif relatively to the structure of the input graph.
CoRR, 2015

Time-Approximation Trade-offs for Inapproximable Problems.
CoRR, 2015

Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization.
Algorithmica, 2015

On Subexponential and FPT-Time Inapproximability.
Algorithmica, 2015

The Graph Motif Problem Parameterized by the Structure of the Input Graph.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Complexity of Grundy Coloring and Its Variants.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game.
Proceedings of the Advances in Computer Games - 14th International Conference, 2015

2014
Positive and Negative Results in Approximation and Parameterized Complexity. (Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée).
PhD thesis, 2014

Parameterized (in)approximability of subset problems.
Oper. Res. Lett., 2014

Sparsification and subexponential approximation.
CoRR, 2014

Havannah and TwixT are PSPACE-complete.
CoRR, 2014

Complexity of Grundy coloring and its variants.
CoRR, 2014

On the approximation of maximum $k$-vertex cover in bipartite graphs.
CoRR, 2014

On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism.
CoRR, 2014

On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

On the Complexity of General Game Playing.
Proceedings of the Computer Games - Third Workshop on Computer Games, 2014

2013
Multiparameterizations for max $k$-set cover and related satisfiability problems.
CoRR, 2013

Parameterized (in)approximability of subset problems.
CoRR, 2013

Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization.
CoRR, 2013

Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

On Subexponential and FPT-Time Inapproximability.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

On the Complexity of Trick-Taking Card Games.
Proceedings of the IJCAI 2013, 2013

Havannah and TwixT are PSPACE-complete.
Proceedings of the Computers and Games - 8th International Conference, 2013


  Loading...