Below is an incomplete list of some of the talks I gave (I stopped updating this in May 2024).
May 22, 2024, Oxford one-day meeting in combinatorics, Reconstruction from distance queries (plenary talk)
May 2, 2024, Leiden probability seminar, Decomposing random permutations
April 15-17, 2024, Postgraduate Combinatorial Conference (PCC) in London, Labelling schemes and universal graphs (plenary talk)
February 8, 2024, Flajolet seminar in Paris, List colouring trees and new parameterized complexity classes
February 5-7, 2024, Journées de combinatoire de Bordeaux (JCB), Counting graphic sequences via integrated random walks (plenary talk)
January 22, 2024, NETWORKS heidag consortium, Tight bounds for reconstructing graphs from distance queries (plenary talk)
January 8, 2024, Aussois Combinatorial Optimization Workshop, Skipless chain decompositions and improved poset saturation bounds (plenary talk)
November 23 or 24, 2023, DIAMANT symposium, Tight bounds for reconstructing graphs from distance queries (plenary talk)
October 27, 2023 Alice & Eve 2023, Why combinatorics is useful for (theoretical) computer science (plenary talk).
October 13, 2023 Graz Combinatorics Seminar at TU Graz, Austria, Graph reconstruction from small cards
October 2, 2023 Applied probability seminar in Delft: Counting graphic sequences via integrated random walks.
September 12, 2023 SPOR seminar in Eindhoven: Counting graphic sequences via integrated random walks.
August 9-11, 2023 Belgium Graph Theory Conference in Ghent: Skipless chain decompositions and antichain saturation (contributed talk).
May 10-11, 2023 London Colloquia in Combinatorics in London: Skipless chain decompositions and antichain saturation (plenary talk).
April 20, 2023 Workshop Combinatorics in Digital Communication in Eindhoven: Skipless chains in the Boolean lattice (contributed talk).
March 29, 2023 General Math Colloquium talk at University of Amsterdam: Graph theory proof of why surfaces are (asymptotically) two-dimensional.
December 1, 2022, Discrete Mathematics seminar in Grenoble, List Colouring Trees in Logspace and Related Results.
November 22, 2022, Dutch Optimization Seminar, CWI, List Colouring Trees in Logspace and Related Results (slides).
September 5, 2022, European Symposium on Algorithms, Potsdam, List Colouring Trees in Logspace.
May 12, 2022, Dutch Day of Combinatorics, Graph reconstruction (plenary talk).
May 4, 2022, CWI seminar, Optimal Labelling Schemes for Adjacency, Comparability, and Reachability.
April 22, 2022, Combinatorial Carousel in Nijmegen (organised by Ross Kang for the PhD defense of Stijn Cambie), Graphs of low average degree without independent transversals (plenary talk).
February 10, 2022, OR seminar at Tilburg university, Graph reconstruction from small cards.
December 7, 2021, Parametrized complexity and discrete optimization workshop, Tight bounds for counting colourings parameterised by cutwidth via matrix ranks (for experts, video).
November 30, 2021, Durham ACiD seminar, Tight bounds for counting colourings parameterised by cutwidth via matrix ranks.
November 24, 2021, Warwick combinatorics seminar, Asymptotic dimension of graph classes.
October 14, 2021, Utrecht Applied Maths seminar, Cyclically covering subspaces.
October 8, 2021, Lyon Graph Theory seminar, Hypercube intersection patterns (board talk).
July 1, 2021, MoCCA 2021, Graph reconstruction from small cards (video).
June 28, 2021, Graphs and Matroids seminar, Universal Graphs and Labelling Schemes (video).
June 24, 2021, STOC 2021, Optimal Labelling Schemes for Adjacency, Comparability, and Reachability (video).
June 8, 2021, Round the World Relay in Combinatorics (Bordeaux edition), Universal Graphs and Labelling Schemes (video).
June 1, 2021, Algorithms seminar at Utrecht University, Universal Graphs and Labelling Schemes.
April 6, 2021, Algorithms seminar at Utrecht University, Graph reconstruction from partial information.
April 1, 2021, What is… seminar, What is graph reconstruction?
March 25, 2021, Grenoble online seminar on graph theory and algorithms, Graph reconstruction from partial information (video).
October 26, 2020, Webinar in additive combinatorics, Cyclically Covering Subspaces (video).
October 20, 2020, Algorithms seminar at Utrecht University, Three-colouring P_t-free graphs in subexponential time.
September 23, 2020, PIMS-SFU Women in Discrete Mathematics Seminar, Asymptotic dimension of graph classes (video).
June 16, 2020, Dynamics and combinatorics seminar at the University of Amsterdam, Cyclically covering subspaces (2h talk).
May 28, 2020, Women in Combinatorics Virtual Colloquium, Reconstruction from small cards (video).
March 17, 2020, Banff workshop New Perspectives in Colouring and Structure, Three-colouring P_t-free graphs in subexponential time (video).
February 18, 2020, Combinatorics Seminar at University of Bristol, Reconstruction from a partial deck.
February 11, 2020, Junior Applied Mathematics Seminar at University of Warwick, Cyclically Covering Subspaces (for general maths audience).
January 10, 2020, Seminar at Univeristy of Bordeaux, Cyclically Covering Subspaces.
November 21, 2019, Discrete Mathematics Seminar at Princeton University, Cyclically Covering Subspaces.
November 7, 2019 Combinatorics seminar at Univeristy of Cambridge, Intersection sizes of linear subspaces with the hypercube (board talk).
November 6, 2019, 10-minute presentation at the Graduate Open Day at Oxford.
August 16, 2019, St. John’s Mathematics Summer Camp for Girls in Cambridge, Board talk about graph reconstruction (exercises, solutions).
February 7, 2019 Combinatorics, Games, and Optimisation Seminar at London School of Economics (LSE), Size reconstruction from a partial deck
February 1, 2019 Combinatorics seminar at Queen Mary University of London, Intersection sizes of linear subspaces with the hypercube (board talk).
January 22, 2019 DIMAP Seminar, University of Warwick, Size reconstruction from a partial deck.
November 13, 2018 Combinatorial Theory Seminar, University of Oxford, Intersection sizes of linear subspaces with the hypercube (board talk).
June 2018 Postgraduate Combinatorial Conference LSE, 3-colouring P_t-free graphs in subexponential time.
October 2017 Ramsey theory seminar Oxford, Capset problem.
June 2017 Combinatorics seminar UvA, Sunflower conjecture and slice-rank method.
March 2017 Combinatorics seminar UvA, Frankl-Wilson theorem and Borsuk’s conjecture.
November 2016 Combinatorics seminar UvA, Subgame-perfect outcomes in singleton symmetric congestion games (material from my master thesis).