Term 1
|
||
Week 1 Wed 9 Oct 2013 5:00pm in E245 |
![]() |
Chris Dowden Royal Holloway Agreement Protocols in the Presence of a Mobile Adversary |
Week 2 Wed 16 Oct 2013 5:00pm in E245 |
![]() |
Barnaby Martin Middlesex Distance Constraint Satisfaction Problems |
Week 3 |
![]() |
Steve
Chaplick Charles University, Prague Max Point-Tolerance Graphs |
Week 4 |
![]() |
Justin Ward Warwick Maximising Bisubmodular and k-Submodular Functions |
Week 5 |
![]() |
Thomas Sauerwald Cambridge Balls into Bins via Local Search |
Week 6 |
![]() |
Friedrich Slivovsky TU Vienna Variable Dependencies of Quantified Boolean Formulas |
Week 7 |
![]() |
LMS meeting "Network coding, partitions and security" |
Week 8 |
![]() |
Oded Lachish Birkbeck Improved Competitive Ratio for the Matroid Secretary Problem |
Week 9 |
![]() |
Alejandro Erickson Durham Tatami Coverings |
Week 10 |
![]() |
Joel Ouaknine Oxford Decision Problems for Linear Recurrence Sequences |
Term 2
|
||
Week 11 |
![]() |
Colin Cooper King's College London Algorithmic applications of random walks to large networks |
Week 12
|
![]() |
Petr Golovach Bergen, Norway Editing to a connected graph of given degrees |
Week 13 |
![]() |
Viresh Patel Queen Mary A domination algorithm for {0,1}-instances of the travelling salesman problem |
Week 14 |
![]() |
Heng Guo Wisconsin Complexity Dichotomies for Counting Problems |
Week 15 |
![]() |
Kathleen Steinhoefel King's Peek-a-boo with Protein Structure Candidates |
Week 16 |
![]() |
Dieter Kratsch Metz, France AT-free graphs: structure and algorithms |
Week 17 |
![]() |
Matthias Englert Warwick Reordering Buffer Managment |
Week 18 |
![]() |
Stéphane Vialette LIGM, Université Paris-Est Marne-la-Vallée On recognizing words that are squares for the shuffle product |
Week 19 |
![]() |
Piotr Krysta Liverpool Online Mechanism Design (Randomized Rounding on the Fly) |
Term 3
|
||
Week 20 |
![]() |
Charles Semple University of Canterbury, N.Z. What is a typical matroid? |
Week 21 |
![]() |
Vitaly Kurlin Durham (Maths) A fast and robust algorithm to count topologically persistent holes in noisy clouds |
Week 22 |
![]() |
Magnus Wahlström Royal Holloway Half-integrality, LP-branching and FPT Algorithms |
Week 23 |
![]() |
Shenwei Huang Simon Fraser, Vancouver, Canada Complexity of Coloring Graphs without Paths and Cycles |
Week 24 |
![]() |
Paul Bonsma Twente, NL Independent Set Reconfiguration in Cographs |
Week 25 |
![]() |
Søren Riis Queen Mary Dynamic communication networks and a new type of problems in Universal Algebra |
Week 26 |
![]() |
Adrien Richard CNRS, University of Nice, France Convergence of boolean networks without negative cycle |
Week 27 |