## Talks

##### Parameterized algorithms for Steiner Tree and Dominating Set: bouding the leafage by the vertex leafage (slides).

Talk in the *16th International Conference and Workshops on Algorithms and Computing ( WALCOM), 2022.*

##### Adapting the Directed Grid Theorem into an FPT algorithm (slides).

Invited online presentation at the IBS Discrete Mathematics Group (DIMAG) Virtual Discrete Math Colloquium, 2021.

##### Adapting the Directed Grid Theorem into an FPT algorithm (slides of the long version).

Invited online presentation at the Max Planck Institute for Informatics (MPI), 2021.

##### A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps (slides).

Talk in the* 45th* *International Symposium on Mathematical Foundations of Computer Science ( MFCS), 2020*.

##### Edge-disjoint branchings in temporal graphs (slides).

Talk in the *31st* *International Workshop on Combinatorial Algorithms ( IWOCA), 2020*.

##### Directed tree-width is FPT.

Talk in the* VIII Latin American Workshop on Cliques in Graphs ( LAWCG), 2018*.

##### A Proof for a Conjecture of Gorgol (slides of the long version).

Talk in the* Bordeaux Graph Workshop ( BGW), 2016*.

##### A Proof for a Conjecture of Gorgol. (slides of the long version)

Talk in the* VIII Latin and American Algorithms, Graphs and Optimization Symposium ( LAGOS), 2015.*

## Other events

*45th International Workshop on Graph-Theoretic Concepts in Computer Science ( WG), 2019.*

Member of the organizing committee.