Talks

Meta-Theorems for Cuttable Distributed Problems.

PODC 2026 Slides
Distributed algorithms and local structures in graphs.

Thesis defense at LaBRI, Bordeaux Slides
Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors.

ENEDISC meeting, LaBRI, Bordeaux Slides

Induced Disjoint Paths Without an Induced Minor.

JGAs 2025 Slides
Induced Disjoint Paths Without an Induced Minor.

ICALP 2025 Slides
Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors.

PODC 2025 Slides
Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors.

AlgoDist seminar, LaBRI, Bordeaux Slides

Asymptotic dimension, distributed algorithms, and local graph concepts.

Graph Theory Seminar, Pilsen Slides
Algorithmes distribués et dimension asymptotique.

JGAs 2024 Slides
Locally finding small dominating sets in K_{2,t}-minor-free graphs.

Discrete Mathematics Seminar, TU Berlin Slides

Locally finding small dominating sets in K_{2,t}-minor-free graphs.

JGAs 2023 Slides
Brief Announcement: Distributed Derandomization Revisited.

DISC 2023 Slides
Locally finding small dominating sets in K_{2,t}-minor-free graphs.

AlGCo seminar, LIRMM, Montpellier Slides
A parameterized approximation scheme for the 2D-Knapsack problem with wide items.

AlGCo seminar, LIRMM, Montpellier Slides
Brief Announcement: Distributed Derandomization Revisited.

AlgoDist seminar, LaBRI, Bordeaux Slides
A parameterized approximation scheme for the 2D-Knapsack problem with wide items.

IPEC 2023 Slides
Locally approximating dominating sets in K_{2,t}-minor-free graphs.

MIMUW seminar, Warsaw

Locally approximating dominating sets in K_{2,t}-minor-free graphs.

GO seminar, LaBRI, Bordeaux

You might have heard me talking about: