Talks

Available slides are accessible by clicking on corresponding items.

Some of the slides are written using Slipshow. Several examples of sources are provided.

Easy and Hard Problems on Bounded-Degree Boolean Automata Networks

• ACANCOS workshop, Université de Trieste, Italie (2026)

Property testing in sparse graphs

• ANR ALARICE, "Remise en jeu" days, Aix-Marseille Université
• STACS 2026, Grenoble. Slipshow sources

On the two paths problem and theorem

• JGA 2025, Université Paris Cité Slipshow sources

Thesis defense

• PhD defense (24th of October, 2025)

Correspondences between codensity and coupling-based liftings, a practical approach

• Team PLUME's GdT, ENS de Lyon (2025)
• CSL 2025, Amsterdam, Pays-Bas
• LSC seminar, Aix-Marseille Université (2026)

A finite presentation of treewidth at most 3 graphs (20min version with slides)

• Seminar NetTCS, Pays-Bas (2024)
• ICALP 2024, Tallinn, Estonie
• JGA 2024, Université de Bourgogne, Dijon

A finite presentation of treewidth at most 3 graphs (1h blackboard version without slides)

• Team PLUME's GdT, ENS de Lyon (2024)
• Seminar Graphes@Lyon (2024)
• Seminar CANA, LIS, Aix-Marseille Université (2026)