Discrete Mathematics and Optimization Seminar
Information

This seminar is jointly organized 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 Sean Kennedy.

MAPS:
Map to Burnside Hall.
Map to McConnell (MC).
Current Seminar Schedule - Fall 2010
4:00PM in Burnside 1205 unless specified.
Sept. 24th, 2010
MC 320, 3:00 PM


Cache-Oblivious Range Reporting (abstract)
Peyman Afshani
Dalhousi University
Sept. 27th, 2010

The Worm Order and its Applications (abstract)
Peter Winkler
Dartmouth
Oct. 13th, 2010
MC 320, 4:00 PM


Equipartitioning by convex k-fans (abstract)
Imre Barany
Alfred Renyi Mathematical Institute
Oct. 18th, 2010

Constructive Algorithms for Discrepancy Minimization (abstract)
Nikhil Bansal
IBM TJ Watson
Oct. 22nd, 2010
MC 320, 4:00 PM


Perfect matchings in cubic graphs: A proof of the Lovasz-Plummer conjecture (abstract)
Serguei Norine
Princeton University
Nov. 1st, 2010

Tree-width and surface duality (abstract)
Frederic Mazoit
LaBRI
Nov. 5th, 2010
MC 320 4:00 PM


The chromatic gap and its extremes (abstract)
András Sebő
CNRS, Laboratoire G-SCOP
Nov. 8th, 2010

Approximating the Asymmetric Traveling Salesman Problem (abstract)
Michel Goemans
MIT
Nov. 8th, 2010

Approximating the Asymmetric Traveling Salesman Problem (abstract)
Michel Goemans
MIT
Dec. 9th, 2010
MC103, 4-5PM


Continuum Percolation is Noise Sensitive (abstract)
Simon Griffths
IMPA, Rio de Janeiro
Previous Schedules