Abstract
Minimum cut problems are among the most basic questions in algorithm design. In the last few years, there has been a resurgence in new results in this domain, resulting in the first improvements in many decades for many of these problems. In this talk, I will survey some of these results, focusing on the broad themes and techniques that have driven this progress.