Participants are encouraged to make use of the GatherTown social space for informal discussions before and after the talks and during breaks - joining details will be sent to registered participants.
10:30 - 10:35 | Welcome |
10:35 - 11:20 | Stefanie Gerke (Royal Holloway, University of London) The k-th shortest s-t path in weighted complete graphs |
11:25 - 12:10 | John Lapinskas (University of Bristol) When does approximate counting have the same running time as decision? |
14:00 - 14:45 | Bridget Webb (The Open University) Fraïssé limits of Steiner triple systems |
14:50 - 15:35 | Richard Mycroft (University of Birmingham) Spanning trees and tree-like graphs in dense directed graphs |
Applications Session | |
10:30 - 10:55 | Zoe O'Connor (National Records Scotland) Census Coverage Adjustment Methodology |
11:00-11:25 | Ewan Colman (University of Edinburgh) Counting walks on a temporal network to reveal the drivers of disease propagation |
11:30 - 11:55 | Jason Smith (Nottingham Trent University) Using Combinatorics to Classify Functional Brain Data |
14:00 - 14:45 | Fiona Skerman (Uppsala University) Partially observing graphs - when can we infer underlying community structure? |
14:50 - 15:35 | Erik Jan van Leeuwen (Utrecht University) Algorithms for planar graphs: From bidimensionality to Steiner Tree |