Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
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