2024 — Talk. Invited presentation at Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier (LIRMM). Given talk: New Menger-like dualities in digraphs and applications to half-integral linkages.

2023 — Workshop. 3rd Workshop on Complexity and Algorithms (CoA). Given talk: New Menger-like dualities in digraphs and applications to half-integral linkages.

2023 — Congress. 31st Annual European Symposium on Algorithms (ESA). Given talk: New Menger-like dualities in digraphs and applications to half-integral linkages.

2023 — Congress. 34th International Workshop on Combinatorial Algorithms (IWOCA). Given talk: On computing large temporal (unilateral) connected components.

2022 — Congress. 16th International Conference and Workshops on Algorithms and Computation (WALCOM). Given talk: Parameterized algorithms for Steiner Tree and Dominating Set: bounding the leafage by the vertex leafage.

2022 — Congress. 17th International Symposium on Parameterized and Exact Computation (IPEC). Given talk: Twin-width VIII: delineation and win-wins.

2021 — Talk. Invited online presentation at the IBS Discrete Mathematics Group (DIMAG) Virtual Discrete Math Colloquium. Given talk: Adapting the Directed Grid Theorem into an FPT algorithm.

2021 — Talk. Invited online presentation at the Max Planck Institute for Informatics (MPI). Given talk: Adapting the Directed Grid Theorem into an FPT algorithm.

2020 — Congress. 45th International Symposium on Mathematical Foundations of Computer Science (MFCS). Given talk: A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps.

2020 — Congress. 31st International Workshop on Combinatorial Algorithms (IWOCA). Given talk: Edge-disjoint branchings in temporal graphs.

2019 — Congress. 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG). Member of the organizing committee.

2018 — Workshop. VIII Latin American Workshop on Cliques in Graphs (LAWCG). Given talk: Directed tree-width is FPT.

2016 — School. São Paulo School of Advanced Science on Algorithms, Combinatorics and Optimization. Poster presentation: A Proof for a Conjecture of Gorgol.

2016 — Workshop. Bordeaux Graph Workshop (BGW). Given talk: A Proof for a Conjecture of Gorgol.

2015 — Congress. VIII Latin American Algorithms, Graphs and Optimization Symposium (LAGOS). Given talk: A Proof for a Conjecture of Gorgol.