THIS SITE

Information for

PhD recipients

Here is a list of Combinatorics and Optimization PhD recipients, their thesis titles and supervisors, and their last known positions.

2016

2015

2014

2013

Start of page

2012

Start of page

2011

Start of page

2010

Start of page

2009

Start of page

2008

Start of page

2007

Start of page

2006

Start of page

2005

Start of page

2004

Start of page

2003

  • Kevin Cheung
    Subtour Elimination Polytopes and Graphs of Inscribable Type
    (W.H. Cunningham)
    Carleton University (Canada)
  • Young-Bin Choe
    Polynomials With The Half-Plane Property and Rayleigh Monotonicity
    (D.G. Wagner)
    Scotiabank (Canada)
  • Alastair Farrugia
    Uniqueness and Complexity in Generalised Colouring
    (R.B. Richter)
    Crimsonwing (Malta)
  • Cheuk Ying Charles Lam
    Topics in Sequence Analysis and Coding Theory
    (G. Gong and S.A. Vanstone)
    California State University Bakersfield (USA)
  • John Proos
    Imperfect Decryption and Partial Information Attacks in Crytography
    (S.A. Vanstone)
    Communications Security Establishment Canada

Start of page

2001

Start of page

1999

Start of page

1997

Start of page

1996

  • James Geelen
    Matchings, Matroids and Unimodular Matrices
    (W.H. Cunningham)
    University of Waterloo (Canada)
  • Bo Yu
    Node Multiterminal Cuts, Feasible Cuts, and Multicommodity Flows
    (J. Cheriyan)
    Associates First Capital Corporation (USA)

Start of page

1995

  • Eddie Cheng
    Wheel Inequalities for Stable Set Polytopes
    (W. H. Cunningham)
    Oakland University (USA)
  • David Horrocks
    Sperner Properties of Filters Generated by Two-Sets in Boolean Algebras
    (D.M.Jackson)
    University of Prince Edward Island (Canada)
  • Zhike Jiang
    Rotational Steiner Triple Systems
    (C.J. Colbourn)
    Bank of Montreal (Canada)
  • Aleksandar Jurisic
    Antipodal Covers
    (C. Godsil)
    Institute of Mathematics, Physics and Mechanics (Slovenia)
  • Therese Lee
    Tools for Constructing RBIBDs Frames, NRBs and SOLSSOMs
    (S. Furino)
  • Krishna Padayachee
    Conservative Weightings and Minimum T-joins
    (D.H. Younger)
    3M Corporation (Canada)

Start of page

1994

  • Angele Hamel
    Algebraic and Combinatorial Methods for Symmetric and Supersymmetric Functions
    (I.P. Goulden)
    Wilfrid Laurier University (Canada)
  • Taojun Lu
    Extremal Graphs Satisfying Certain Cycle Properties
    (R.C. Read)
    Citibank (Canada)
  • David Mates
    A Projection Method for the Floor Planning Problem
    (A. Conn, A. Vannelli)
    MDA (Canada)
  • Minghua Qu
    Subset Factorizations in Finite Groups and Their Cryptographic Significance
    (S.A. Vanstone)

Start of page

1993

  • Ricardo Dahab
    The Birkhoff-Lewis Equations
    (D. Younger)
    University of Campinas (Brazil)
  • Shuhong Gao
    Normal Bases Over Finite Fields
    (R.C. Mullin)
    Clemson University (USA)
  • Kyriakos Kilakos
    Colourings and Fractional Colourings
    (U.S.R. Murty and B. A. Reed)

Start of page

1992

  • Sandor Fekete
    Geometry and the Travelling Salesman Problem
    (W.R. Pulleyblank)
    Braunschweig University of Technology (Germany)
  • Bill Martin
    Completely Regular Subsets
    (C.D. Godsil)
    Worcester Polytechnic Institute (USA)
  • Alfred Menezes
    Elliptic Curve Cryptosystems
    (S.A. Vanstone)
    University of Waterloo (Canada)

Start of page

1991

  • Isidoro Gitler
    Delta-Wye-Delta Transformations Algorithms and Applications
    (F. Barahona)
    CINVESTAV (Mexico)
  • Marcel Mongeau
    Discontinuous Piecewise Differentiable Optimization
    (A.R. Conn)
    Ecole Nationale de L'Aviation Civile (France)
  • Ruo Tan
    Quadratic Programming and Isotonic Regression: Some Efficient Algorithms
    (M.J. Best)
    Segal Rogerscasey Canada

