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 1, '19

  1. Oct. 18, 2018Constant-time quantum computers more powerful than classical counterpartsGraphic showing the circuit width depth

    Written by Institute for Quantum Computing staff

    Quantum computers can solve a linear algebra problem faster than classical computers, according to a new study published in Science. The finding proves that constant-depth quantum circuits are more powerful than their classical counterparts, and provides a new sense of how quantum technology will be a key to more powerful computing.

  2. 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.

  3. 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.

Read all news
  1. Oct. 18, 2018Algebraic Graph Theory Seminar- Chris Godsil

    Title: Graphs of Homomorphisms

    Speaker: Chris Godsil
    Affiliation: University of Waterloo
    Room: MC 6486

    Abstract: If X and Y are graphs and f is a function on V (X) taking values in V (Y ), then the graph of
    f is the subset formed by the pairs (x; f(x)) for x in V (X).

  2. Oct. 18, 2018Graphs and Matroids Seminar

    Title: Extending Thomassen’s Theorem to Two Faces

    Speaker: Joshua Nevin
    Affiliation: University of Waterloo
    Room:  MC 5417


    Let G be a planar graph and let L be a list-assignment for G in which there is a precolored edge on the outer face, every other vertex on the outer face has a list of size at least 3, and every other vertex in G has a list of size at least 5.

  3. Oct. 19, 2018Combinatorial Optimization

    Title: Primal-dual and Lagrangian relaxation techniques for k-median

    Speaker: Madison Van Dyk
    Affiliation: University of Waterloo
    Room:  MC 5479

    Abstract: We will develop primal-dual algorithms to obtain constant-factor approximations for the uncapacitated facility location problem.

All upcoming events