University COVID-19 update

The University of Waterloo is constantly updating our most Frequently Asked Questions.

Questions about buildings and services? Visit the list of Modified Services.

Please note: The University of Waterloo is closed for all events until further notice.

Events - 2016

Thursday, October 6, 2016 — 3:30 PM to 4:30 PM EDT

Title: ADMM for SDP Relaxation of GP

Speaker: Hao Sun
Affiliation: University of Waterloo
Location: MC 6486

Abstract:

Thursday, October 6, 2016 — 3:30 PM EDT

Title: Circle Graph Obstructions - Part II

Speaker: Edward Lee
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

Thursday, September 29, 2016 — 3:30 PM EDT

Title: Circle Graph Obstructions

Speaker: Edward Lee
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

A circle graph is the intersection graph of a set of chords drawn on a circle.  We present a graphic proof of Bouchet's characterization of the class of circle graphs. 

Friday, September 23, 2016 — 3:30 PM EDT

Title: Convex Drawings of K(n)   

Speaker: Bruce Richter
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

Thursday, September 22, 2016 — 3:30 PM EDT

Title: Unavoidable minors for k-connectivity: a generalization of the Grid Theorem (Part 2 of 2)

Speaker: Benson Joeris
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

Friday, September 16, 2016 — 3:30 PM EDT

Title: Loci of Complex Polynomials

Thursday, September 15, 2016 — 3:30 PM EDT

Title: Stronger Rolle's Theorem for Complex Polynomials

Speaker: Hristo Sendov
Affiliation: University of Western Ontario
Room: MC 5501

Abstract:

Thursday, September 15, 2016 — 3:30 PM EDT

Title: Unavoidable minors for k-connectivity: a generalization of the Grid Theorem

Speaker: Benson Joeris
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

Thursday, September 15, 2016 — 2:00 PM EDT

Title: New spectral bounds on the chromatic number

Speaker: Sina Rezazadeh
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Thursday, September 8, 2016 — 2:00 PM EDT

Title: Cospectral graphs, cospectral complements

Speaker: Chris Godsil
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Tuesday, August 23, 2016 — 3:30 PM EDT

Title: Intriguing Sets in Quadrangles, Hexagons and Octagons

Tuesday, August 16, 2016 — 3:30 PM EDT

Title: Lattices and Graph Spectra Part II

Speaker: Chris Godsil
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Tuesday, August 9, 2016 — 3:30 PM EDT

Title: Lattices and Graph Spectra

Speaker: Chris Godsil
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Tuesday, August 9, 2016 — 2:30 PM to 3:20 PM EDT

Title: Controllable Graphs Determined by their Generalized Spectrums

Speaker: Chen Xie
Affiliation: University of Waterloo
Room: MC 6486

Abstract

Tuesday, August 9, 2016 — 2:30 PM to 3:20 PM EDT

Title: Metric s-t path TSP and the randomized Christofides algorithm

Speaker: Shatian Wang
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Monday, August 8, 2016 — 3:38 PM to 4:30 PM EDT

Title: Separation Dimension of Graphs and Hyper Graphs

Speaker: L. Sunil Chandran
Affiliation Indian Institute of Science, Bangalore
Room MC 6486

Abstract

Friday, August 5, 2016 — 3:30 PM EDT

Title: Almost all matroids are non-representable

Thursday, August 4, 2016 — 2:30 PM EDT

Title: Drawings of Complete Graphs

Speaker: Matthew Sunohara
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Thursday, August 4, 2016 — 2:30 PM EDT

Title: Folding Operation on 3-by-2n Standard Young Tableaux

Speaker: Shelley Wu
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Wednesday, August 3, 2016 — 4:00 PM to 5:30 PM EDT

Title: On Cyclically 5-Connected Graphs

Tuesday, August 2, 2016 — 2:30 PM EDT

Title: Min cost bridgeless subgraph of min degree 2 (bridgeless D2)

Speaker: Jack Dippel
Affiliation: University of Waterloo
Room: MC 6486

Abstract: In the bridgeless D2 problem we have a graph with nonnegative edge costs and the goal is to complete a min cost subgraph of degree at least 2 at every node that has no bridges (i.e. no cut edges.).

Tuesday, August 2, 2016 — 2:30 PM EDT

Title: Approximation algorithm for k-anonymity

Friday, July 29, 2016 — 3:30 PM EDT

Title: The chance-constrained vehicle routing problem

Speaker: Ricardo Fukasawa
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

Tuesday, July 26, 2016 — 3:30 PM EDT

Title: Fast quantum search with continuous quantum walk on graphs

Tuesday, July 26, 2016 — 2:30 PM to 3:20 PM EDT

Title: Structured Bilinear Mixed-Integer Programming

Speaker: Billy Jin
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Pages

S M T W T F S
27
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
6
  1. 2021 (8)
    1. January (8)
  2. 2020 (119)
    1. December (5)
    2. November (12)
    3. October (12)
    4. September (12)
    5. August (11)
    6. July (17)
    7. June (11)
    8. May (6)
    9. March (11)
    10. February (11)
    11. January (11)
  3. 2019 (167)
  4. 2018 (136)
  5. 2017 (103)
  6. 2016 (137)
    1. December (5)
    2. November (12)
    3. October (10)
    4. September (8)
    5. August (12)
    6. July (15)
    7. June (14)
    8. May (16)
    9. April (8)
    10. March (18)
    11. February (11)
    12. January (8)
  7. 2015 (136)
  8. 2014 (88)
  9. 2013 (48)
  10. 2012 (39)
  11. 2011 (36)
  12. 2010 (40)
  13. 2009 (40)
  14. 2008 (39)
  15. 2007 (15)