THIS SITE

Information for

Events

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:

We continue to investigate the work by Wang and others, aimed
at proving that almost all graphs are determined by their characteristic polynomials, using lattices and number theory.

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

Speaker: Da Qi Chen
Affiliation: University of Waterloo
Room: M3 3103

Abstract: Tutte's Four-Flow Conjecture states that every bridgeless,  
Petersen-minor-free graph admits a nowhere-zero 4-flow. This hard conjecture has been open for over half a century with no significant progress in the first forty years.

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

We discuss NP-hardness, LP relaxations and approximation algorithms.

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

Title: Approximation algorithm for k-anonymity

S M T W T F S
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
  1. 2017 (65)
    1. September (3)
    2. August (3)
    3. July (5)
    4. June (9)
    5. May (10)
    6. April (7)
    7. March (13)
    8. February (10)
    9. January (5)
  2. 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)
  3. 2015 (136)
  4. 2014 (88)
  5. 2013 (48)
  6. 2012 (39)
  7. 2011 (36)
  8. 2010 (40)
  9. 2009 (40)
  10. 2008 (39)
  11. 2007 (15)