Discrete Geometry Seminar

List of Talks given in 2001-02

Friday, September 7		Andrei Raigorodskii, University of Moscow (Russia) Measuring the difference between bases of Z^n
Friday, September 14		Konstantin Rybnikov, Cornell University Delaunay tilings and Dirichlet-Voronoi polytopes of lattices
Friday, September 21		Franco Saliola, Cornell University Forbidden minors
Friday, September 28		Franco Saliola, Cornell University The Colin de Verdière graph invariant
Friday, October 12		Maria Sloughter, Cornell University Polytopes and the Colin de Verdière number
Friday, October 19		Sue Whitesides, McGill University (Canada) and Cornell University Fixed parameter tractability results for crossing minimization problems in layered graphs
Friday, October 26		Sue Whitesides, McGill University (Canada) and Cornell University Fixed parameter tractability results for crossing minimization problems in layered graphs II
Friday, November 2		Robert Connelly, Cornell University The Kneser-Poulsen conjecture: an update
Friday, November 9		David Benbennick, Cornell University Unfolding convex polytopes
Friday, November 16		David Benbennick, Cornell University Unfolding convex polytopes II
Friday, November 30		John Hubbard, Cornell University Andreev's theorem: is it true?
Friday, February 8		Konstantin Rybnikov, Cornell University Abelian gain graphs and their application in discrete geometry
Friday, April 12		Walter Whiteley, York University (Canada) Inductive techniques for plane frameworks
Friday, April 12		Daniel Dix, University of South Carolina Discrete structures for biomolecular geometry
Friday, April 19		Tom Zaslavsky, University of Binghamton Semi-unique representation of a cute kind of matroid
Friday, April 26		Ileana Streinu, Smith College On the number of embeddings of minimally rigid graphs
Friday, May 3		Jason Cantarella, University of Georgia Rope length critical curves -or- on a kind of continuous tensegrity theory