András Frank is a Professor at the Department of Operations Research, Eötvös Loránd University, Budapest. As founder and leader of the MTA-ELTE Egerváry Research Group on Combinatorial Optimization (EGRES), he focuses on combinatorial optimization, matroid theory, submodular functions, matchings, graph theory, and polynomial-time algorithms. University: Eötvös Loránd University Department: Operations Research Research Group: EGRES (MTA-ELTE Egerváry Research Group on Combinatorial Optimization) His research addresses both theoretical and applied aspects of combinatorial optimization, including network flows, graph connectivity, and algorithmic applications. He authored the book Connections in Combinatorial Optimization (Oxford University Press, 2011), which explores polynomial-time algorithms and their role in graph theory and matroid theory. Key trends in his recent work include fair integral flows, discrete convex optimization, and algorithmic approaches to supermodular functions. While no specific scientific awards are listed in the provided texts, his contributions have been recognized through publications in top-tier venues and leadership in the EGRES group.
