Discrete Mathematics and Optimization Seminar

Winter Term Schedule 2007

January 8th
Monday, 4.30pm
Burnside 1205
Klaus Reinhardt
University of Tuebingen
Deterministically and Sudoku-deterministically recognizable picture languages
February 26th
Monday, 4.30pm
Burnside 1205
Dieter Rautenbach
University of Bonn
Domination in graphs of minimum degree at least two and large girth
March 5th
Monday, 4.30pm
Burnside 1205
Dhruv Mubayi
University of Illinois at Chicago
Quadruple systems with independent neighborhoods
March 12th
Monday, 4.30pm
Burnside 1205
David Hartvigsen
University of Notre Dame
A greedy algorithm for multi-jump systems
April 2th
Monday, 4.30pm
Burnside 1205
Janos Pach
City College and Courant Institute, New York
Turan-type results on intersection graphs
April 3rd
Tuesday, 4pm
McConnell 103
Jonathan Farley
University of the West Indies
Distributive lattices of small width: a problem from Stanley's Enumerative Combinatorics

Previous Seminars
Fall 2006
Winter 2006
Fall 2005
Winter 2005
Fall 2004
Winter 2004
Fall 2003
Winter 2003
Fall 2002
Winter 2002
See also the McGill Algorithms Seminar.


This seminar is jointly organised by the Department of Mathematics and Statistics
and the School of Computer Science
If you wish to be added to the seminar email list please subscribe here.
For other information contact:
Seminar Coordinator : Adrian Vetta
The other organisers are : D. Avis (CS), L. Devroye (CS), B. Reed (CS), B. Shepherd (Maths) G. Toussaint (CS), J. Verstraete (Maths) and S. Whitesides (CS).