In this paper we study the classic problem of computing a maximum cardinality matching in general graphs G = (V, E). This problem has been studied extensively more than four decades. The best known algorithm for this problem till date runs in O(m \sqrt{n}) time due to Micali and Vazirani ... more >>>

The {\sc c-Balanced Separator} problem is a graph-partitioning problem in which given a graph G, one aims to find a cut of minimum size such that both the sides of the cut have at least cn vertices. In this paper, we present new directions of progress in the {\sc c-Balanced ... more >>>