Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 5198884567, ext 33038
PDF files require Adobe Acrobat Reader.
Sun  Mon  Tue  Wed  Thu  Fri  Sat 

30

1

2

5

6








7

8

9

10

11

13









14

15

16

20







21

22

23

24

27








28

29

30

31

1

2

3








Title: Review of martingale theory, stochastic gradient descent, and adaptive linelinesearch for stochastic optimization.
Speaker: Courtney Paquette Affiliation: University of Waterloo Room: MC 5479Abstract: With the rise of large data sets, practical algorithms for machine learning often use probability and statistics.
Title: Controllable graphs
Speaker: Chris Godsil Affiliation: University of Waterloo Room: MC 6486Abstract: A graph is controllable if no eigenvector is orthogonal to the allones vector.
Title: Representable orientable matroids that are not realrepresentable
Speaker: Rutger Campbell Affiliation: University of Waterllo Room: MC 5417Abstract: In this talk we will have a brief introduction to oriented matroids and their relation to realrepresentability.
Title: Offline Assisted Group Key Exchange
Speaker: Gareth Davies Affiliation: Norwegian University of Science and Technology (NTNU) Room: MC 5417Abstract:
This talk will focus on the problem of forward secrecy in group key exchange (GKE), where most of the participants remain offline until they wish to compute the key.
Title: Basis Shape Loci and the Positive Grassmannian
Speaker: Cameron Marcot Affiliation: University of Waterloo Room: MC 6483Abstract: We study the set of kdimensional planes in R^n admitting a basis of vectors with prescribed supports.
Title: Tutorial on backpropagation and automatic differentiation
Speaker: Steve Vavasis Affiliation: University of Waterloo Room: MC 5479Abstract: In this presentation, I'll cover the basics of automatic differentiation (AD).
Title: Graphs of Homomorphisms
Speaker: Chris Godsil Affiliation: University of Waterloo Room: MC 6486Abstract: If X and Y are graphs and f is a function on V (X) taking values in V (Y ), then the graph of
f is the subset formed by the pairs (x; f(x)) for x in V (X).
Title: Extending Thomassen’s Theorem to Two Faces
Speaker: Joshua Nevin Affiliation: University of Waterloo Room: MC 5417Abstract:
Let G be a planar graph and let L be a listassignment for G in which there is a precolored edge on the outer face, every other vertex on the outer face has a list of size at least 3, and every other vertex in G has a list of size at least 5.
Title: Primaldual and Lagrangian relaxation techniques for kmedian
Speaker: Madison Van Dyk Affiliation: University of Waterloo Room: MC 5479Abstract: We will develop primaldual algorithms to obtain constantfactor approximations for the uncapacitated facility location problem.
Title: New algorithms for maximum disjoint paths based on treelikeness
Speaker: Matthias Mnich Affiliation: University of Bonn Room: MC 5501Abstract:
We study the classical NPhard problems of finding maximumsize subsets from given sets of k terminal pairs that can be routed via edgedisjoint paths (MaxEDP) or nodedisjoint paths (MaxNDP) in a given graph.
Title: Maximum Independent Sets in ErdosKoRado Combinatorics
Speaker: Nathan Lindzey Affiliation: University of Waterloo Room: MC 6486Abstract: We discuss a general algebraic method for characterizing maximum independent sets in graphs that arise in ErdosKoRado combinatorics, provided the graphs are large enough.
Title: Some problems on the size Ramsey numbers
Speaker: Gholam Reza Omidi Affiliation: Isfahan University of Technology Room: MC 5417Abstract: For given simple graphs $G_1$ and $G_2$, the size Ramsey number $\hat{R}(G_1,G_2)$ is the smallest positive integer $m$,
Title:Local Search Guarantees on Facility Location Problems
Speaker: Zishen Qu Affiliation: University of Waterloo Room: MC 5479Abstract: We will show that guarantees can be given on algorithms for the kmedian problem based on local search heuristics.
Title: Vertex Minors
Speaker: Jim Geelen Affiliation: University of Waterloo Room: MC 5501Abstract:
I will give an introduction to vertexminors of graphs. At first sight vertex minors are a bit peculiar but they are closely related to graph minors and possibly even easier to work with.
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 5198884567, ext 33038
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is centralized within our Office of Indigenous Relations.