Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Thursday, October 25, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

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

Thursday, October 25, 2018 3:30 pm - 3:30 pm EDT (GMT -04:00)

Graphs 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$,

Friday, October 26, 2018 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Jim Geelen

Title: Vertex Minors

Speaker: Jim Geelen
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

I will give an introduction to vertex-minors of graphs. At first sight vertex minors are a bit peculiar but they are closely related to graph minors and possibly even easier to work with.

Friday, November 2, 2018 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Distinguished Lecture - Sergey Norin

Title: Razborov's flag algebras: Ten years on

Speaker: Sergey Norin
Affiliation: McGill University
Room: MC 5501

Abstract:

Many of the classical results in extremal combinatorics were obtained by ingenious application of elementary techniques, such as induction and Cauchy-Schwarz inequality.

Friday, November 9, 2018 1:00 pm - 1:00 pm EST (GMT -05:00)

Combinatorial Optimization Reading Group- Thomas Baxter

Title: Approximate Clustering without the Approximation

Speaker: Thomas Baxter
Affiliation: University of Waterloo
Room: MC 5417

Abstract: Previously in this CombOpt Reading Group series, we have discussed improving approximation factors for particular distance-based objective functions in clustering problems.

Friday, November 9, 2018 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte Colloquium - Chaitanya Swamy

Title: Approximation Algorithms for Distributionally Robust Stochastic Optimization

Speaker: Chaitanya Swamy
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

Two-stage stochastic optimization is a widely-used framework for modeling uncertainty, where we have a probability distribution over possible realizations of the data, called scenarios, and decisions are taken in two stages: we make first-stage decisions knowing only the underlying distribution and before a scenario is realized, and may take additional second-stage recourse actions after a scenario is realized.