My research focuses on developing provably fast algorithms for fundamental graph problems. A particular focus is the development of fast - and ultimately practical - algorithms to compute network flows of all kinds. Network flows are essential to graph algorithms and are used to model complex transportation and routing problems, electric networks, and machine-learning problems and arise as important subproblems in many other graph problems.