Start of page

1990

  • Steve Furino
    a-Resolvable Structures
    (S.A. Vanstone)
    University of Waterloo (Canada)
  • Bruce Gamble
    Polyhedral Extensions of Matching Theory
    (W.R. Pulleyblank)
    Schneider National Inc. (USA)
  • Scott Hadley
    Continuous Optimization Approaches for the Quadratic Assignment Problem
    (H. Wolkowicz)
    Focused Management Inc. (Canada)
  • Alice Metzlar
    Minimum Transversals of Cycles in Intercyclic Digraphs
    (D.H. Younger)
  • Karen Seyffarth
    Cycle and Path Covers of Graphs
    (J.A. Bondy)
    University of Calgary (Canada)
  • Bruce Shepherd
    Near Perfection And Stable Set Polyhedra
    (W.R. Pulleyblank)
    McGill University (Canada)

Start of page

1989

  • Glen Holman
    A New Curvilinear Algorithm for Unconstrained Optimization Using Directions of Negative Curvature
    (A.R. Conn)
    Royal Trust Investements (Canada)
  • Luis Goddyn
    Cycle Covers of Graphs
    (J.A. Bondy)
    Simon Fraser University (Canada)
  • Sean McGuinness
    Random Walks on Graphs and Digraphs
    (L.B. Richmond)
    Thompson Rivers University (Canada)
  • Terry Visentin
    A Character Theoretic Approach To The Study of Combinatorial Properties of Maps in Orientable Surfaces
    (D.M. Jackson)
    University of Winnipeg (Canada)

Start of page

1988

  • Neil Calkin
    Sum - free sets and measure spaces
    (I.P. Goulden)
    Clemson University (USA)
  • Genghua Fan
    Extremal Theorems on Paths and Cycles in Graphs and Weighted Graphs
    (J.A. Bondy)
    Fuzhou University (China)
  • Wei-Guo Liu
    Extended Formulations and Polyhedral Projection
    (W.R. Pulleyblank)
    Yahoo
  • Bill McCuaig
    Edge Reductions of Cyclically K-connected Cubic Graphs
    (R.C. Read)

Start of page

1987

  • Nilotpal Chakravarti
    Efficient Active Set Algorithms For Specially Structured Quadratic Programs
    (M.J. Best)
    Radix Analytics (Singapore)
  • Donald Curran
    Constructions for Resolvable and Doubly Resolvable Designs
    (S.A. Vanstone)
    R.S. McLaughlin C.V.I. (Canada)

Start of page

1986

  • Jean-Marie Bourjolly
    Integral and Fractional Node-Packings and Pseudo-Boolean Programming
    (W.R. Pulleyblank)
    Concordia University (Canada)
  • Sylvia Boyd
    The Subtour Polytope of the Travelling Salesman Problem
    (W.R. Pulleyblank)
    University of Ottawa (Canada)
  • Mark Ellingham
    Isomorphic Factorizations of Regular Graphs
    (B. Richmond)
    Vanderbilt University (USA)
  • Doug Wiedemann
    Hamming Geometry
    (R.C. Mullin)
    Center for Communications Research (USA) 

Start of page

1985

  • Uldis Celmins
    On Cubic Graphs That Have No Edge 3-Colouring
    (D. Younger)
    University of Waterloo (Canada)

Start of page

1984

  • Gerald Koop
    Optimal Multiple Shift Manpower Scheduling: Models and Algorithms
    (R. Burns)
    VMI Medical Inc. (Canada)
  • Nadimpalli Mahadev
    Stability Numbers in Structured Graphs. (P. Hammer)
    Fitchburg State University (USA) 

Start of page

1983

  • Richard Caron
    A Parameterized Hessian Quadratic Programming Problem
    (M. Best, D. Grierson)
    University of Windsor (Canada)
  • Bill Cook
    On Some Aspects of Totally Dual Integral Systems
    (U.S.R. Murty)
    University of Waterloo (Canada)
  • Paulo Feofiloff
    Disjoint Transversals of Directed Coboundaries
    (D. Younger)
    University of Sao Paulo (Brazil)
  • Bruce Richter
    The Toplogy of Embedded Graphs
    (D. Younger)
    University of Waterloo (Canada)
  • Philip O'Neill
    Piecewise Continuous Optimization
    (A. Conn)
    Quantitative Decision Support, Inc. (Canada)

Start of page

