3 June 1949 |
|Alma mater||University of Szeged|
|Institutions||Eötvös Loránd University|
|Doctoral advisor||László Lovász|
|Doctoral students||András Sebő
András Frank (born 3 June 1949) is a Hungarian mathematician, working in combinatorics, especially in graph theory, and combinatorial optimisation. He is director of the Institute of Mathematics of the Eötvös Loránd University, Budapest.
Using the LLL-algorithm, Frank, and his student, Éva Tardos developed a general method, which could transform some polynomial-time algorithms into strongly polynomial. He solved the problem of finding the minimum number of edges to be added to a given undirected graph so that in the resulting graph the edge-connectivity between any two vertices u and v is at least a predetermined number f(u,v).
He received the Candidate of Mathematical Science degree in 1980, advisor: László Lovász, and the Doctor of Mathematical Science degree (1990) from the Hungarian Academy of Sciences. He was awarded the Tibor Szele Prize of the János Bolyai Mathematical Society in 2002 and the Albert Szent-Györgyi Prize in 2009. In June 2009 the ELTE Mathematical Institute sponsored a workshop in honor of his 60th birthday.
- Frank, András; Tardos, Éva (1987), "An application of simultaneous diophantine approximation in combinatorial optimization", Combinatorica, 7 (1): 49–65, doi:10.1007/BF02579200.
- Frank, András (1992), "Augmenting graphs to meet edge-connectivity requirements" (PDF), SIAM Journal on Discrete Mathematics, 5 (1): 25–53, doi:10.1137/0405003.
- András Frank at the Mathematics Genealogy Project.
- Szele Tibor Emlékérem (in Hungarian). János Bolyai Mathematical Society, retrieved 2010-01-21.
- News about mathematics, Eötvös Loránd University, Faculty of Science, Institute of Mathematics, retrieved 2010-01-21.
- Frank András 60. születésnapja alkalmából (in Hungarian), retrieved 2010-01-21.
|This article about a Hungarian scientist is a stub. You can help Wikipedia by expanding it.|
|This article about a European mathematician is a stub. You can help Wikipedia by expanding it.|