3rd Parameterized Algorithms and Computational Experiments Challenge, PACE ceremony, IPEC, Helsinki (August 2018)

QPTAS and Subexponential Algorithm for Maximum Clique on Disks, SoCG, Budapest (June 2018)

Orthogonal Terrain Guarding is NPcomplete, SoCG, Budapest (June 2018)

EPTAS for Maximum Clique on Disks and Unit Balls , Lorentz Center, Leiden (May 2018)

Designing RNA Secondary Structures is Hard, RECOMB, Paris (April 2018)

Maximum Clique on Disks 2, LIGM seminar, MarnelaVallée (March 2018)

Maximum Clique on Disks 2, LIF seminar, Marseille (March 2018)

Maximum Clique on Disks, GSCOP seminar, Grenoble (December 2017)

Generalized feedback vertex set problems on boundedtreewidth graphs, IPEC, Vienna (September 2017)

On the parameterized complexity of redblue points separation, IPEC, Vienna (September 2017)

Finegrained 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)

Finegrained complexity of coloring unit disks and balls, EuroCG, Malmö (April 2017)

Finegrained complexity of coloring unit disks and balls, ACiD group seminar, Durham (February 2017)

Finegrained complexity of coloring unit disks and balls, Algorithmique distribuée et graphes group seminar, IRIF, Paris (February 2017)

Finegrained complexity of coloring unit disks and balls, ToCAI group seminar, Middlesex, London (January 2017)

Finegrained 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 StructureApproximating Algorithm", weekly seminar, Budapest (October 2016).

Fixedparameter Approximability of Boolean MinCSPs, ESA, Aarhus (August 2016)

Parameterized Hardness of Art Gallery Problems, ESA, Aarhus (August 2016)

Fixedparameter 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 Noncrossing 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)

Superpolynomial Time Approximability of Inapproximable Problems, weekly seminar, Budapest (July 2015)

Superpolynomial Time Approximability of Inapproximable Problems, LIRMM, Montpellier (April 2015)

Positive and Negative Results in Approximation and Parameterized Complexity, ParisDauphine (November 2014)

On the Complexity of Grundy Coloring and Its Variants, LAMSADE, Paris (September 2014)

Parameterized Complexity of CardinalityConstraint Problems in Bipartite Graphs, AGaPe GDR RO, Jussieu, Paris (June 2014)

On the complexity of games, LAMSADE, Paris (October 2013)

On Subexponential and FPTtime 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)
