Title: Counting biased cliques
| Speaker: | Peter Nelson |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract: A biased graph is a pair consisting of an undirected graph G,
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.
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
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.
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
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,
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.
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.
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.
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.