|
Current Seminar Schedule - Winter 2009 4:30PM in Burnside 1205 unless specified.
Jan. 5th, 2009
The Dominant-Set Framework for Pairwise Data Clustering ( abstract)
Marcello Pelillo
University of Venice.
|
Jan. 14th, 2009
Gray codes and de Bruijn cycles using shifts ( abstract)
Aaron Williams
University of Victoria.
|
Jan. 26th, 2009
On Hadwiger's Graph Colouring Conjecture ( abstract)
David Wood
University of Melbourne.
|
Feb. 2nd, 2009
Gabor Sarkozy
Computer and Automation Research Institute of the Hungarian
Academy of Sciences and Worcester Polytechnic Institute.
|
Feb. 9th, 2009
Weighted colorings and Alon-Tarsi choosability. ( abstract)
Dan Hefetz
ETH Zurich.
|
Mar. 2nd, 2009
Adaptive (Analysis of) Algorithms for Convex Hulls and Related Problems ( abstract)
Jérémy Barbay
Universidad de Chile.
|
Mar. 11th, 2009
Meta-Fibonacci Recursions: Hofstadter, Conolly and Much More ( abstract)
Steve Tanny
University of Toronto.
|
Mar. 16th, 2009
The master equality polyhedron ( abstract)
Sanjeeb Dash
IBM.
|
Mar. 30th, 2009
Complexity of Embedding Simplicial Complexes in R^d ( abstract)
Uli Wagner
ETH Zurich.
|
April 6th, 2009
Embracing Hamiltonicity in Achlioptas processes ( abstract)
Michael Krivelevich
Tel Aviv University.
|
Tuesday, April 14th, 2009
Counting Crossing-free Configurations ( abstract)
MC 103, 4:00 PM
Emo Welzl
ETH.
|
April 20th, 2009
A Continuous-Discrete Symbiosis: Counting Matchings with Integrals ( abstract)
Mark Kayll
University of Montana.
|
May 1st, 2009 MC 320, 2:30 PM
Dependent Rounding and Approximation Algorithms ( abstract)
Aravind Srinivasan
University of Maryland, College Park.
|
May 11th, 2009 MC 320
Cops and robbers in random graphs ( abstract)
Gabor Kun
Institue for Advanced Study.
|
May 11th, 2009 MC 320, 10:30
Approximability of Sparse Integer Programs ( abstract)
David Pritchard
University of Waterloo.
|
May 29th, 2009 MC 320, 11:30AM
David Rappaport
Queen's University.
|
|
Previous Schedules
|
|