Mikkel Abrahamsen (Kopenhagen):
A framework for ∃R-completeness of two-dimensional packing problems

 Tillmann Miltzow (Utrecht):
A practical algorithm with performance guarantees for the art-gallery problem

 Sophie Spirkl (Waterloo):
k-coloring graphs with forbidden induced subgraphs

 Markus Bläser (Saarbrücken):
Irreversibility of tensors of minimal border rank and barriers for fast matrix multiplication

 Lisa Sauermann (IAS, Princeton):
On the extension complexity of low-dimensional polytopes

 15:00 Kemal Rose:
 16:00 Filippos Christodoulou:
Design and Analysis of Combinatorial Problems in Random Intersection Graphs

 15:00 Alp Müyesser:
Rainbow factors and trees