Welcome to Combinatorics and Optimization

The C&O department has 33 faculty members and 60 graduate students. We are intensely research oriented and hold a strong international reputation in each of our six major areas:

Read more about the department's research to learn of our contributions to the world of mathematics!


Spring 2022 Undergraduate Research Assistantship Program: APPLICATIONS OPEN

An opportunity to hone your research skills while learning more about the great applications of Combinatorics and Optimization in our world today!

Applications close December 13, 2021.

Contact Chloe Pottier with any questions.


Two Tenure-Track Faculty Positions Available in C&O

Visit our Career opportunities page for more details. 



  1. Nov. 17, 2021Michael J. Best (1946-2021)
    Michael J Best

    We are saddened to announce that our colleague and friend Michael Best, Professor of Combinatorics and Optimization at University of Waterloo, passed away on November 10 after a battle with cancer.

  2. Oct. 13, 2021Fall 2021 convocation
    Convocation Fall 2021

    Five Ph.D. and four M.Math. C&O students will receive their degrees at the Fall 2021 convocation on October 22.

  3. Oct. 7, 2021C&O M.Math. student wins a gold medal at ICPC 2021
    Dmitry Sayutin

    Dmitry Sayutin's team at the ITMO University in St. Petersburg won a gold medal at ICPC 2021.

Read all news
  1. Dec. 3, 2021Tutte Colloquium - Minh Bui

    Title: Warped Proximal Iterations for Multivariate Convex Minimization in Hilbert Spaces

    Speaker: Minh Bui
    Affiliation: University of Waterloo
    Zoom: Please email Emma Watson

    Abstract:

    We propose a multivariate convex minimization model which involves a mix of nonsmooth and smooth functions, as well as linear mixtures of the variables. This formulation captures a wide range of concrete scenarios in the literature. A limitation of existing methods is that they do not achieve full splitting of our problem in the sense that each function and linear operator is activated separately. To circumvent this issue, we propose a novel approach, called warped proximal iterations, for solving this problem.

All upcoming events