McGill University - School of Computer Science

Algorithms Seminar 2003


Everyone is welcome!



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


Algorithms Seminars 2003 Program:

Thursday, December 4th 2003
11:00am-12:00pm,
MC320  
David Bremner, Computer Science, University of University of New Brunswick
Separation made easier
Wednesday, November 19th 2003
4:45pm-5:45pm,
MC320  
David Bryant, School of Computer Science, McGill University.
Computational Geometry for World Peace: some open problems.
Friday, November 14th 2003
3:30pm-4:30pm,
MC103  
Jean-Daniel Boissonnat, INRIA, France.
Sampling, meshing and interactive reconstruction of smooth surfaces
Wendnesday, October 29th 2003
4:30pm-5:30pm,
MC320  
Hans Vangheluwe, School of Computer Science, McGill University.
Meta-modelling and graph grammars: foundations for domain-specific visual modelling environments
Wednesday, October 22nd, 2003
4:30pm-5:30pm,
MC320  
Michal Koucky, Department of Computer Science at Rutgers University.
On traversal sequences and graph s-t-connectivity
Wednesday, October 1st 2003
4:30pm-5:30pm,
MC320  
Kensuke Onishi, Graduated School of Information systems, The University of Electro-Communications.
Adjacency of optimal region of Huffman tree
Wednesday, September 24th 2003
4:30pm-5:30pm,
MC320  
Yasuko Matsui (Tokai University)
An algorithm for enumerating all substitutions a rooted ordered tree into a term tree
Monday, August 4th 2003
4:00pm-5:00pm,
MC103  
Yoshio Okamoto (ETH Zurich)
Fair cost allocations under conflicts
Friday, May 16th 2003
2:00pm-2:45pm,
MC103  
Shuji Kijima (University of Tokyo)
Polynomial Time Perfect Sampling Algorithm for Two-rowed Contingency Tables
Friday, May 9th 2003
2:00pm-4:30pm,
MC103  
Four Speakers (click below)
Algorithm Seminar Day
Thursday, April 3rd 2003
4:15pm-5:15pm,
MC103  
Tomomi Matsui, University of Tokyo
Integer Programming Based Algorithms for Peg Solitaire Problems.
Thursday, March 27th 2003
4:15pm-5:15pm,
MC103  
Antoine Deza, Tokyo Institute of Technology
Generating vertices and faces with symmetries
Wednesday, March 26th 2003
4:30pm-5:30pm,
MC320  
Sebastien Roch, Ecole Polytechnique, Montreal
An Approximation Algorithm for Stackelberg Network Pricing
Wednesday, March 19th 2003
4:30pm-5:30pm,
MC320  
Bob Connelly, Department of Mathematics, Cornell University, NY, USA
On the Kneser-Poulsen Conjecture for spheres
Thursday, March 6th 2003
4:00pm-5:00pm,
MC103  
Shuichi Miyazaki Academic Center for Computing and Media Studies, Kyoto University, Japan
Approximability of Stable Marriage with Incomplete Lists and Ties
Wednesday, January 22nd 2003
4:30pm-5:30pm,
MC320  
Csaba David Toth, University of California, Department of Computer Science.
Binary space partitions for orthogonal fat rectangles


Relevant Sites & News:
  Discrete Mathematics and Optimization Seminars
  McGill Mathematics and Statistics Seminars
  McGill Computer Science News and Events

Seminars from previous years:
Seminars in 2002
Seminars in 2001
Seminars in Fall 2000
Seminars in Winter 2000
Seminars in Fall 1999
Seminars in Fall 1998
Seminars in Winter 1998
Seminars in Fall 1997

Direct questions, comments, additions to and removals from the mailing list, and suggestions for speakers to us at Seminar Organizer