Events where you might have run into me:

  1. 2023

    SODA 2023 in Florence talk: Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation

  2. 2022

    Second 2022 Barbados Graph Theory Workshop
    GROW 2022 in Koper talk: Generating Strongly 2-Connected Digraphs
    Parameterized Algorithms Retreat of University of Warsaw (PARUW 2022) in Będlewo
    Directed minors and graph structure theory 2022 (online workshop)
    AlMoTh 2022 in Bremen

  3. 2021

    Dagstuhl seminar: Sparsity in Algorithms, Combinatorics, and Logic
    ECM 2021 online talk: Graphs with two moplexes are more than perfect
    LAGOS 2021 online talk: Graphs with Two Moplexes

  4. 2020

    Parameterized Algorithms Retreat of University of Warsaw (PARUW 2020) in Krynica

  5. 2019

    KolKom 2019 in Paderborn talk: Avoidable paths in graphs
    Cycles and Colourings in the High Tatras talk: Cyclewidth: A branch decomposition for directed graphs
    Eurocomb 2019 in Bratislava
    WG2019 in Val de Nuria
    CanaDAM 2019 in Vancouver talk: Polynomial Planar Directed Grid Theorem
    SODA 2019 in San Diego talk: Polynomial Planar Directed Grid Theorem

  6. 2018

    KolKom 2018 in Paderborn talk: Perfect matching width, grids and directed cycles
    Grasta 2018 in Berlin
    Highlights of Logic, Games and Automata 2018 in Berlin
    SGT 2018 in Sète
    WG2018 in Cottbus talk: On Perfect Linegraph Squares

  7. 2017

    7th PhD Summer School in Discrete Mathematics in Rogla
    WG2017 in Heeze talk: The minimum shared edges problem on grid-like graphs

  8. 2015

    CSL 2015 in Berlin
    EXPRESS/SOS 2015 in Madrid talk: Encoding CSP into CCS

Seminar talks:

  1. 2023

    IBS Discrete Math Seminar, February 21 title: Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation

  2. 2021

    LaS Research Colloquium, February 10 title: Constant Congestion Brambles
    Graph and Matroid Seminar by The Matroid Union, February 2 title: Perfect Matching Width and a grid minor theorem for bipartite graphs

  3. 2020

    IBS Virtual Discrete Math Colloquium, November 11 title: Constant Congestion Brambles
    Koper Math Research Seminar, October 19 title: Constant Congestion Brambles
    Département Combinatoire et Algorithmique du LaBRI, April 17 title: Perfect Matching Width, Grids and Directed Cycles
    Koper Math Research Seminar, January 27 title: Avoidable paths in graphs

  4. 2019

    LaS Research Colloquium, May 22 title: Polynomial planar directed grid theorem
    LaS Research Colloquium, February 10 title: Avoidable paths in graphs