Information for

Welcome to Combinatorics and Optimization

Spring 2018 Undergraduate Research Assistantship Program (URA)Applications for the Spring 2018 program are now closed.

Tutte's 100th Distinguished Lecture Series 

University of Waterloo, May 5 - August 18, '17      

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

Grad Studies: Fall 2018 applications now open

 New Deadline: February 9, '18

  1. Aug. 17, 2018Hausdorff workshop on combinatorial optimization

    Professor Jochen Koenemann is a co-organizer of a followup workshop to the 2015 Trimester Program on Combinatorial Optimization.

  2. Aug. 1, 2018David Gosset joins the C&O department

    On August 1, David Gosset joined the Department of Combinatorics and Optimization as an Associate Professor.

  3. July 12, 2018Operations Research Challenge (TORCH)

    On March 17, 2018,  over 40 high school students from the Waterloo Region tested their math skills and learned more about the field of operations research at the The Operations Research Challenge (TORCH). 

Read all news
  1. Sep. 21, 2018Tutte Colloquium - David Gosset

    Title: Quantum advantage with shallow circuits

    Speaker: David Gosset
    Affiliation: University of Waterloo
    Room: MC 5501


    A constant-depth quantum circuit is a parallel quantum computation that proceeds for a constant number of time steps.  In this work we prove that constant-depth quantum circuits are more powerful than their classical counterparts.

  2. Sep. 26, 2018Continuous Optimization Seminar

    Title: Classification, Regularization and Logistic Regression

    Speaker: Haesol Im
    Affiliation: University of Waterloo
    Room: MC 5479

    Abstract: For the first two seminar series in machine learning,

  3. Sep. 27, 2018Graphs and Matroids Seminar

    Title: A characterization of (p,q)-mixing when p/q < 4

    Speaker: Ben Moore
    Affiliation: University of Waterloo
    Room: MC 5417

    Abstract: Let Hom(G,H) be the graph whose vertex set is the set of H-colourings of G, and two H-colourings f and g are adjacent if f differs from g in at most one vertex.

All upcoming events