Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
Welcome to Combinatorics and Optimization
Spring 2018 Undergraduate Research Assistantship Program (URA). Applications for the Spring 2018 program are now closed.
Tutte's Distinguished Lecture Series
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 is:
Sergey Norin - November 2
*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
News
- Oct. 18, 2018Constant-time quantum computers more powerful than classical counterparts
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.
- 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.
- 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.
Events
- Oct. 25, 2018Algebraic Graph Theory Seminar- Nathan Lindzey
Title: Maximum Independent Sets in Erdos-Ko-Rado Combinatorics
Speaker: Nathan Lindzey Affiliation: University of Waterloo Room: MC 6486 Abstract: We discuss a general algebraic method for characterizing maximum independent sets in graphs that arise in Erdos-Ko-Rado combinatorics, provided the graphs are large enough.
- Oct. 25, 2018Graphs and Matroids Seminar- Gholam Reza Omidi
Title: Some problems on the size Ramsey numbers
Speaker: Gholam Reza Omidi Affiliation: Isfahan University of Technology Room: MC 5417 Abstract: For given simple graphs $G_1$ and $G_2$, the size Ramsey number $\hat{R}(G_1,G_2)$ is the smallest positive integer $m$,
- Oct. 26, 2018CombOpt Reading Group- Zishen Qu
Title:Local Search Guarantees on Facility Location Problems