McGill University - School of Computer Science

Algorithms Seminar 2004 Everyone is welcome!

Wednesday, November 22nd 2004 4:30pm-5:30pm, MC 320	David Wood, School of Computer Science, McGill University Colouring Visibility Graphs
Wednesday, November 17th 2004 4:30pm-5:30pm, MC 320	Godfried Toussaint, School of Computer Science, McGill University Computational Geometric Aspects of Musical Rhythm
Wednesday, November 17th 2004 4:30pm-5:30pm, MC 320	Perouz Taslakian, School of Computer Science, McGill University Hamiltonian Cycles in Sparse Vertex-Adjacency Duals
Wednesday, September 22nd 2004 4:30pm-5:30pm, MC 320	Christian Knauer, Department of Mathematics and Computer Science, Freie Universitaet- Berlin Counting maximum dilation pairs in planar graphs
Wednesday, May 26th 2004 4:30pm-5:30pm, MC 320	Bohdan Kaluzny (McGill University) Building worst-case examples for the criss-cross method
Wednesday, April 28th 2004 4:30pm-5:30pm, MC 320	Hirotada Kobayashi, ERATO, Tokyo Japan Quantum multi-prover interactive proof systems with limited prior entanglement
Wednesday, March 24th 2004 4:30pm-5:30pm, MC 320	Klaus Reinhardt, University of Tuebingen A quadratic distance bound on sliding between crossing-free spanning trees
Wednesday, March 17th 2004 4:30pm-5:30pm, MC 320	Josh Buresh-Oppenheim, University of Toronto Rank Bounds and Integrality Gaps for Cutting Planes Procedures
Wednesday, March 10th 2004 4:30pm-5:30pm, Trottier room 2100	Leonid Khachiyan (Rutgers University) On Enumerating Minimal Strongly Connected Subgraphs and Dicuts
Wednesday, March 3rd 2004 4:30pm-5:30pm, MC320	Ketan Dalal (McGill University) Convex Hull Onions
Wednesday, January 21rst 2004 4:30pm-5:30pm, MC320	Nikolaos Fountoulakis (McGill University) The evolution of the conductance of a random graph.
Wednesday, January 14th 2004 4:30pm-5:30pm, MC320	Kazuo Iwama (Kyoto University) Approximating Vertex Cover on Dense Graphs