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, October 31, 2014 — 3:30 PM EDT
A Set-Theoretic Approach to Fractional Iterates
| Speaker: | Ron Mullin, distinguished professor emeritus |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics and Computer Building (MC) 5136B |
Abstract:
This talk relates to an early excursion of Bill Tutte into professional level mathematics. The connection will be explained in the talk.
Tuesday, October 28, 2014 — 4:00 PM EDT
Combinatorial Positivity in the Schubert Calculus via Dual Equivalence Graphs
| Speaker: | Frank Sottile |
|---|---|
| Affiliation: | Texas A&M University |
| Room: | Mathematics and Computer Building (MC) 5136B |
Abstract:
Monday, October 27, 2014 (all day) to Wednesday, October 29, 2014 (all day)
The fundamental mandate of the workshop, co-organized by Professors Tom Coleman and Michele Mosca, is to provide a forum for both scientific presentations and discussion of issues related to quantum optimization. Optimization researchers will learn about the quantum technology and methodologies and the quantum researchers will learn about hard optimization problems that may yield to quantum optimization approaches.
Friday, October 24, 2014 — 3:30 PM EDT
Characterizations of Non-Seymour Graphs
| Speaker: | Zoltan Szigeti |
|---|---|
| Affiliation: | INP Grenoble and Ensimag |
| Room: | Mathematics and Computer Building (MC) 5136B |
Abstract:
Friday, October 17, 2014 — 3:30 PM EDT
The Matching Polynomial of a Graph
| Speaker: | Chris Godsil |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics 3 (M3) 3103 |
Abstract:
If p(G,k) denotes the number of matchings of size k in the graph G and n=|V(G)|, then the matching polynomial of G is
m(G,t) = \sum_k p(G,k) (-1)^k t^{n-2k}.
Thursday, October 16, 2014 — 3:00 PM EDT
Detecting Communities by Voting Model
| Speaker: | Yu. Nesterov |
|---|---|
| Affiliation: | CORE/UCL, Belgium |
| Room: | Mathematics and Computer Building (MC) 5136B |
Abstract:
Friday, October 10, 2014 — 3:30 PM EDT
Enumeration of Graphs with a Heavy-tailed Degree Sequence
| Speaker: | Nick Wormald |
|---|---|
| Affiliation: | Monash University |
| Room: | Mathematics (M3) 3103 |
Abstract:
Thursday, October 9, 2014 — 4:00 PM EDT
On the Diameter and Longest Paths in Random Apollonian Networks
| Speaker: | Jim Geelen |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics and Computer Building (MC) 6486 |
Abstract:
Friday, October 3, 2014 — 3:30 PM EDT
Approximation Algorithms for Vehicle-Routing Problems
| Speaker: | Chaitanya Swamy |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics 3 (M3) 3103 |
Abstract:
Thursday, October 2, 2014 — 4:00 PM EDT
Multivariate Diagonals, D-finite Functions, and Lattice Path Enumeration
| Speaker: | Stephen Melczer |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics and Computer Building (MC) 5168 |
Abstract:
Wednesday, October 1, 2014 (all day) to Friday, October 3, 2014 (all day)
The 6th International Conference on Post-Quantum Cryptography will be held at the Institute for Quantum Computing at the University of Waterloo. Professor Michele Mosca will serve as program chair, while Professor Alfred Menezes will serve as General Chair. The conference will be preceded by a summer school from September 29-30.