Research

International Conferences

[21] Édouard Bonnet, Panos Giannopoulos, and Michael Lampis. On the Parameterized Complexity of Red-Blue Points Separation. IPEC, 2017. [pdf ]
[20] Édouard Bonnet, Nick Brettell, O-joung Kwon, and Dániel Marx. Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms. IPEC, 2017. [pdf ]
[19] Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, and Abdallah Saffidine. The Parameterized Complexity of Positional Games. ICALP, 2017. [pdf ]
[18] Édouard Bonnet and Tillmann Miltzow. Approximation Algorithm of the Art Gallery Problem. SoCG, 2017. [pdf ]
[17] Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, and Paweł Rzążewski. Fine-grained complexity of coloring unit disks and balls. SoCG, 2017. [pdf ]
[16] Édouard Bonnet, Tillmann Miltzow, and Paweł Rzążewski. Complexity of Token Swapping and its Variants. STACS, 2017. [pdf ]
[15] Édouard Bonnet and Tillmann Miltzow. Parameterized Hardness of Art Gallery Problems. ESA, 2016. [ arxiv | pdf ]
[14] Édouard Bonnet, László Egri, and Dániel Marx. Fixed-parameter Approximability of Boolean MinCSPs. ESA, 2016. [ arxiv | pdf ]
[13] Édouard Bonnet, Nick Brettell, O-joung Kwon, and Dániel Marx. Parameterized vertex deletion problems for hereditary graph classes with a block property. WG, 2016. [ arxiv | pdf ]
[12] Édouard Bonnet. The Complexity of Playing Durak. IJCAI, 2016. [pdf ]
[11] Édouard Bonnet, Michael Lampis, and Vangelis Th. Paschos. Time-Approximation Trade-offs for Inapproximable Problems. STACS, 2016. [arxiv | pdf ]
[10] Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, and Georgios Stamoulis. A 0.821-ratio purely combinatorial algorithm for maximum k-vertex cover in bipartite graphs. LATIN, 2016. [arxiv ]
[9] Édouard Bonnet and Florian Sikora. The Graph Motif problem parameterized by the structure of the input graph. IPEC, 2015. [pdf ]
[8] Édouard Bonnet, Florent Foucaud, Eun Jung Kim, and Florian Sikora. Complexity of grundy coloring and its variants. COCOON, 2015. [ bib | arxiv ]
[7] Édouard Bonnet, Florian Jamain, and Abdallah Saffidine. Draws, Zugzwangs, and PSPACE-completeness in the Slither Connection Game. In ACG, 2015. [pdf ]
[6] Faisal N. Abu-Khzam, Édouard Bonnet, and Florian Sikora. On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. In IWOCA, 2014. [pdf ]
[5] Édouard Bonnet and Abdallah Saffidine. On the Complexity of General Game Playing. In CGW, 2014. [pdf ]
[4] Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, and Émeric Tourniaire. Multi-parameter complexity analysis for constrained size graph problems: Using greediness for parameterization. In Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, pages 66--77, 2013. [ bib | DOI | arxiv ]
[3] Édouard Bonnet, Bruno Escoffier, Eun Jung Kim, and Vangelis Th. Paschos. On subexponential and fpt-time inapproximability. In Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, pages 54--65, 2013. [ bib | DOI | pdf ]
[2] Édouard Bonnet, Florian Jamain, and Abdallah Saffidine. On the complexity of trick-taking card games. In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, 2013. [ bib | pdf ]
[1] Édouard Bonnet, Florian Jamain, and Abdallah Saffidine. Havannah and twixt are pspace-complete. In Computers and Games - 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers, pages 175--186, 2013. [ bib | DOI | pdf ]

International Journals

[11] Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, and Georgios Stamoulis. Purely Combinatorial Approximation Algorithms for Maximum $k$-Vertex Cover in Bipartite Graphs. Discrete Optimization, 2017.
[10] Faisal N. Abu-Khzam, Édouard Bonnet, and Florian Sikora. On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. TCS, 2017. [pdf ]
[9] Édouard Bonnet and Florian Sikora. The Graph Motif problem parameterized by the structure of the input graph. Discrete Applied Mathematics, 2017. [ pdf ]
[8] Édouard Bonnet and Vangelis Th. Paschos. Sparsification and subexponential approximation. Acta Informatica, 2017. [ bib | arxiv ]
[7] Édouard Bonnet and Vangelis Th. Paschos. Dual parameterization and parameterized approximability of subset graph problems. RAIRO, 2017. [pdf ]
[6] Édouard Bonnet, Vangelis Th. Paschos, and Florian Sikora. Multiparameterizations for max k-set cover and related satisfiability problems. RAIRO, 2016. [ bib | arxiv ]
[5] Édouard Bonnet, Florian Jamain, and Abdallah Saffidine. On the Complexity of Connection Games. TCS, 2016. [arxiv | pdf ]
[4] Édouard Bonnet and Florian Sikora. A Note on Edge Isoperimetric Numbers and Regular Graphs. IJFCS, 2016. [arxiv | pdf ]
[3] Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, and Émeric Tourniaire. Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. Algorithmica, 71(3):566-580, 2015. [DOI | pdf ]
[2] Édouard Bonnet, Bruno Escoffier, Eun Jung Kim, and Vangelis Th. Paschos. On subexponential and fpt-time inapproximability. Algorithmica, 71(3):541--565, 2015. [DOI | pdf ]
[1] Édouard Bonnet and Vangelis Th. Paschos. Parameterized (in)approximability of subset problems. Oper. Res. Lett., 42(3):222--225, 2014. [ bib | DOI | pdf ]

