You might have heard me talking about:

2025

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