Combinatorics, Probability and Computing (2025) at Oberwolfach: Lower bounds for Ramsey numbers of bounded degree hypergraphs
Summit280 (2024) in Budapest Hungary: The growth rate of multicolor Ramsey numbers of 3-graphs (slides)
30th British Combinatorial Conference (2024) in London, UK: Ramsey numbers of hypergraphs of a given size (slides)
Constructive and Probabilistic Methods in Combinatorics (2023) in Zagreb, Croatia: Effective bounds for induced size-Ramsey numbers of cycles (slides)
Eurocomb 2023 in Prague, Czech Republic: Effective bounds for induced size-Ramsey numbers of cycles (slides)
Random Structures and Algorithms Conference 21-22 in Gniezno, Poland: Turán number of the grid (slides)
British Combinatorial Conference 2022 in Lancaster, UK: Turán numbers of sunflowers (slides)
Eurocomb 2021 online: Powers of Hamilton cycles of high discrepancy are unavoidable (slides)
ITCS 2020 in Seattle, Washington, USA: Robust Algorithms for the Secretary Problem (slides)
LSE Seminar and PhD Seminar on Combinatorics, Games and Optimisation (2025): Unique subgraphs are rare
Seminar za teoriju vjerojatnosti (Probability Theory Seminar) at PMF Zagreb (2024): Jedinstveni podgrafovi su rijetki (Unique subgraphs are rare)
IBS Korea Discrete Math Seminar (2023): Effective bounds for induced size-Ramsey numbers of cycles (slides)
Mittagsseminar at ETH Zürich (2023): Effective bounds for induced size-Ramsey numbers of cycles (slides)
Princeton Discrete Mathematics Seminar (2023): Turán number of the grid
Rutgers Discrete Mathematics Seminar (2023): Turán number of the grid
Mittagsseminar at ETH Zürich (2021): Turán numbers of sunflowers (slides)
Mittagsseminar at ETH Zürich (2020): Powers of Hamilton cycles of high discrepancy are unavoidable (slides)