10:45 - 11:00 Welcome coffee
11:00 - 11:30 Tom van der Zanden: Shapley values of graphs of bounded treewidth
11:30 - 12:00 Sandor Kisfaludi-Bak: ETH-tight algorithms on geometric intersection graphs
12:00 - 12:30 Tony Huynh: Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank
12:30 - 13:30 Lunch
13:30 - 14:00 Jesper Nederlof: A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
14:00 - 14:30 Marieke van der Wegen: An algorithm to recognize graphs of gonality 2
14:30 - 15:00 Krystal Guo: Transversals in covers of graphs
15:00 - 15:15 Coffee break
15:15 - 15:45 Astrid Pieterse: Polynomial kernels for hitting forbidden minors using constant treedepth modulators
15:45 - 16:15 Philipp Kuinke: Barabasi-Albert graphs are somewhere dense
16:15 - 16:45 Jan Dreier: Efficient FO-model checking on Barabasi-Albert Graphs
16:45 - 17:30 Drinks and goodbye
11:00 - 11:30 Tom van der Zanden: Shapley values of graphs of bounded treewidth
11:30 - 12:00 Sandor Kisfaludi-Bak: ETH-tight algorithms on geometric intersection graphs
12:00 - 12:30 Tony Huynh: Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank
12:30 - 13:30 Lunch
13:30 - 14:00 Jesper Nederlof: A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
14:00 - 14:30 Marieke van der Wegen: An algorithm to recognize graphs of gonality 2
14:30 - 15:00 Krystal Guo: Transversals in covers of graphs
15:00 - 15:15 Coffee break
15:15 - 15:45 Astrid Pieterse: Polynomial kernels for hitting forbidden minors using constant treedepth modulators
15:45 - 16:15 Philipp Kuinke: Barabasi-Albert graphs are somewhere dense
16:15 - 16:45 Jan Dreier: Efficient FO-model checking on Barabasi-Albert Graphs
16:45 - 17:30 Drinks and goodbye
