All talks at S.I.T.E. building, 800 King Edward, University of Ottawa, 
room B-0138 (Friday and Thursday) and room H-0104 (Saturday only). 
======================================================================================================
Thursday, May 1st, 2003 -- ONTARIO COMBINATORICS WORKSHOP (day 1)
room: B-0138

9:00-10:00  Two choices are better than one, but by how much?
            Nick Wormald (University of Waterloo)

10:20-12:40 Contributed talks: Session I
   10:20 Load balancing as a random graph process
         Julie Anne Cain (Dept. Mathematics and Statistics, University of Melbourne)         
   10:40 Bounds on the Turan density of PG(3,2)
         Sebastian Cioaba (Department of Mathematics and Statistics, Queen's University)
   11:00 Finding Hamilton Cycles in Random Graphs
         Graeme Kemkes (Dept. of Combinatorics and Optimization, University of Waterloo)
   11:20 Asymptotics of Combinatorial Structures with Large Smallest Component
         Atefeh Mashatan (Dept. of Combinatorics and Optimization, University of Waterloo)
   11:40 New algorithms for symmetric functions useful in combinatorial enumeration
         Marni Mishna (LaCIM, Université de Québec à Montréal) 
   12:00 Tilings of R and roots of unity
         John P. Steinberger (Dept. of Combinatorics and Optimization, University of Waterloo)
   12:20 Perfect matchings for the Gale-Robinson sequence 
         Julian West (Malaspina University-College, University of Victoria)
   
1:30-2:30  Poker and Mathematics
           Brian Alspach (University of Regina) 
   
2:40-3:40 Contributed talks: Session II
    2:40 2-tree probe interval graphs have a large obstruction set
         Natasa Przulj (Dept. of Computer Science, University of Toronto)
    3:00 A Simple Linear Time LexBFS Cograph Recognition Algorithm
         Anna Bretscher (Dept. of Computer Science, University of Toronto)
    3:20 The Decision List Machine with Half-Spaces
         Marina Sokolova (S.I.T.E., University of Ottawa)

4:00-6:00 Contributed talks: Session III
    4:00 $K_5$-free Bound for the class of Planar Graphs
         Reza Naseras (Department of Mathematics, Simon Fraser University)
    4:20 Mobility of Graphs 
         Gabriel Verret (University of Ottawa)
    4:40 Covering arrays on Graphs 
         Karen Meagher (Dept. of Mathematics and Statistics, University of Ottawa) 
    5:00 A partition graph
         mike newman (Department of Combinatorics and Optimization, University of Waterloo)
    5:20 How to build a brick
         Marcelo Henriques de Carvalho (Dept. of Combinatorics & Optimization - University of Waterloo)
    5:40 Two theorems on planar graphs
         Frank Jagla (Flint Software Inc.)
========================================================================================================
Friday, May 2nd, 2003 -- ONTARIO COMBINATORICS WORKSHOP (day 2)
room: B-0138

9:00-10:00 Methods for hard combinatorial optimization problems -- a guided tour
           Sylvia Boyd (University of Ottawa) 
  
10:20-12:20 Contributed talks: Session IV
   10:20 A new separation algorithm for the subtour elimination constraints
         Genevieve Labonte (S.I.T.E., University of Ottawa)
   10:40 A Restricted Postman Problem on Mixed Graphs
         Francisco J. Zaragoza (Department of Combinatorics and Optimization, University of Waterloo)
   11:00 On a class of 4-regular planar graphs of inscribable type
         Kevin Cheung (University of Waterloo)
   11:20 An Interval Colouring Approach to the Computer Test Scheduling Problem
         Megan Dewer (School of Mathematics and Statistics, Carleton University)
   11:40 Solving Inequalities and Proving Farkas's Lemma Made Easy
         Bohdan Kaluzny (McGill University)
   12:00 Multicommodity Flows and Signed Graphs
         Paul Elliott (Wilfrid Laurier University)

1:20-3:20 Contributed talks: Session V
    1:20 A characterization of permutation polynomials based on their coefficients
         Ariane Masuda (School of mathematics and statistics, Carleton University)
    1:40 Primal sets and dually vertex-oblique graphs
         Alastair Farrugia (Dept. of Combinatorics and Opimization, University of Waterloo)
    2:00 Polynomials with the Half-Plane Property and Rayleigh Monotonicity
         YoungBin Choe (Dept.of Combinatorics & Optimization, University of Waterloo)
    2:20 Linear Transformation Shift Registers
         Michael Dewar (School of Mathematics and Statistics, Carleton University)
    2:40 Factorizations of signed permutations
         Cedric Chauve (LaCIM, UQAM)
    3:00 On embedding graphs in Cayley graphs 
         Benjamin Steinberg (School of Mathematics and Statistics, Carleton University)

3:30-4:30 Ramanujan Graphs
          Ram Murty (Queen's University) 
========================================================================================================
Saturday, May 3rd, 2003 -- OTTAWA-CARLETON DISCRETE MATHEMATICS DAY
room: H-0104

10:00-11:00 Even Factors in Digraphs
            Bill Cunningham  (University of Waterloo)
 
11:30-12:30 Long Arithmetic Progressions in Sum-set sums
            Endre Szemerédi (Rutgers University) 

  2:30-3:30 Block design existence -- when it rains, it pours
            Clement Lam (Concordia University)

  4:00-5:00 Searching and Sweeping Graphs
            Brian Alspach (University of Regina) 
=========================================================================================================