Discrete Mathematics and Optimization Seminar

Winter Term Schedule 2004

January 19th
Monday, 4.30pm
Burnside 1205
Avner Magen
University of Toronto
Sublinear Geometric Algorithms

February 9th
Monday, 4.30pm
Burnside 1205

Bill Steiger
Rutgers University
The Convex Hull of Random Hyperplanes

February 16th
Monday, 4.30pm
Burnside 1205

Tamir Tassa
The Open University and Ben Gurion University
Hierarchical Threshold Secret Sharing

March 1st
Monday, 4.30pm
Burnside 1205

Samuel Fiorini
Universite Libre de Bruxelles and GERAD - HEC
How to Recycle your Facets

March 8th
Monday, 4.30pm
Burnside 1205

David Wood
Carleton University
Bounded Degree Acyclic Decompositions of Digraphs

March 15th
Monday, 4.30pm
Burnside 1205

Frank Ruskey
University of Victoria
Recent Results about Symmetric Venn Diagrams

March 22nd
Monday, 4.30pm
Burnside 1205

Nick Wormald
University of Waterloo
Analysing Greedy Algorithms on Regular Graphs using Differential Equations

March 24th
Wednesday, 4.30pm
McConnell 320

Klaus Reinhardt
University of Tuebingen
A Quadratic Distance Bound on Sliding between Crossing-free Spanning Trees

April 23th
Friday, 1.30pm
McConnell 320

Alex Kreinin
Lookup Tables, Magic Numbers and Hamiltonian Paths

Previous Seminars
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
For information contact:
Seminar Coordinator : Adrian Vetta
The other organisers are : D. Avis (CS), W. Brown (Math), D. Bryant (Math/CS), L. Devroye (CS), B. Reed (CS), V. Rosta (Math), G. Toussaint (CS), and S. Whitesides (CS).