| 9:45 - 10:20 | Coffee |
| 10:20 - 10:30 | Welcome |
| 10:30 - 11:30 | Thomas Erlebach (Durham University) On Reachability Graphs of Temporal Graphs |
| 11:30 - 12:30 | Jane Tan (University of Oxford) Colouring t-perfect graphs |
| 12:30 - 13:45 | Lunch |
| 13:45 - 14:45 | Natalie Behague (University of Warwick) Colour-biased Hamilton cycles in subgraphs of the random graph |
| 14:45 - 16:00 | Tea and Student Poster Presentations |
| 16:00 - 17:00 | Colva Roney-Dougal (University of St Andrews) Counting groups |
| 9:30 - 10:00 | Coffee |
| 10:00 - 11:00 | He Sun (University of Edinburgh) Dynamic Spectral Clustering with Provable Approximation Guarantee |
| 11:00 - 12:00 | Francesca Arrigo (University of Strathclyde) Walk this way: non-k-cycling walks in complex networks |
| 12:00 - 13:15 | Lunch |
| 13:15 - 14:15 | Yiannis Giannakopoulos (University of Glasgow) On the Smoothed Complexity of Combinatorial Local Search, and Congestion Games |
| 14:15 - 15:05 | Short Postdoc Talks Abhiram Natarajan (University of Warwick): Partitioning Theorems for Sets of Semi-Pfaffian Sets, with Applications David Kutner (University of Glasgow): MIS, begotten: Generalizing the maximal independent set algorithm with Boolean Networks |
| 15:05 - 15:35 | Tea |
| 15:35 - 16:35 | Jan van den Heuvel (LSE) Independent sets in triangle-free graphs |