About

The purpose of our reading group is for students to learn new things, gain practice presenting research to their peers, and possibly pick up a research question or two in the process.

The reading group is hosted by students of University of Waterloo in the Department of Combinatorics and Optimization.

Each semester we cover a new topic in combinatorial optimization. Click here for a list of topics that we have covered.

Right now, we are covering papers on Matchings.

When: Mondays at 1 pm

Where: MC 6029

Mailing List: To stay up to date, subscribe to our mailing list.

We have a Youtube Channel: Head over to our channel to see recordings of previous talks.

If you have any suggestions, comments or criticisms, please do not hesitate to contact the co-organizers: Rian Neogi, David Aleman or Nathan Benedetto.

Upcoming Talks

Recent Talks

NC algorithm to find perfect matching in planar graphs
by Prashant Gokhale Abstract
Approximating Graphic TSP with matchings, Part II
by Sina Kalantarzadeh Abstract
Approximating Graphic TSP with matchings
by Sina Kalantarzadeh Abstract
Bipartite Perfect Matching is in Quasi-NC, Part II
by Rian Neogi Abstract