53:28

Marcin Pilipczuk - "Bounding ε-scatter dimension via metric sparsity"

57:24

Clément Legrand-Duchesne - "Kempe recoloring of sparse graphs"

58:55

Zdeněk Dvořák - Random thoughts on Borodin-Kostochka conjecture

1:08:51

Michał Seweryn - Polynomial Bounds for the Graph Minor Structure Theorem

28:56

Eduardo Skapinakis and Marcel Ertel - Logical theories for querying NP

1:05:37

António Girão - Induced C_4-free subgraphs with high average degree

1:01:55

David Conlon - Additive combinatorics without (much) addition

1:38:00

Michał Pilipczuk - Minor testing in almost linear time