Computational Geometry & Topology / Discrete Algorithms

Last updated: 20 March 2014

Meetings are informal, and typically use the whiteboard or blackboard (not slides). Topics so far:

Coming talks for 2014
    TBA
Past talks for 2014
12 February 2014
67-442
11am–12pm
Ben Burton A simpler proof that 3-sphere recognition is in NP
19 February 2014
67-442
11am–12pm
Mitchell Riley Introduction to persistent homology
26 February 2014
67-442
11am–12pm
Jenna Thompson Parameterised complexity, coloured subgraphs and motifs
13 March 2014
67-641
11am–12pm
Dan Crane Simplification heuristics for triangulations in topology
20 March 2014
67-641
11am–12pm
Trent Marbach Transversals in latin squares
27 March 2014
67-641
11am–12pm
Nitin Singh Introduction to the probabilistic method
17 April 2014
67-641
11am–12pm
Jonathan Spreer Normal surfaces and combinatorial bounds
29 May 2014
67-641
11am–12pm
Padraig Keane The Lovász local lemma

(Back to home page...)