Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Friday, June 29, 2018 3:30 PM EDT
Title: The c2 invariant at p=2 by counting edge bipartitions
| Speaker: | Karen Yeats |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
Since no one provided a visitor or volunteered for this week, I will explain how to prove a special case of a conjecture about the c2 invariant.
Thursday, June 28, 2018 3:30 PM EDT
Title: Stretching drawings of graphs
| Speaker: | Alan Arroyo |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract: Given a drawing D of a graph (where vertices are dots in the plane and edges are arbitrary curves connecting some pairs of dots),
Thursday, June 28, 2018 11:30 AM EDT
Title: The Many Faces of Circulation Algebras
| Speaker: | Nick Olson-Harris |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract: The circulation algebra is a commutative graded algebra associated to a graph, introduced by Wagner in 1998 to study flows.
Friday, June 22, 2018 3:30 PM EDT
Title: Two-level polytopes
| Speaker: | Kanstantsin Pashkovich |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
This talk is dedicated to two-level polytopes. On one side, two-level polytopes form a well structured family of polytopes.
Thursday, June 21, 2018 3:30 PM EDT
Title: The price of connectivity for domination
| Speaker: | Paul Ouvrard |
| Affiliation: | University of Bordeaux |
| Room: | MC 5479 |
Abstract: The price of connectivity for dominating set in a graph G is the ratio between the minimum sizes of a connected dominating set and a dominating set of G.
Tuesday, June 19, 2018 3:00 PM EDT
Title: Minimization of convex compositions
| Speaker: | Courtney Paquette |
| Affiliation: | Lehigh University |
| Room: | MC 6486 |
Abstract:
Numerous optimization tasks can be posed as minimization of a finite convex function composed with a smooth map. Phase retrieval and matrix factorization problems are common examples.
Friday, June 15, 2018 3:30 PM EDT
Title: Distributed coloring in planar graphs
| Speaker: | Marthe Bonamy |
| Affiliation: | University of Bordeaux |
| Room: | MC 5501 |
Abstract:
We are concerned with efficiently coloring sparse graphs in the distributed setting with as few colors as possible. According to the celebrated Four Color Theorem, planar graphs can be colored with at most 4 colors, and the proof gives a (sequential) quadratic algorithm finding such a coloring.
Thursday, June 14, 2018 3:30 PM EDT
Title: Hamilton cycles in cubic planar graphs
| Speaker: | Frantisek Kardos |
| Affiliation: | University of Bordeaux |
| Room: | MC 5479 |
Abstract: Tait conjectured in 1884 that each cubic planar graph contains a Hamilton cycle. Had the conjecture been true,
Tuesday, June 12, 2018 1:00 PM EDT
Title: On isogeny graphs of supersingular elliptic curves over finite fields- Part 2
| Speaker: | Gora Adj |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract: After having defined the supersingular isogeny graph, in this second talk
Friday, June 8, 2018 3:30 PM EDT
Title: Online Learning of Quantum States
| Speaker: | Ashwin Nayak |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
Suppose we have many copies of an unknown n-qubit state rho. We measure some copies of rho using a known two-outcome measurement E_1, then other copies using a measurement E_2, and so on.
Wednesday, June 6, 2018 3:30 PM EDT
Title: All Graphs are Beautiful
| Speaker: | Alan Arroyo |
| Affiliation: | University of Waterloo |
| Room: | MC 5417 |
Abstract: In this talk I will show that all graphs are beautiful. The proof is by induction on g
Tuesday, June 5, 2018 1:00 PM EDT
Title: On isogeny graphs of supersingular elliptic curves over finite fields
| Speaker: | Gora Adj |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract: In this talk we will present some results on the isogeny graphs of supersingular elliptic curves
Friday, June 1, 2018 3:30 PM EDT
Title: Parameterized Approximation Algorithms for Steiner Network Problems
| Speaker: | Andreas Feldmann |
| Affiliation: | Charles University, Prague, Czech Republic |
| Room: | MC 5501 |
Abstract:
Two standard approaches to handle NP-hard optimization problems are to develop approximation and parameterized algorithms.