ACiD seminars 2013/14

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


Term 1

Week 1

Wed  9 Oct 2013  5:00pm in E245

Dowden Chris Dowden
Royal Holloway
Agreement Protocols in the Presence of a Mobile Adversary

Week 2

Wed 16 Oct 2013  5:00pm in E245

Martin Barnaby Martin
Middlesex
Distance Constraint Satisfaction Problems
Week 3

Wed 23 Oct 2013  5:00pm in E245
Chaplick Steve Chaplick
Charles University, Prague
Max Point-Tolerance Graphs
Week 4

Wed 30 Oct 2013  5:00pm in E245
Ward Justin Ward
Warwick
Maximising Bisubmodular and k-Submodular Functions
Week 5

Wed 6 Nov 2013  5:00pm in E245
Sauerwald Thomas Sauerwald
Cambridge
Balls into Bins via Local Search
Week 6

Wed 13 Nov 2013  5:00pm in E245
Slivovski Friedrich Slivovsky
TU Vienna
Variable Dependencies of Quantified Boolean Formulas
Week 7

Wed 20 Nov 2013  2:00pm in E245
LMS
LMS meeting "Network coding, partitions and security"
Week 8

Wed 27 Nov 2013  5:00pm in E245
Lachish Oded Lachish
Birkbeck
Improved Competitive Ratio for the Matroid Secretary Problem
Week 9

Wed 4 Dec 2013  5:00pm in E245
Erickson Alejandro Erickson
Durham
Tatami Coverings
Week 10

Wed 11 Dec 2013  5:00pm in E245
Ouaknine Joel Ouaknine
Oxford
Decision Problems for Linear Recurrence Sequences
Term 2
Week 11

Wed 22 Jan 2014  5:00pm in E245
Cooper Colin Cooper
King's College London
Algorithmic applications of random walks to large networks
Week 12

Wed 29 Jan 2014  5:00pm in E245
Golovach Petr Golovach
Bergen, Norway
Editing to a connected graph of given degrees
Week 13

Wed 5 Feb 2014  5:00pm in E245
Patel Viresh Patel
Queen Mary
A domination algorithm for {0,1}-instances of the travelling salesman problem
Week 14

Wed 12 Feb 2014  5:00pm in E245
Guo Heng Guo
Wisconsin
Complexity Dichotomies for Counting Problems
Week 15

Wed 19 Feb 2014  5:00pm in E245
Steinhoefel Kathleen Steinhoefel
King's
Peek-a-boo with Protein Structure Candidates
Week 16

Wed 26 Feb 2014  5:00pm in E245
Kratsch Dieter Kratsch
Metz, France
AT-free graphs:  structure and algorithms
Week 17

Wed 5 Mar 2014  5:00pm in E245
Englert Matthias Englert
Warwick
Reordering Buffer Managment
Week 18

Wed 12 Mar 2014  5:00pm in E245
Vialette Stéphane Vialette
LIGM, Université Paris-Est Marne-la-Vallée
On recognizing words that are squares for the shuffle product

Week 19

Wed 19 Mar 2014  5:00pm in E245
Krysta Piotr Krysta
Liverpool
Online Mechanism Design (Randomized Rounding on the Fly)

Term 3
Week 20

Wed 30 Apr 2014  5:00pm in E245
Semple Charles Semple
University of Canterbury, N.Z.
What is a typical matroid?

Week 21

Wed 7 May 2014  5:00pm in E245
Kurlin Vitaly Kurlin
Durham (Maths)
A fast and robust algorithm to count topologically persistent holes in noisy clouds
Week 22

Wed 14 May 2014  5:00pm in E245
Wahlstroem Magnus Wahlström
Royal Holloway
Half-integrality, LP-branching and FPT Algorithms
Week 23

Wed 21 May 2014  5:00pm in E245
Huang Shenwei Huang
Simon Fraser, Vancouver, Canada
Complexity of Coloring Graphs without Paths and Cycles
Week 24

Wed 28 May 2014  5:00pm in E245
Bonsma Paul Bonsma
Twente, NL
Independent Set Reconfiguration in Cographs
Week 25

Wed 4 Jun 2014  5:00pm in E245
Riis Søren Riis
Queen Mary
Dynamic communication networks and a new type of problems in Universal Algebra
Week 26

Wed 11 Jun 2014  5:00pm in E245
Richard Adrien Richard
CNRS, University of Nice, France
Convergence of boolean networks without negative cycle
Week 27

Wed 18 Jun 2014  5:00pm in E245