Simon Fraser University

Abstract: The graph isomorphism (GI) problem asks if two given graphs are isomorphic or not. That is, it asks there exists a one-to-one mapping between two given graphs. The GI problem is quite basic, but it's time complexity isa long standing open...

Abstract: Garg Vazarani and Yannakakis showed that the integrality gap for (the natural LP relaxation of) maximum disjoint paths (MEDP) in planar graphs is $\\Omega(\\sqrt{n})$. Noting that their gap example (a grid minor) all but disappears if edge...

Abstract: An \\emph{intertwine} of two graphs $G$ and $H$ is a graph that has both $G$ and $H$ as a minor and is minor-minimal with this property. In 1979, Lov\\'{a}sz and Unger conjectured that for any two graphs $G$ and $H$, there are only a finite...

Abstract: The body-centered cubic (BCC) lattice is the optimal three-dimensional sampling lattice. Its optimality stems from the fact that its dual, the face-centered cubic (FCC) lattice, achieves the highest sphere-packing efficiency. In order to...

The goal of this event is to link our research programs and students and provide a jumping off point for future collaboration.

David Blackwell preferred to write short, direct papers dissectingproblems cleanly and showing the rest of us why things have to be theway they are. I plan to talk about David's life, describe a few of thethings he is famous for (Markov Chains...

With the advance of huge distributed parallel clusters manyof the current discretizations of parabolic problems are becoming slow and inefficient which opens the need for the development of new techniques. The usual bottleneck of the parallel...

Cancer comes about by a sequence of mutations that change the cells' fitness and create advantageous phenotypes. These phenotypes displace other cells and spread, thus winning the evolutionary competition. It is possible that in order to create those...