Program
Monday, September 14
- 9:10 Opening
- 9:15 - 10:15 Zoltan Füredi, A useful combinatorial concept: Intersecting set-pair systems
- 10:15 - 10:30 Coffee Break
- 10:30 Open Mind Award Introduction
-
10:40 - 12:20 nominees' talks alphabetically (30 minutes each)
- 10:40 - 11:10 Jakub Konieczny, Automatic sequences from the perspective of additive combinatorics
- 11:15 - 11:45 Jakub Tarnawski, New Graph Algorithms via Polyhedral Techniques
- 11:50 - 12:20 Marcin Wrochna, Graph structure useful for approximation problems
- 12:30 Award Ceremony
Tuesday, September 15
- 9:15 - 13:00 Tutorial I: Shagnik Das, Erdős-Ko-Rado: Structure and Sparsification ( problems )
Wednesday, September 16
- 9:15 - 10:15 Anita Liebenau, The random graph intuition in Maker-Breaker games: The threshold bias of the clique-factor game
- 10:30 - 11:30 Amin Coja-Oghlan, Group testing
- 11:45 - 12:45 Thore Husveldt, Algebraic Graph Algorithms
Thursday, September 17
- 9:15 - 13:00 Tutorial II: Michał Pilipczuk, Structural sparsity in graphs
Friday, September 18
- 9:15 - 10:15 Sandi Klavžar, Domination games
- 10:30 - 11:30 Imre Leader, Decomposing the Complete r-Graph