University COVID-19 update

The University of Waterloo is constantly updating our most Frequently Asked Questions.

Questions about buildings and services? Visit the list of Modified Services.

Please note: The University of Waterloo is closed for all events until further notice.

Welcome to Combinatorics and Optimization

Tutte's Distinguished Lecture Series 

The very successful Tutte's 100th Distinguished Lecture Series has now completed. That success has led to a Tutte Distinguished Lecture once per term. The next lecture will happen in the Spring term.

*Recordings of occurred talks are all available on C&O's YouTube Channel   

Grad Studies: Fall 2020 applications now open

 New Deadline: February 1, '20

  1. Feb. 3, 2021Luke Postle receives the Coxeter-James Prize
    Luke Postle

    The Canadian Mathematical Society (CMS) has named Luke Postle as the recipient of the 2021 Coxeter-James Prize for his work in graph theory.

  2. Jan. 28, 2021The optimal career path
    Jodie Wallis

    Jodie Wallis (BMath ’93) was a natural fit for Operations Research at the Faculty of Mathematics. “I liked how Operations Research brought together different disciplines and applied directly to business problems,” she affirmed. “That process of taking a problem, considering multiple layers of solutions, and ending up with something that’s elegant and workable in the real world was appealing to me.”

  3. Jan. 6, 2021David Gosset's paper published in Nature Physics
    Nature Physics

    C&O professor David Gosset has published a paper "Classical algorithms for quantum mean values" in Nature Physics.

Read all news
  1. Apr. 23, 2021Tutte Colloquium - Hao Hu

    Title: Robust Interior Point Methods for Key Rate Computation in Quantum Key Distribution

    Speaker: Hao Hu
    Affliliation: University of Waterloo
    Zoom: Contact Emma Watson


    We study semidefinite programs for computing the key rate in finite dimensional quantum key distribution (QKD) problems. Through facial reduction, we derive a semidefinite program which is robust and stable in the numerical computation. Our program avoids the difficulties for current algorithms from singularities that arise due to loss of positive definiteness. This allows for the derivation of an efficient Gauss-Newton interior point approach. We provide provable lower and upper bounds for the hard nonlinear semidefinite programming problem.

  2. Apr. 26, 2021Algebraic Graph Theory Seminar - Sabrina Lato

    Title: A Spectral Moore Bound for Bipartite Semiregular Graphs

    Speaker: Sabrina Lato
    Affiliation: University of Waterloo
    Zoom: Contact Soffia Arnadottir


    The Moore bound provides an upper bound on the number of vertices of a regular graph with a given degree and diameter, though there are disappointingly few graphs that achieve this bound. Thus, it is interesting to ask what additional information can be used to give Moore-type bounds that are tight for a larger number of graphs. Cioaba, Koolen, Nozaki, and Vermette considered regular graphs with a given second-largest eigenvalue, and found an upper bound for such graphs.

All upcoming events