A parameterised point of view on forming small coalitions. G²OAT seminar, November 2024. Link.
Complexity of Finding a Maximum Locally Irregular Induced Subgraph. G²OAT seminar, November 2022. Link.
Connexions ! Le jeu du plus grand sous-graphe connexe. AlgoTel 2021, Septemebr 2021. Link (in French).
Solving Multiagent Path Finding on Highly Centralized Networks. AAAI, February 2025. Slides.
Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. AAAI, February 2025. Slides.
A parameterised point of view on forming small coalitions. JGA, November 2024. Slides.
Exact Algorithms and Lowerbounds for Multiagent Pathfinding. GAMoC seminar, March 2024. Slides.
Recontamination helps a lot to hunt a rabbit. MFCS, September 2023. Slides.
Ph.D. defense: Edge-labellings, vertex-colourings and combinatorial games on graphs. September 2022. Slides.
On the Role of 3’s for the 1-2-3 Conjecture. CIAC, May 2021. Slides.
On variations of the 1-2-3 Conjecture. JGA, November 2020. Slides.
On Proper Labellings of Graphs with Minimum Label Sum. IWOCA, June 2020. Slides.
BMRN* Colouring of digraphs. JGA, November 2019. Slides.