Two days of algorithms (and complexity) in London, UK
Martin Dyer Day, 16th July 2018 ♦ Queen Mary Algorithms Day (QMAD), 17th July 2018
We are pleased to announce two days of meetings on Algorithms and Computational Complexity at Queen Mary, University of London, on Monday 16th and Tuesday 17th July, 2018. On Monday we celebrate the career of Martin Dyer, with a programme of talks by friends and collaborators. On Tuesday, there will be an Algorithms Day, following the no-frills model that has been established in a sequence of meetings at several sites in the UK,
including
Bristol,
Liverpool,
Middlesex,
Oxford and
Warwick.
Martin Dyer Day, Monday 16th July 2018
The Martin Dyer celebration is co-organised by Colin Cooper (King’s College, University of London), Leslie Ann Goldberg (University of Oxford) and Mark Jerrum (Queen Mary, University of London).
Speakers
Jin-Yi Cai, University of Wisconsin, Madison,
Classification for counting problems
Alan Frieze, Carnegie Mellon University, Coloring (random) hypergraphs
Catherine Greenhill, University of New South Wales, Sampling graphs in at least two ways
Ravi Kannan
Microsoft Research, India, Spectral rounding
Colin McDiarmid, University of Oxford, On the modularity of random graphs G(n,p)
Haiko Müller, University of Leeds,
The switch chain on perfect matchings
Leen Stougie, Centrum Wiskunde en Informatica, Amsterdam, A decomposition theory for vertex enumeration of convex polyhedra
Eric Vigoda, Georgia Tech, Path coupling and belief propagation
Schedule
Coffee and pastries will be available from 09:45, and the first talk will be at 10:30.
A schedule is now available.
Queen Mary Algorithms Day (QMAD) Tuesday 17th July 2018
Speakers
Miriam Backens, University of Oxford, Holant problems and quantum information theory
Holger Dell, Universität des Saarlandes, How to detect and count small subgraphs efficiently
John Fearnley, University of Liverpool, End of Potential Line.
Andreas Galanis
University of Oxford, Inapproximability of the independent set polynomial in the complex plane
Heng Guo,
University of Edinburgh, A polynomial-time approximation algorithm for all-terminal network reliability
Viresh Patel,
University of Amsterdam, Zero-free regions and approximation algorithms for graph polynomials
László Végh,
London School of Economics, A simpler and faster strongly polynomial algorithm for generalized flow maximization
Schedule
The first talk will be at 10:00.
A schedule is now available.
Practicalities
Registration is required, but free. You may register here.
Detailed directions for reaching the Mile End campus
can be found here.
Talks will take place in the ArtsTwo building, which is number 35 on the
campus map.
It lies roughly half way between Stepney Green (District, and Hammersmith and City line) and Mile End (District, Hammersmith and City, and Central line) stations. Plan your journey here.
