
2023
SODA 2023 in Florence talk: Fixedparameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twinwidth meets flowaugmentation 
2022
GROW 2022 in Koper talk: Generating Strongly 2Connected DigraphsParameterized Algorithms Retreat of University of Warsaw (PARUW 2022) in BędlewoDirected minors and graph structure theory 2022 (online workshop) 
2021
ECM 2021 online talk: Graphs with two moplexes are more than perfectLAGOS 2021 online talk: Graphs with Two Moplexes 
2020
Parameterized Algorithms Retreat of University of Warsaw (PARUW 2020) in Krynica 
2019
KolKom 2019 in Paderborn talk: Avoidable paths in graphsCycles and Colourings in the High Tatras talk: Cyclewidth: A branch decomposition for directed graphsCanaDAM 2019 in Vancouver talk: Polynomial Planar Directed Grid TheoremSODA 2019 in San Diego talk: Polynomial Planar Directed Grid Theorem 
2018
KolKom 2018 in Paderborn talk: Perfect matching width, grids and directed cyclesWG2018 in Cottbus talk: On Perfect Linegraph Squares 
2017
WG2017 in Heeze talk: The minimum shared edges problem on gridlike graphs 
2015
EXPRESS/SOS 2015 in Madrid talk: Encoding CSP into CCS