Welcome to Combinatorics and Optimization
Spring 2019 Undergraduate Research Assistantship Program (URA). Applications for the Spring 2019 program are now closed.
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.
New Deadline: February 1, '19
- June 14, 2019
Samuel Jaques will be awarded the Governor General's Gold Medal (Master) at the June 14th convocation ceremony for his outstanding academic performance.
Under the supervision of Alfred Menezes and Michele Mosca, Jaques achieved an average of 97 per cent during his Master's program while he held an NSERC Graduate Scholarship. He was also awarded the President's Graduate Scholarship and the Rai Mathematics Graduate Scholarship.
- June 13, 2019
This new prize will be awarded annually to recognize the achievement of graduating doctoral students in the Faculty of Mathematics.
- June 10, 2019
Congratulations to the 12 M.Math. and 3 Ph.D. C&O students who will be awarded their graduate degrees at the Spring 2019 convocation ceremonies!
- June 20, 2019
Title: Arborified zeta values and shuffles of rooted trees
Speaker: Pierre Clavier Affiliation: Potsdam University Room: MC 6483*
*Please note room change
Arborified zeta values are a generalisation to rooted trees of the usual multizeta values.
- June 20, 2019
Title: The Parallel Postulate: a 2000-year controversy
Speaker: Eric Thomas Boulter Affiliation: University of Waterloo Room: MC 5501
Euclid's book The Elements was groundbreaking in its logical formulation of synthetic geometry, and it is profoundly influential to this day, as it is widely considered to be the most published non-religious book in human history.
- June 21, 2019
Title: Maximum Cardinality Popular Matchings
Speaker: Ishan Bansal Affiliation: University of Waterloo Room: MC 5479
We have seen the algorithm by Abraham, Irving, Kavitha, and Mehlhorn which deals with finding popular matchings (can be easily modified to give maximum cardinality popular matchings) in bipartite graphs with one-sided preference lists.