1982

  • Kathie Cameron
    Polyhedral and Algorithmic Ramifications of Antichains
    (J. Edmonds)
    Wilfrid Laurier University (Canada)
  • Komei Fukuda
    Oriented Matroid Programming
    (J. Edmonds)
    ETH Zurich (Switzerland)
  • Ephraim Korach
    Packing of T-cuts, and Other Aspects of Dual Integrality
    (J. Edmonds)
    Ben-Gurion University of the Negev (Israel)
  • Stephen Locke
    Extremal Properties of Paths, Cycles, and k-Colourable Subgraphs of Graphs
    (A. Bondy)
    Florida Atlantic University (USA)
  • Arnaldo Mandel
    Topology of Oriented Matroids
    (J. Edmonds)
    University of Sao Paulo (Brazil)
  • Bimal Roy
    On Isomorphic Subgraphs Having Minimum Intersections
    (R. Mullin, P. Schellenberg)
    Indian Statistical Institute (India)
  • George Steiner
    Machine Scheduling with Precedence Constraints
    (R. Burns)
    McMaster University (Canada)

Start of page

1981

  • Mustafa Akgul
    Topics in Relaxation and Ellipsoidal Methods
    (J. Edmonds)
    Bilkent University (Turkey)
  • Jarmila Chvátalova
    On the Bandwidth Problem for Graphs
    (C. Nash-Williams, D. Younger)
    Vanier College (Canada)
  • John Devitt
    The Algebraic Maniplation of Certain Enumerative Construction
    (D. Jackson)
    BlackBerry (Canada)
  • John Robinson
    Scotch Pebbles
    (D. Younger)
    The Pragmagic Group, Thunder Bay (Canada)
  • Doug Stinson
    Some Classes of Frames, and the Spectra of Skew Room Squares and Howell Designs
    (R. Mullin)
    University of Waterloo (Canada)

Start of page

1980

  • Andrew Ball
    The Construction of Comma-Free Codes With Odd World Length
    (L. Cunnings)
    MIM Holdings Limited (Australia)
  • Ryoh Fuji-Hara
    Doubly Resolvable Designs From Finite Geometries
    (S. Vanstone)
    University of Tsukuba (Japan)
  • Sostenes Lins
    Graphs of Maps
    (D. Younger)
    Universidade Federal de Pernambuco (Brazil)
  • Jorge Urrutia
    Intersection Graphs of Some Families of Plane Curves
    (R. Read)
    Universidad Nacional Autonoma de Mexico

Start of page

1979

  • Kenneth Berman
    Spanning Trees, Arborescences and 4-Valent Graphs
    (W. Tutte)
    University of Cincinnati
  • Michael Carter
    Integer Quadratic Programming: A Continuous Approach
    (R. Burns)
    University of Toronto (Canada)
  • Tom Coleman
    A Superlinear Penalty Function Method to Solve the Nonlinear Programming Problem
    (A. Conn)
    University of Waterloo (Canada)
  • Ian Goulden
    Combinatorial Decompositions in the Theory of Algebraic Enumeration
    (D. Jackson)
    University of Waterloo (Canada)
  • Bill Kocay
    K-Reconstruction of Graphs
    (R. Read)
    University of Manitoba (Canada)
  • Etan Koch
    Ramifications of Matching Theory
    (J. Edmonds)
    Independent consultant (Israel)
  • Bruno Simeone
    Quadratic 0-1 Programming, Boolean Functions and Graphs
    (P. Hammer)
    Sapienza Universita di Roma (Italy)
  • Richard Steinberg
    Flows, Colorings and Embeddings of Graphs
    (W. Tutte)
    London School of Economics (UK)

Start of page

1978

  • Bill Jackson
    Cycles in Graphs
    (A. Bondy)
    University of London (UK)
  • Thomas Ralston
    Constructions and Reconstructions
    (R. Mullin, L. Dickey)
    Monmouth College (USA)
  • John Van Rees
    The Role of (r, γ)-Designs in Some Combinatorial Configurations
    (R. Mullin)
    University of Manitoba (Canada)

Start of page

1977

  • Stephan Foldes
    Symmetries
    (W. Tutte)
    Tampere University of Technology (Finland)
  • Victor Griffin
    Polyhedral Polarity
    (J. Edmonds)
    Ford Motors of Venezuela
  • David McCarthy
    Embeddings of Regular Pairwise Balanced Designs
    (R. Mullin)
    Brock University (Canada)
  • James Reilly
    An Enumerative Combinatorial Theory of Formal Power Series
    (D. Jackson)
    Ontario Hydro (Canada)

