All lectures will take place in IF-4.31/4.33 (4th floor of the Informatics Forum). Coffee, tea and lunches will be in MF2, on Level 4.

There is a pdf file containing all the abstracts here.

Thursday 26th April

10:15 - 10:55Coffee/Tea
10:55 - 11:00Welcome
11:00 - 11:45 Radu Curticipean (Copenhagen)
The complexity of graph motif parameters
11:50 - 12:45 Early career short talks
 Alexander Evetts (Heriot-Watt): Growth of virtually abelian groups
 Carl-Fredrik Nyberg Brodda (St Andrews): Topics in Graph Pebbling
12:45 - 13:45Lunch
13:45 - 14:30Colva Roney-Dougal (St Andrews)
The generating graph of a finite group
14:35 - 15:20Heng Guo (Edinburgh)
A polynomial-time approximation algorithm for all-terminal network reliability
15:20 - 16:00Coffee/Tea
16:00 - 16:45Will Perkins (Birmingham)
Kissing numbers in high dimensions via a hard core model

Friday 27th April

9:45 - 10:30Iain Moffat (Royal Holloway, University of London)
The Tutte polynomial of a graph and its extensions
10:30 - 11:00Coffee/Tea
11:10 - 11:55Steve Noble (Birkbeck, University of London)
Embedded graphs and delta-matroids
12:00 - 12:45Early career short talks
 Elena Zamaraeva (Warwick): On the specification number of threshold functions
 Tomas Selig (Strathclyde): Permutation graphs, tiered trees and the Abelian sandpile model
12:45 - 13:45Lunch
13:45 - 14:40Kristina Vuskovic (Leeds)
Algorithms for (theta, wheel)-free graphs
14:40 - 15:25 Early career short talks
 Christoforos Panagiotis (Warwick): Analyticity of percolation density on Z^2
 William Pettersson (Glasgow)
Computational approaches to solving the cycle decomposition problem
15:25 - 16:00Coffee/Tea
16:00 - 16:45Peter Cameron (St Andrews)
Equitable partitions of Latin square graphs