Tutte Seminar Series, Dept. of Combinatorics & Optimization, Fall 2010

Regular time and location:  Fridays at 3:30pm in room MC 5158.

Date Speaker Title Host
Sep 10, 2010 Joachim von zur Gathen
B-IT, University of Bonn, Germany
Census of polynomials Mark Giesbrecht
Sep 17, 2010 Joseph Cheriyan
University of Waterloo
Approximation algorithms for min-cost (S,T) connectivity  
Sep 24, 2010 Vijay Vazirani
Georgia Institute of Technology
The Invisible Hand of the Market: Algorithmic Ratification and the Digital Economy Jochen Könemann
Oct 1, 2010 Chris Godsil
University of Waterloo
State Transfer on Graphs  
Oct 8, 2010 Nick Harvey
University of Waterloo
Graph Sparsifiers  
Oct 15, 2010 Peter Nelson
University of Waterloo
Growth Rates in Minor-Closed Classes of Matroids  
Oct 22, 2010 Ron Graham
University of California, San Diego
The combinatorics of solving linear equations Jochen Könemann
Oct 29, 2010 Ashwin Nayak
University of Waterloo
The Index function and the space complexity of Dyck languages  
Nov 5, 2010 Dan Younger
University of Waterloo
(adjunct, emeritus)
From 3-colorings to 3-flows  
Nov 12, 2010 William Matthews
University of Waterloo
Entanglement assisted zero error coding Debbie Leung
Nov 19, 2010 David Jao
University of Waterloo
Constructing Elliptic Curve Isogenies in Quantum Subexponential Time  
Nov 26, 2010 Ricardo Fukasawa
University of Waterloo
Branch-and-cut-and-price approaches to some combinatorial optimization problems  
Dec 3, 2010 Nick Wormald
University of Waterloo
Asymptotic enumeration of sparse 2-connected graphs and strongly connected digraphs  
Dec 10, 2010 Costis Georgiou SDP Integrality Gaps for Constraint Satisfaction Problems, from Pairwise Independence  

Seminars from previous terms
Spring 2010 Winter 2010 Fall 2009
Spring 2009 Winter 2009 Fall 2008
Spring 2008 Winter 2008 Fall 2007