Ottawa/Carleton Combinatorics and Optimization Seminar

Past Talks

Winter 2004

• April 6, 11 am, Place: CARLETON
  Conrado Martinez, Universitat Politecnica de Catalunya, Spain
  Forty years of Quicksort and Quickselect: a personal view

• March 2, 11 am, Place: CARLETON
  Vahid Dabbaghian-Abdoly, Carleton University
  Partitions and Constituents of the Irreducible Characters of Symmetric Groups

• February 10, 11am, Place: OTTAWA
  Joy Morris, University of Lethbridge
  Wreath Products of Graphs and Automorphism Groups

• February 3, 11am, Place: CARLETON
  Igor Shparlinski, Maquarie University, Australia
  Playing "Hide-and-Seek'' in Finite Fields: Hidden Number Problem and Its Applications

• January 27, 11am, Place: OTTAWA
  Paul Elliott, University of Ottawa
  Maximum Matching Graphs

Fall 2003

• November 24, 11:00a.m., Place: CARLETON
  Wojtek Fraczak, IDT Canada, University of Quebec at Outaouais
  Prime decomposition of regular prefix codes

• November 10, 11:00a.m., Place: OTTAWA room STE5084
  Yongyi Mao, University of Ottawa
  Duality in Factor Graphs

• October 27, 11:00am, place: CARLETON room HP4351
  Rachid Saad, Carleton University
  The Forwarding Indices of Interconnection Networks

• October 20, 11:00am, place: OTTAWA room STE1010 (note different room)
  Peter Dukes, University of Toronto
  Constant composition codes

• September 26, 11:am, place: CARLETON room HP4369 (note: different day and room)
  John Mighton, JUMP/Fields Institute
  A New Characterization of Graphic Matroids

• September 15, 11:00am, place: OTTAWA room STE5084
  Primoz Potocnik, University of Ottawa
  Symmetry in graphs

Winter 2003

• May 1-3: 12th Ontario Combinatorics Workshop and
  Ottawa-Carleton Discrete Mathematics Day
• April 11, 10:00 a.m., place: OTTAWA room: STE-1010.
  Francois Bergeron, Universite du Quebec a Montreal
  Diagonal Alternants

• March 14, 10:00 a.m., place: OTTAWA room: STE-1010.
  Kevin Cheung, University of Waterloo,
  On recognizing (2k+1)-edge-connected (2k+1)-regular bicritical graphs

• January 23 (Thursday, exceptionally), 2:00 p.m., place: CARLETON room: HP4351
  Mohammad R. Salavatipour, University of Toronto,
  Packing Steiner Trees.

Fall 2002

• November 26, 2:30 p.m., place: OTTAWA
  David Sankoff, University of Ottawa
  Genome Reconstruction with Paralogy
• November 12, 2:30 p.m., place: CARLETON
  Irwin Pressman, Carleton University
  A hit-and-run method for finding the extreme points of a finite set
• October 22, 2:30 p.m., place: OTTAWA
  Claude Tardif, Royal Military College
  Chromatic numbers of products of graphs
• October 8, 2:30 p.m., place: CARLETON

Jose Manuel Fernandez, Universite de Montreal
Quantum Arithmetics on Galois Fields
• September 24, 2:30 p.m., place: OTTAWA

Inna Drobouchevitch, University of Ottawa
Scheduling dual gripper robotic cells
• September 12, 1:30 p.m., place: CARLETON room HP4369

S. Arumugam, M.S. University, Tirunelveli, India
The Asteroidal Chromatic Number of a Graph
• September 5, 1:30 p.m., place: CARLETON room HP4351

Bruce Richter, University of Waterloo
What is the cycle space of an infinite graph?

Summer 2002:

• June 11, 3:00 p.m., place: OTTAWA

Marni Mishna, Universite du Quebec at Montreal
Combinatorics and Computer Algebra
• July 31, 1:30 p.m., place: OTTAWA

Karen Meagher and Lucia Moura, University of Ottawa
Two generalizations of covering arrays

Winter 2002:

• January 23, place: CARLETON

Jit Bose, Carleton University
Worst-Case-Optimal Algorithms for Guard/Utility Placement on Polyhedral Surfaces
• January 30, place: CARLETON

Theo Garefalakis, University of London,
Lattice basis reduction in cryptanalysis: two recent results
• February 13, place: OTTAWA

Stefan Dobrev, University of Ottawa,
Using Busy Signal to Speed-up Mutual Search
• February 27, place: CARLETON

Brett Stevens, Carleton University
Towards Class-Uniformly Resolvable Designs: combinatorial design theory and statistics.
• March 13, place: OTTAWA

George M. White, University of Ottawa
Scheduling and Timetabling Through Constraint Logic Programming
• March 27, place: CARLETON

Dorothy Kucar, University of Waterloo
Combinatorial Methods in VLSI Physical Design

Fall 2001:

• September 11, place: CARLETON

Brett Stevens, Carleton University
Queue Compatible Gray Code Orderings
September 18, place: CARLETON
Brett Stevens (continuation of previous talk)
• September 25, place: OTTAWA

Sylvia Boyd and Genevieve Labonte, University of Ottawa
Finding the exact integrality gap for small Travelling Salesman Problems
• October 16, place: CARLETON

Milosz Muszynski, Carleton University
Diagonal flips in triangulations and rotation on rooted trees
• October 30, place: OTTAWA

John Stardom, Simon Fraser University
Metaheuristics and the Search for Covering Arrays
• November 13, place: OTTAWA

Lucia Moura and Marc Raaphorst, University of Ottawa
Isomorph-free exhaustive generation of some triple systems
• November 26 (EXCEPTIONALLY ON MONDAY 1:00 PM ROOM: CBY-A707), place: OTTAWA

Kumar Murty, University of Toronto
Large codes arising from algebraic geometry
• December 4, place: CARLETON

Nick Wormald, University of Melbourne, Australia
Models of random regular graphs