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