Abstract:  A well-studied object in combinatorial optimization is the perfect matching polytope PMP(G) of a graph G - the convex hull of the incidence vectors of all perfect matchings of G.

Abstract: We will discuss Braverman and Rao's result that shows that the internal communication cost is same as the amortized communication complexity.

Abstract: For a set $S$ of $n$ points in the unit square $U$, let $T(S)$ be the minimum area of a triangle whose vertices are three distinct points of $S$. Let $T(n)=max T(S)$ where $S$ ranges over all set of $n$ points in U.

Abstract: In this talk, we will see a close connection between alternation-free sequences of words over the alphabet $\mathbb{Z}_n$ and parametric shortest paths in certain graphs.