Skip to main content


Friday 8 July

1400-1405Iain StewartWelcome to Durham
1405-1505Carsten ThomassenVariations on Grötzsch’s Theorem
1505-1535David ManloveStudent-project allocation with preferences over projects
1600-1630Henning FernauAsymptotically faster algorithms for the parameterized face cover problem
1630-1700Frances RosamondAn O*(2O(k)) FPT algorithm for the undirected feedback vertex set problem
1700-1730Bill JacksonOn the rank function of the 3-dimensional rigidity matroid

Saturday 9 July

0915-0945Oliver KullmannHypergraph colouring and autarkies
0945-1015Argimiro ArratiaSecond order proportional quantifiers, definability and computational complexity
1015-1045Thomas ErlebachPrimal-dual distributed algorithms for covering and facility location problems
1115-1145Gregory GutinFinding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
1145-1215Andreas SpillnerA faster algorithm for the minimum weight triangulation problem with few inner points
1215-1245Alexander BorovikStratification of complexity of algorithmic problems in combinatorial group theory
1415-1515Pavel PudlákQuantum Deduction Rules
1515-1545Christian SloperFixed parameter set splitting, linear kernel and improved running time
1615-1645Prabhu ManyemSyntactic characterisations of polynomial-time optimisation classes
1645-1715Alexei VernitskiList colouring as a model of computation

Sunday 10 July

0930-1000Herbert FleischnerMaximum independent vertex sets in hamiltonian 4-regular graphs
1000-1030M. V. Panduranga RaoQuantum Finite Automata and Weighted Automata
1030-1100Anders YeoOptimal on-line bin packing with two item sizes
1130-1200Alexander TiskinEfficient representation and parallel computation of string-substring longest common subsequences
1200-1300Michael FellowsFixed-parameter tractability is polynomial-time extremal structure theory
1415-1445Paul BonsmaSpanning trees with many leaves in graphs with minimum degree three
1445-1515Faisal N Abu KhzamLinear-time algorithms for problems on planar graphs of fixed disk dimension
1545-1615Kathie CameronFinding a minimum colouring or a Meyniel obstruction in any graph
1615-1645Jan van den HeuvelThe external network problem and the source location problem