Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
Welcome to Combinatorics and Optimization
The Department of Combinatorics and Optimization at the University of Waterloo invites applications for two tenure-track faculty positions at the rank of Assistant Professor.
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
News
- May 14, 2018Zhihan Gao's TSP paper featured as the SIGEST article in SIAM Review
Zhihan Gao's paper "On the metric s-t path traveling salesman problem" has been selected as the SIGEST article for the latest issue of SIAM Review.
- May 4, 2018Sally Dong is a 2018 recipient of the Jessie W.H. Zou Memorial Award
Sally Dong was awarded the 2018 Jessie W.H. Zou Memorial Award for Excellence in Undergraduate Research in the Faculty of Mathematics.
- Apr. 23, 2018Ahmad Abdi awarded a 2018 Huawei Prize
Ahmad Abdi is a recipient of the 2018 Huawei Prize for his paper "Packing odd T-joins with at most two terminals".
Events
- May 24, 2018Algebraic Combinatorics Seminar
Title: Asymptotics of the principal of specializations of Schubert polynomials
Speaker: Alejandro Morales Affiliation: University of Massachusetts Amherst Room: MC 6486 Abstract: Schubert polynomials were introduced by Lascoux and Sch\"utzenberger in 1982 to study Schubert varieties.
- May 24, 2018Algebraic Graph Theory Seminar
Title: Graph Reconstruction
Speaker: Cathy Wang Affiliation: University of Waterloo Room: MC 6486 Abstract: The graph reconstruction conjecture by Kelly and Ulam states that all graphs on at least three vertices are determined by their one-vertex deleted subgraphs, up to isomorphism.
- May 24, 2018Graphs and Matroids Seminar
Title: Finding Independent Transversals Efficiently
Speaker: Alessandra Graf Affiliation: University of Waterloo Room: MC 5479 Abstract: Let G be a graph whose vertex set is partitioned into classes V1,..., Vm. An independent transversal of G with respect to (V1,...,Vm) is an independent set {v1,...,vm} in G such that vi is in Vi for each i.