Special Year on Graph Theory and Combinatorial Optimization
August 1, 1999 to May 31, 2000
Description
The Special Year on Graph Theory and Combinatorial Optimization is a joint program between the Fields Institute and PIMS. The full program on these two subjects will emphasize recent results, open problems, applications, and connections with other parts of mathematics and computer science. The main vehicles of presentation are a series of workshops focusing on particular aspects of these subjects, a series of courses to initiate graduate students and interested workers from related fields, and long-term visits by postdoctoral fellows and Canadian and international experts. Please follow the PIMS link to get updated information on events that take place at their site.
Workshops and Conferences
-
September 26 - October 1, 1999
-
-
-
-
-
February 28 - March 3, 2000
-
-
-
Special and Public Lectures
Courses
-
September 14 - November 30, 1999
-
September 15 - December 1, 1999
-
January 10 - April 10, 2000
-
January 10 - April 10, 2000
Topics of Concentration
- Fall of 1999: Combinatorial Optimization
- Winter-Spring 2000: Graph Theory
Workshops
SUMMER 2000 (June - August)
- Interconnection Networks -- (Nick Pippenger, University of British Columbia)
- Dynamic Graph Problems -- (Valerie King, University of Victoria)
- Computational Geometry and Geographic Information Systems --
(Jack Snoeyink, University of British Columbia)
- Partial k-trees -- (Arvind Gupta, Simon Fraser University)
- Graph Colouring -- (Pavol Hell, Simon Fraser University)
- Graph Decompositions -- (Brian Alspach, Simon Fraser University)
- Flows, Colourings and Orientations -- (Luis Goddyn, Simon Fraser University)
SUMMER 1999
- Canadian Conference on Computational Geometry -- August 15 - 18, 1999
- Workshop on Algorithms and Data Structures (Kick-off for the year)-- August 11 - 14, 1999
PIMS Distinguished Lecture Series
June - August, 2000 (to be announced).
