| Wednesday, November 21th 2001 4:30pm-5:30pm, MC320 |
Hyeon-Suk Na, INRIA-Lorraine, Nancy, France
The expected number of visibility events amongst uniformly distributed unit balls is linear. |
| Wednesday, November 14th 2001 4:30pm-5:30pm, MC320 |
Matt Devos, Princeton University, Princeton NJ USA
Toward the cycle double cover conjecture |
| Friday, November 9th 2001 12:00pm-1:00pm, MC320 |
John Iacono, from Polytechnic University,
Brooklyn, NY,
Distribution Sensitive Data Structures |
| Wednesday, October 31rst 2001 4:30pm-5:30pm, MC320 |
David Bryant, School of Computer Science, McGill University
From consensus trees to supertrees |
| Wednesday, October 24th 2001 4:30pm-5:30pm, MC320 |
Stefan Langerman, School of Computer Science, McGill University
Covering Points with Lines |
| Wednesday, October 17th 2001 4:30pm-5:30pm, MC320 |
Pat Morin, School of Computer Science, McGill University
Computing the Maximum Detour and Spanning Ratio of Planar Chains, Trees and Cycles |
| Wednesday, August 29th 2001 4:30pm-5:30pm, MC320 |
Mark Grundland,
Computer Laboratory
University of Cambridge
United Kingdom
Automated Artistic Image Rendering |
| Thursday, August 8th 2001 1:00pm-2:00pm, MC320 |
Greg Aloupis, School of Computer Science, McGill University
Algorithms for Bivariate Medians and a Fermat-Torricelli Problem for Lines |
| Monday, July 30th 2001 11:00am-12:00pm, MC320 |
Ioannis Z. Emiris, INRIA Sophia-Antipolis, France
Geometric Methods for Solving Algebraic Systems |
| Thursday, July 12th 2001 4:00pm-5:00pm, MC320 |
Jeff Erickson, University of Illinois at Urbana-Champaign
Nice Point Sets Can Have Nasty Delaunay Triangulations (But Not Too Nasty) |
| Friday, May 11th 2001 3:00pm-4:00pm, MC320 |
Sergei Bespamyatnikh,
Department of Computer Science,
University of British Columbia
Enumerating triangulations of convex polytopes in R^3 |
| Wednesday, April 25th 2001 4:30pm-5:30pm, MC320 |
Henk Meijer, Department of Computer Science, Queens University
Stars, Matchings and Hamiltonian Tours |
| Friday, April 20th 2001 11:00am-12:00pm, MC103 |
Mitsunori Ogihara, Department of Computer Science, Rochester University
Self-Avoiding Walks |
| Wednesday, April 4th 2001 4:30pm-5:30pm, MC320 | Michael Bender, SUNY Stony Brook The Power of a Pebble: Exploring and Mapping Directed Graphs |
| Wednesday, March 28th 2001 4:30pm-5:30pm, MC320 |
Ralph Neininger, Universitat Freiburg Probabilistic analysis of Quicksort |
| Wednesday, March 14th 2001 4:30pm-5:30pm, MC320 |
Pat Morin, School of Computer Science, McGill University Classifying Adult Content on the Web |
| Wednesday, March 7th 2001 4:30pm-5:30pm, MC320 |
Stefan Langerman, Rutgers University, Deptartment of Computer Science
Geometric Medians |
| Wednesday, Feb. 28th 2001 4:30pm-5:30pm, MC320 | David Wood, Basser Department of
Computer Science, University of Sydney Three-Dimensional Orthogonal Graph Drawing: Attacking the Two-Bends Problem |
| Friday, Jan. 19th 2001 10:00am-11:00am, MC103 |
Jens Lagergren,
Royal Institute of Technology (KTH) and Stockholm Bionformatics Centre
A Polynomial Time Exact Disc-Covering Method |
| Seminars in Fall 2001 |
| Seminars in Winter 2000 |
| Seminars in Fall 1999 |
| Seminars in Fall 1998 |
| Seminars in Winter 1998 |
| Seminars in Fall 1997 |