Skip to main content

Programme

Durham University

Monday 20 September

1100
Registration in Grey College
1230Lunch
1355-1400Hajo BroersmaWelcome
1400-1500Dieter KratschExact exponential algorithms. Abstract (html).
1500-1530Mumtaz AhmadSequential computation of mappings over the field and set of integers. Abstract (html).
Tea/Coffee
1600-1700Rahul SanthanamBeating brute force search for formula satisfiability and QBF validity. Abstract (html).
1700-1730Christian LavaultA note on an extension of Prufer’s encoding for a forest of uniform hypertrees. Abstract (html).
1830
Dinner

Tuesday 21 September

0800-0900
Breakfast
0930-1030Bill Jackson
Constructing long cycles in graphs. Abstract (html).


Tea/Coffee
1100-1130Alexei VernitskiAstral graphs as a generalisation of star graphs and decomposing graphs into astral graphs. Abstract (html)
1130-1200Alexander TiskinApproximate matching in grammar-compressed strings. Abstract (html).
1200-1230Barnaby MartinThe complexity of positive equality-free first-order logic. Abstract (html).
1230
Lunch
1400-1500Sarah ReesUsing automata in geometric group theory. Abstract (html).
1500-1530Standa ZivnyHybrid tractability of soft constraint problems. Abstract (html).


Tea/Coffee
1600-1630Angelica PachonThe decimation process in random k-SAT. Abstract (html). Slides (pdf).
1630-1700Manuel SorgeA parameterized view on Golomb ruler construction. Abstract (html).
1830
Dinner

Wednesday 22 September

0800-0900
Breakfast
0930-1030Amin Coja-OghlanPhase transitions and computational complexity. Abstract (html).


Tea/Coffee
1100-1130Chiranjit ChakrabortyInstance compression for the polynomial hierarchy and beyond. Abstract (html).
1130-1200Paul HaynesDynamic graph-based search in unknown environments. Abstract (html).
1200-1230Ross KangInduced matchings in subcubic planar graphs. Abstract (html).
1230
Lunch