|
Programme
Two-page PDF schedule PDF schedule with all the
abstracts
Monday 22 May
0930–1030 coffee / tea
1030–1035 welcome
1035–1125 Ruth
Hoffmann (University
of St Andrews)
Between Subgraph
Isomorphism and Maximum Common Subgraph:
How to make faster algorithms [SLIDES]
1125–1215 Akshay
Gupte (University of Edinburgh)
Submodular
maximization over easy knapsack constraints
1215–1330 lunch
1330–1420 Ciaran McCreesh
(University of Glasgow)
Is your
combinatorial search algorithm telling the truth? [SLIDES]
1420–1510 Torsten Mütze (University of Warwick)
Combinatorial
generation: graphs, algorithms, polytopes, and optimization
1510–1545 tea / coffee
1545–1610 Emma
Smith (Royal Holloway University of London)
A combinatorics
and crypt applications sandwich:
Distinct difference configurations for wireless sensor networks [SLIDES]
1610–1635 Gemma
Crowe (Heriot-Watt University)
Conjugacy,
languages and groups [SLIDES]
1635–1700 Dan
Threlfall (University of Strathclyde)
Thresholds for
patterns in random permutations
1700–1725 Namrata (University of Warwick)
Kneser graphs are
Hamiltonian [SLIDES]
1845 dinner
The Italian Kitchen
Tuesday 23 May
0930–1020 Jess Enright (University of Glasgow)
Cops-and-robbers
on multilayer graphs [SLIDES]
1020–1100 coffee / tea
1100–1150 Katherine Staden
(The Open University)
Transversal embeddings [SLIDES]
1150–1215 Bishal
Deb (University College London)
Laguerre digraphs and continued fractions [SLIDES]
1215–1330 lunch
1330–1420 Simon Blackburn (Royal Holloway University of London)
Permutations that
separate close elements [SLIDES]
1420–1510 Robert Brignall (The Open University)
Well-quasi-ordering
permutations [SLIDES]
1510–1545 tea / coffee
1545–1610 Laura
Johnson (University of St Andrews)
Applications of
partial difference families to partial designs
1610–1700 Natasha Blitvić (Queen
Mary University of London)
Combinatorial
moment sequences [SLIDES]
|
