Noon lectures 2021

• Alexandra Lassota: Approximation Algorithms for Scheduling with Class Constraints Using Integer Linear Programming (September 7, 2021, 12:20)
• Benjamin Moore: Some recent Nine Dragon Tree style results (October 21, 2021, 12:20)
• Arturo Merino : Efficient generation of rectangulations via permutation languages (October 14, 2021, 12:20)
• Torsten Mütze: Efficient generation of elimination trees and Hamilton paths on graph associahedra (October 12, 2021, 14:00)
• Kristóf Huszár: Towards thin triangulations of 3-manifolds (November 4, 2021, 12:20)
• Pierre Aboulker: Extending the Gyarfas-Sumner conjecture to digraphs (May 20, 2021, 12:30)
• Maria Chudnovsky: Induced subgraphs and tree decompositions (May 14, 2021, 15:00)
• Isolde Adler: Logical meta-theorems and lower bounds for bounded-degree property testing (April 22, 2021, 12:30)
• Ron Aharoni: The colorful world of rainbow sets (April 8, 2021, 12:30)
• Kristina Vušković: Even-hole-free graphs with bounded degree have bounded treewidth (March 25, 2021, 12:30)
• Pavel Paták: Abstract Radon theorem (February 22, 2021, 12:30)