Workshops and other contributions

[7] Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, and Paweł Rzążewski. Fine-grained complexity of coloring unit disks and balls. EuroCG, 2017. [pdf ]
[6] Édouard Bonnet and Tillmann Miltzow. Parameterized Hardness of Art Gallery Problems. EuroCG 2016. [pdf ]
[5] Édouard Bonnet and Tillmann Miltzow. An Approximation Algorithm for the Art Gallery Problem. EuroCG 2016. [pdf ]
[4] Édouard Bonnet and Tillmann Miltzow. Flip Distance to a Non-crossing Perfect Matching. EuroCG 2016. [pdf ]
[3] Édouard Bonnet and Abdallah Saffidine. Complexité des Jeux. (in french) Bulletin de la ROADEF, 31:9-12, January 2014. Invited. [pdf ]
[2] Édouard Bonnet. Using greediness for parameterization. ECCO, 2013.
[1] Édouard Bonnet. Balance between time complexity and approximation ratio. ROADEF, 2013.

Manuscripts

[1] Édouard Bonnet and Tillmann Miltzow. Flip Distance to a Non-crossing Perfect Matching. CoRR, abs/1601.04935, 2016. [ arxiv | pdf ]
[2] Édouard Bonnet and Abdallah Saffidine. The Importance of Rank in Trick-Taking Card Games. [pdf ]
[3] Édouard Bonnet, Paweł Rzążewski, and Florian Sikora. Designing RNA secondary structures is NP-hard. [pdf ]

Talks

Generalized feedback vertex set problems on bounded-treewidth graphs, IPEC, Vienna (September 2017)
On the parameterized complexity of red-blue points separation, IPEC, Vienna (September 2017)
Fine-grained complexity of coloring unit disks and balls, SoCG, Brisbane (July 2017)
Subexponential algorithms in non sparse classes of graphs (chalk talk), FU noon seminar, Berlin (June 2017)
Subexponential algorithms in non sparse classes of graphs, ENS Lyon (May 2017)
Subexponential algorithms in non sparse classes of graphs, Lamsade seminar, Paris (April 2017)
Fine-grained complexity of coloring unit disks and balls, EuroCG, Malmö (April 2017)
Fine-grained complexity of coloring unit disks and balls, ACiD group seminar, Durham (February 2017)
Fine-grained complexity of coloring unit disks and balls, Algorithmique distribuée et graphes group seminar, IRIF, Paris (February 2017)
Fine-grained complexity of coloring unit disks and balls, ToCAI group seminar, Middlesex, London (January 2017)
Fine-grained complexity of coloring unit disks and balls, MC2 group seminar, ENS Lyon (December 2016)
Talk on the paper of Hales, Manuch, Ponty, and Stacho "Combinatorial RNA Design: Designability and Structure-Approximating Algorithm", weekly seminar, Budapest (October 2016).
Fixed-parameter Approximability of Boolean MinCSPs, ESA, Aarhus (August 2016)
Parameterized Hardness of Art Gallery Problems, ESA, Aarhus (August 2016)
Fixed-parameter Approximability of Boolean MinCSPs, weekly seminar, Budapest (August 2016)
The Complexity of Playing Durak, IJCAI, New York (July 2016) (and the poster)
Talk on the paper of Fomin, Gaspers, Lokshtanov and Saurabh "Exact Algorithms via Local Search", weekly seminar, Budapest (July 2016)
Parameterized Hardness of Art Gallery Problems, EuroCG, Lugano (April 2016)
Flip Distance to a Non-crossing Perfect Matching, EuroCG, Lugano (March 2016)
TikZ in 10 minutes, weekly seminar, Budapest (March 2016)
The parameterized hardness of Art Gallery problems, weekly seminar, Budapest (November 2015)
On the Complexity of Grundy Coloring and Its Variants, weekly seminar, Budapest (October 2015)
The Graph Motif problem parameterized by the structure of its input graph, IPEC, Patras (September 2015)
On the Complexity of Grundy Coloring and Its Variants, COCOON, Beijing (August 2015)
Super-polynomial Time Approximability of Inapproximable Problems, weekly seminar, Budapest (July 2015)
Super-polynomial Time Approximability of Inapproximable Problems, LIRMM, Montpellier (April 2015)
Positive and Negative Results in Approximation and Parameterized Complexity, Paris-Dauphine (November 2014)
On the Complexity of Grundy Coloring and Its Variants, LAMSADE, Paris (September 2014)
Parameterized Complexity of Cardinality-Constraint Problems in Bipartite Graphs, AGaPe GDR RO, Jussieu, Paris (June 2014)
On the complexity of games, LAMSADE, Paris (October 2013)
On Subexponential and FPT-time Inapproximability IPEC, Antibes (September 2013)
Using greediness for parameterization, IPEC, Antibes (September 2013)
Using greediness for parameterization, ECCO, Paris (May 2013)
More bridge complexity, Paris (April 2013)
Hiérarchie de Chomsky, LAMSADE, Paris (February 2013)
Balance between time complexity and approximation ratio, ROADEF, Troyes (February 2013)
Bridge complexity, LAMSADE, Paris (December 2012)
Parameterized complexity of a cut problem, LAMSADE, Paris (September 2012)
Are binary idempotent commutative operations tractables? LIX, Polytechnique (May 2011)

This file was generated by bibtex2html 1.98.

Last modified: 2017-9-9