ACiD seminars 2010/11

  2013/14  2012/13  2011/12  2010/11


Term 1
Mon 18 Oct 2010  2:15pm in E360
Peter Biro
Peter Biro
University of Glasgow
Fractional solutions for NTU-games, with applications to stable matching problems
Fri 22 Oct 2010  3:30pm in E245 Jan Foniok
Jan Foniok
ETH Zurich, Switzerland
Constructing templates with tree duality
Fri 29 Oct 2010  3:30pm in E245
Anna Huber Anna Huber
Durham
Randomized Rounding on Hypergraphs
Fri  5 Nov 2010  3:30pm in E245
Daniel Paulusma
Daniel Paulusma
Durham
On coloring graphs without induced forests
Fri 12 Nov 2010  3:30pm in E245
Marcin Jurdzinski David Richerby
Leeds
An effective dichotomy for the counting constraint satisfaction problem
Fri 19 Nov 2010  3:30pm in E245
Artem Pyatkin
Artem Pyatkin
Durham
On incidentor colorings of multigraphs (review)
Fri 26 Nov 2010  3:30pm in E245
Barnaby Martin
Barnaby Martin
Durham
A Random Walk through Infinite-domain CSP
Fri  3 Dec 2010  3:30pm in E245
Barnaby Martin Barnaby Martin
Durham
t.b.a.
Fri 10 Dec 2010  3:30pm in E245
Hajo Broersma
Hajo Broersma
Durham
t.b.a.
Term 2
Fri 21 Jan 2011  3:30pm in E360
Colin Cooper Colin Cooper
King's College London
Speeding up random walks
Mon 24 Jan 2011  2:15pm in E240
Marcin Kaminski Marcin Kaminski
Brussels, Belgium
Deciding more containment relations in planar graphs in FPT time2
Fri 28 Jan 2011  3:30pm in E360
Dimitrios Thilikos
Dimitrios Thilikos
Athens, Greece
Meta-kernels for graph problems on sparse graph classes
Fri  4 Feb 2011  3:30pm in E360
Dimitrios Thilikos Sepehr Meshkinfam
Durham
Multi-objective Cooperative Coevolutionary Genetic Algorithm for Function Optimization
Fri 11 Feb 2011  3:30pm in E360
Vladimir Kolmogorov Vladimir Kolmogorov
UCL
The complexity of conservative valued CSPs
Fri 18 Feb 2011  3:30pm in E360
David Manlove David Manlove
Glasgow
Optimising paired and pooled kidney exchanges
Fri 25 Feb 2011  3:30pm in E360
Lars Nagel Lars Nagel
Durham
t.b.a.
Fri  4 Mar 2011  3:30pm in E360
Petr Golovach Petr Golovach
Durham
Complexity of Cops and Robber Game
Wed  9 Mar 2011  3:30pm in E245 
Petr Golovach Russ Martin
Liverpool
The Complexity of Approximately Counting Stable Matchings
Fri 18 Mar 2011  3:30pm in E360
Marcin Jurdzinski Marcin Jurdzinski
Warwick
Algorithms for solving infinite games on graphs
Term 3
Fri  6 May 2011  3:30pm in E360
Marcin Jurdzinski
Jiri Fiala
Charles University, Prague
Computational complexity of some graph covering problems
Fri 13 May 2011  3:30pm in E245
Marcin Jurdzinski Stefan Dantchev
Durham
Undirected Connectivity in Log-Space
Fri  3 Jun 2011  3:30pm in E245
Igor Razgon Igor Razgon
Leicester
A progress towards understanding the kernelizability of the multiway cut problem