ACiD seminars 2011/12

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

Term 1

Thu  6 Oct 2011  4:00pm in E360

Erik Jan van Leeuwen
University of Bergen, Norway
Firefighting with Algorithms

Contact: Daniel
Thu 13 Oct 2011  4:00pm in E245
Nikolaos Fountoulakis
Birmingham
Random graphs on spaces of negative curvature

Contact: Ross
Thu 20 Oct 2011  4:00pm in E245
Sergey Kitaev
Strathclyde
On graphs representable by words

Contact: Artem
Thu 27 Oct 2011  4:00pm in E245
George Mertzios
Durham
Natural Models for Evolution on Networks

Thu  3 Nov 2011  4:00pm in E245
Mary Cryan
Edinburgh
The number of Euler tours of a random d-in/d-out graph

Contact: Tom
Thu 10 Nov 2011  4:00pm in E245
Prudence Wong
Liverpool
Energy efficient job scheduling with speed scaling and sleep management

Contact: Tom
Thu 17 Nov 2011  4:00pm in E245
Charles Semple
University of Canterbury, Christchurch, New Zealand
Realizing phylogenies with local information

Contact: Magnus
Thu 24 Nov 2011  4:00pm in E245
Tobias Müller
CWI Amsterdam, the Netherlands
Some results on geometric representations of graphs

Contact: Ross

Thu  1 Dec 2011  4:00pm in E245
Jean-Sébastien Sereni
CNRS, LIAFA (Paris Denis Diderot)
Odd cycles in Planar Graphs

Contact: Ross
Thu  8 Dec 2011  4:00pm in E245
Haiko Müller
Leeds
Colouring AT-free graphs

Contact: Daniel
Term 2
Thu 19 Jan 2012  4:00pm in E245
Bernard Ries
Université Paris Dauphine
d-Transversals of Stable Sets and Vertex Covers in Weighted Bipartite Graphs

Contact: Daniel

Thu 26 Jan 2012  4:00pm in E245
Catherine Greenhill
University of New South Wales
Making Markov chains less lazy

Contact: Magnus

Thu  2 Feb 2012  4:00pm in E245
Stanislav Živný
Oxford
Soft Constraints for Optimisation

Contact: Barny
Thu  9 Feb 2012  4:00pm in E245
Max Gadouleau
Durham
Computing without memory
  
Thu 16 Feb 2012  4:00pm in E245
Juraj Stacho
Warwick
Induced matchings and independence complexes of chordal graphs

Contact: Barny/Daniel

Thu 23 Feb 2012  4:00pm in E245
Jian Song
Durham
Coloring H-Free Graphs
Thu  1 Mar 2012  4:00pm in E245
Dieter Kratsch
Metz, France
Minimal Dominating Sets in Graphs: Enumeration, Combinatorial Bounds and Graph Classes

Contact: Daniel
Thu  8 Mar 2012  4:00pm in E245
Kousha Etessami
Edinburgh
Polynomial-Time Algorithms for Multi-type Branching Processes and Stochastic Context-Free Grammars

Contact: Andrei
Wed 14 Mar 2012  1:00pm in E245

notice date&time are
different from the usual
Pedro Gonnet
Durham
High-Performance Computing and the need for good Graph Algorithms