András Frank

András Frank, born on 3 June 1949, is a Hungarian mathematician who works in combinatorics, with particular attention to graph theory and combinatorial optimisation. He directs the Institute of Mathematics of the Faculty of Sciences at Eötvös Loránd University in Budapest. With his student Éva Tardos he used the LLL algorithm to build a general method that turns certain polynomial-time algorithms into strongly polynomial ones. He also solved the problem of finding the fewest edges that must be added to an undirected graph so that the edge connectivity between any two vertices u and v is at least a prescribed number f(u,v). He took the Candidate of Mathematical Science degree in 1980 under the advice of László Lovász and the Doctor of Mathematical Science degree in 1990 from the Hungarian Academy of Sciences, of which he has been a corresponding member since 2016 and a full member since 2022. He was an invited speaker at the 1998 International Congress of Mathematicians in Berlin and has received the Tibor Szele Prize and the Albert Szent-Györgyi Prize.