Edouard Bonnet

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