Edouard Bonnet

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 6

Top Topics

Subgraph Isomorphism

Graphical Structure

Parameterized Complexity

Top Venues

Oper. Res. Lett.

Publications

Edouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé
Factoring Pattern-Free Permutations into Separable ones. SODA (2024)
Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SODA (2024)
Marthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. SODA (2023)
Edouard Bonnet, Panos Giannopoulos, Michael Lampis
On the parameterized complexity of red-blue points separation. J. Comput. Geom. 10 (1) (2019)
Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
EPTAS for Max Clique on Disks and Unit Balls. FOCS (2018)
Edouard Bonnet, Florian Sikora
A note on Edge Isoperimetric Numbers and Regular Graphs. CoRR (2016)
Edouard Bonnet, Florian Jamain, Abdallah Saffidine
Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game. ACG (2015)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. Algorithmica 71 (3) (2015)
Edouard Bonnet, Michael Lampis, Vangelis Th. Paschos
Time-Approximation Trade-offs for Inapproximable Problems. CoRR (2015)
Edouard Bonnet, Florian Sikora
The parameterized complexity of Graph Motif relatively to the structure of the input graph. CoRR (2015)
Edouard Bonnet, Florian Sikora
The Graph Motif Problem Parameterized by the Structure of the Input Graph. IPEC (2015)
Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
On Subexponential and FPT-Time Inapproximability. Algorithmica 71 (3) (2015)
Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
Complexity of Grundy Coloring and Its Variants. COCOON (2015)
Edouard Bonnet, Florian Jamain, Abdallah Saffidine
Havannah and TwixT are PSPACE-complete. CoRR (2014)
Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. CoRR (2014)
Edouard Bonnet, Vangelis Th. Paschos
Sparsification and subexponential approximation. CoRR (2014)
Edouard Bonnet, Vangelis Th. Paschos
Parameterized (in)approximability of subset problems. Oper. Res. Lett. 42 (3) (2014)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
On the approximation of maximum $k$-vertex cover in bipartite graphs. CoRR (2014)
Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
Complexity of Grundy coloring and its variants. CoRR (2014)
Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. IWOCA (2014)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization. CoRR (2013)
Edouard Bonnet, Florian Jamain, Abdallah Saffidine
On the Complexity of Trick-Taking Card Games. IJCAI (2013)
Edouard Bonnet, Florian Jamain, Abdallah Saffidine
Havannah and TwixT are PSPACE-complete. Computers and Games (2013)
Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
On Subexponential and FPT-Time Inapproximability. IPEC (2013)
Edouard Bonnet, Vangelis Th. Paschos, Florian Sikora
Multiparameterizations for max $k$-set cover and related satisfiability problems. CoRR (2013)
Edouard Bonnet, Vangelis Th. Paschos
Parameterized (in)approximability of subset problems. CoRR (2013)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. IPEC (2013)