Start of page

1976

  • Vithit Chungphaisan
    Degree Sequences of Graphs and Their Realization
    (A. Bondy, C. Nash-Williams)
    Bell Northern Research (Canada)
  • Dean Hoffman
    Sets of Integers Closed Under Affine Operations
    (D. Klarner, R. Mullin)
    Auburn University (USA)
  • Claudio Lucchesi
    A Minimax Equality for Directed Graphs
    (D. Younger)
    University of Campinas (Brazil)
  • Uri Peled
    Regular Boolean Functions and Their Polytopes
    (P. Hammer)
    University of Illinois at Chicago (USA)
  • Earl Rosenbloom
    Storage Reducing Quasi-Newton Methods for Unconstrained Minimization
    (M. Best)
    University of Manitoba (Canada)
  • Carsten Thomassen
    Paths and Cycles in Graphs
    (D. Younger)
    Tehnical University of Denmark

Start of page

1975

  • Frederick Giles
    Submodular Functions, Graphs and Integer Polyhedra
    (J. Edmonds)
    Acadia University (Canada)

Start of page

1974

  • Wayne Brehaut
    On Planar Graphs and the Plainer Nonplanar Graphs
    (R. Read)
    Bell Northern Research (Canada)
  • Bill Cunningham
    A Combinatorial Decomposition Theory
    (J. Edmonds)
    University of Waterloo (Canada)
  • A. Keewatin Dewdney
    Extensions and Generalizations of Graph Theorems to Complexes and Hypergraphs
    (C. Nash-Williams)
    University of Western Ontario (Canada)
  • Edward Farrell
    On a General Class of Graph Polynomials
    (R. Read)
    University of the West Indies
  • Bert Hartnell
    The Characterization of Those Graphs Whose Spanning Trees Can Be Partitioned into Two Isomorphic Classes
    (R. Mullin)
    St. Mary's University (Canada)
  • Tom Jenkyns
    A Generalization of Matchings and Matroids
    (J. Edmonds)
    Brock University (Canada)
  • Scott Vanstone
    The Structure of Regular Pair-Wise Balanced Designs
    (R. Mullin)
    St. Jerome's University (Canada)

Start of page

1973

  • Anton Colijn
    Pseudo-Boolean Programming
    (G. Berman)
    University of Calgary (Canada)
  • Bill Pulleyblank
    Faces of Matching Polyhedra
    (J. Edmonds)
    The United States Military Academy (USA)
  • William Richardson
    Connectivity, Decomposition and Complexity in Matroids
    (U.S.R. Murty)
    Canadian Pacific Railways

Start of page

1972

  • Ben Gardner
    On Coverings and (r, λ) - Systems
    (R. Mullin)
    Memorial University (Canada)
  • Charles Little
    On Kasteleyn's Method of Enumerating the 1-Factors of a Graph
    (D. Younger)
    Massey University (New Zealand)

Start of page

1971

  • Gary Faulkner
    Recursive Generation of Cyclically k-Connected Cubic Planar Graphs
    (D. Younger)
  • Arthur Hobbs
    Hamiltonian Cycles in Powers of Graphs
    (W. Tutte)
    Texas A&M University (USA)
  • Joseph Horton
    Some Recursive Constructions of Combinatorial Designs
    (R. Mullin)
    University of New Brunswick (Canada)
  • Evi Nemeth
    A Study of Room Squares
    University of Colorado at Boulder (USA)
  • Paul Schellenberg
    Constructions for (Balanced) Room Squares
    (R. Mullin)
    University of Waterloo (Canada)

Start of page

1970

  • Richard Burns
    Nonlinear Programming without Differentiability
    (G. Berman)
    Queen's University (Canada)
  • Vasek Chvátal
    Hypergraphs and Ramseyian Theorems
    (C. Nash-Williams)
    Concordia University (Canada)
  • John Vranch
    Some Direct Constructions of Balanced Incomplete Block Designs
    (R. Mullin)
    Fanshawe College (Canada)
  • Jack Zimmer
    On Automorphisms of Graphs
    (C. Nash-Williams)
    University of North Dakota (USA)

Start of page

1969

  • Neil Robertson
    Graphs Minimal under Girth, Valency and Connectivity Constraints
    (W. Tutte)
    Ohio State University (USA)

Start of page