Algorithms Seminar 2002

Seminars usually take place on Wednesdays, 16h30-17h30, in room 320 of the McConnell building.
Alternatively, seminars may be scheduled on Friday afternoon. 

Monday, December 2nd 2002 10:00am-11:00am, MC320	William Steiger from Rutgers University, NJ Long Monotone Paths in Line Arrangements
Wednesday, October 30th 2002 4:30pm-5:30pm, MC320	Bojan Mohar, University of Ljubljana, Slovenia Computing the genus of graphs in minor closed families
Wednesday, October 9th 2002 3:30pm-4:30pm, MC320	John Iacono, Polytechnic University, New York Queaps
Friday, September 13th 2002 5:00pm-6:00pm, MC320	Herve Bronniman, Polytechnic University, New York Cost-Optimal Trees for Ray Shooting
Wednesday, August 7th 2002 11:00am-12:00pm, MC320	Andrew Ladd, Rice University Motion Planning for Knot Untangling
Monday, June 3rd 2002 2:00pm-3:00pm, MC320	Marco Luebbecke, Department of Mathematical Optimization, Braunschweig University of Technology Minimum Turn Cycle Covers in Grid Graphs
Wednesday, January 30th 2002 4:30pm-5:30pm, MC103	Vasek Chvatal, Department of Computer Science Rutgers, the State University of New Jersey Sylvester's Conjecture in Metric Spaces
Tuesday, January 29th 2002 9:00am-10:00am, MC320	Etienne Birmele, Departement de Mathematiques, Universite Lyon I Graphs Without Long Cycle Minors
Wednesday, January 23rd 2002 4:30pm-5:30pm, MC320	Adrian Bondy, Departement de Mathematiques, Universite Lyon I Short Proofs of Classical Theorems