Winter Term Schedule 2005
January 10th
Monday, 4.30pm
Burnside 1205
Paul Seymour
Princeton University
The roots of the stable set polynomial of a claw-free graph
January 17th
Monday, 4.30pm
Burnside 1205
Eva Tardos
Cornell University
Network Games and the Price of Anarchy or Stability
February 14th
Monday, 4.30pm
Burnside 1205
Jan Vondrak
Massachusetts Institute of Technology
The Benefit of Adaptivity in Stochastic Optimization
February 21st
Monday, 2.30pm (note unusual time)
Burnside 1205
Mohammad Mahdian
Microsoft Research
Marriage, Honesty, and Stability
March 7th
Monday, 4.30pm
Burnside 1205
David Wood
McGill University
Fast Separation in Graphs with an Excluded Minor
March 14th
Monday, 4.30pm
Burnside 1205
Klaus Reinhardt
University of Tuebingen
Reachability in Petri Nets with Inhibitor Arcs
March 21st
Monday, 4.30pm
Burnside 1205
George Karakostas
McMaster University
The Good, the Bad, and the Rich: Routing selfish, class-conscious, and malicious users on traffic networks
March 31st
Thursday, 4.30pm (note unusual day and room)
McConnell 320
Daniel Solow
Case Western Reserve University
Mathematical Models for Explaining the Emergence of Specialization in Performing Tasks
Fall 2004See also the McGill Algorithms Seminar.
Winter 2004
Fall 2003
Winter 2003
Fall 2002
Winter 2002
Seminar Coordinator : Adrian VettaThe other organisers are : D. Avis (CS), W. Brown (Math), D. Bryant (Math), L. Devroye (CS), B. Reed (CS), G. Toussaint (CS), and S. Whitesides (CS).