Talks
Twin-width and contraction sequences, habilitation defense, Lyon (April 2024) |
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes, (chalk talk) Lyon Graph Meeting (March 2024) |
Introduction to twin-width, Dresden seminar (December 2023) |
Introduction to twin-width, Dresden seminar (December 2023) |
Classes Excluding a (Planar) Graph as an Induced Minor, graph theory seminar, Warsaw (November 2023) |
Twin-width and Logic, combprob2023, Leeds (November 2023) |
Twin-width (5h class + 2.5h tutorial), Structural Graph Theory Bootcamp, Warsaw (September 2023) |
Small But Unwieldy, CoA, Paris (September 2023) |
Twin-width and Logic, Highlights, Kassel (July 2023) |
A gentle introduction to twin-width, Computer Science seminar, Liverpool (January 2023) |
Maximum Independent Set in induced-minor-free graphs (chalk talk), Barbados (December 2022) |
Algorithmic developments using twin-width, CoA workshop, Paris (September 2022) |
An algorithmic weakening of the Erdős-Hajnal Conjecture, British Combinatorial Conference, Lancaster (July 2022) |
Twin-width delineation and win-wins, Graph Width Parameters, (July 2022) |
The geometry of twin-width, Datashape seminar, (June 2022) |
Twin-width IV: ordered graphs and matrices, STOC recorded talk, (May 2022) |
Graph decompositions and their algorithms, Marseille, (May 2022) |
Twin-width and parameterized complexity, PARUW3, (April 2022) |
Twin-width and ordered binary structures, AlGCo online seminar (December 2021) |
Algorithms based on contraction sequences, Journées Graphes et Algorithmes (November 2021) |
Twin-width and Sparsity, Dagstuhl workshop on Sparsity (September 2021) |
Twin-width, IPEC Tutorial (September 2021) |
Approximation algorithm for Diameter, or lack thereof, LIS online seminar, Marseille (July 2021) |
4 vs 7 sparse undirected unweighted Diameter is SETH-hard at time n^{4/3} (video), ICALP recorded talk (July 2021) |
Twin-width (video), WG invited talk (June 2021) |
Twin-width for digraphs, ANR DIGRAPHS meeting (June 2021) |
Twin-width, Workshop on Structural Graph Theory, CANADAM (May 2021) |
Introduction to twin-width, journées CALAMAR (April 2021) |
Twin-width and ordered binary structures, Virtual Discrete Math Colloquium, KAIST (March 2021) |
Inapproximability of Diameter in super-linear time: Beyond the 5/3 ratio (video), STACS recorded talk (March 2021) |
Twin-width and ordered binary structures, group seminar, Bordeaux (February 2021) |
Twin-width, tutorial at Bremen University, (January 2021) |
Twin-width I: tractable model checking (video), FOCS recorded talk, (November 2020) |
Twin-width (video), Frontiers of parameterized complexity seminar, online, (October 2020) |
Twin-width, Utrecht Algorithms seminar, online, (September 2020) |
Presentation of a part of Pilipczuk and Siebertz's paper "Polynomial bounds for centered colorings on proper minor-closed graph classes",
french Virtual Meeting in Graph Theory, on the general topic of the product structure theorem (May 2020) |
Twin-width (video), IRIF seminar, online, (May 2020) |
When Maximum Stable Set can be computed in FPT time, Montpellier (March 2020) |
Maximum Matchings in Geometric Intersection Graphs, STACS, Montpellier (March 2020) |
Grundy Coloring & friends, Half-Graphs, Bicliques, STACS, Montpellier (March 2020) |
When Maximum Stable Set can be computed in FPT time, ISAAC, Shanghai (December 2019) |
When Maximum Stable Set can be computed in FPT time (video), Daejeon, Korea (July 2019) |
Potential Maximum Cliques and their Algorithmic applications (chalk talk), Belgrade (April 2019) |
EPTAS for Maximum Clique on Disks and Unit Balls, FOCS, Paris (October 2018) |
Maximum Independent Set in H-free graphs, group seminar, LRI, Orsay (October 2018) |
Fine-Grained Complexity of Problems in P, GT CoA, IRIF, Paris (October 2018) |
Maximum Independent Set in H-free graphs, group seminar, Bordeaux (September 2018) |
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 NP-complete, 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, Marne-la-Vallée (March 2018) |
Maximum Clique on Disks 2, LIF seminar, Marseille (March 2018) |
Maximum Clique on Disks, G-SCOP seminar, Grenoble (December 2017) |
On the parameterized complexity of red-blue points separation, Gangneung, Korea (September 2017) |
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 tractable? LIX, Polytechnique (May 2011) |