András Frank

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.

The native form of this personal name is Frank András. This article uses Western name order when mentioning individuals.
András Frank
Born (1949-06-03) 3 June 1949
Budapest
Nationality Hungary
Alma materUniversity of Szeged
Scientific career
FieldsMathematics
InstitutionsEötvös Loránd University
Doctoral advisorLászló Lovász
Doctoral studentsAndrás Sebő
Éva Tardos

Mathematical work

Using the LLL-algorithm, Frank, and his student, Éva Tardos developed a general method, which could transform some polynomial-time algorithms into strongly polynomial.[1] 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).[2]

Degrees, awards

He received the Candidate of Mathematical Science degree in 1980, advisor: László Lovász,[3] and the Doctor of Mathematical Science degree (1990) from the Hungarian Academy of Sciences. In 1998 he was an Invited Speaker of the International Congress of Mathematicians in Berlin.[4] He was awarded the Tibor Szele Prize of the János Bolyai Mathematical Society in 2002[5] and the Albert Szent-Györgyi Prize in 2009.[6] In June 2009 the ELTE Mathematical Institute sponsored a workshop in honor of his 60th birthday.[6][7]

gollark: Not if I accelerate Palaiologos to 0.999999999 *c*.
gollark: You really shouldn't specify ages without reference frames.
gollark: Just buy more disks.
gollark: Why would you *ever* delete data?
gollark: Rust is very nitpicky about timings.

References
  1. Frank, András; Tardos, Éva (1987), "An application of simultaneous diophantine approximation in combinatorial optimization", Combinatorica, 7 (1): 49–65, doi:10.1007/BF02579200.
  2. 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.
  3. András Frank at the Mathematics Genealogy Project.
  4. Frank, András (1998). "Applications of relaxed submodularity". Doc. Math. (Bielefeld) Extra Vol. ICM Berlin, 1998, vol. III. pp. 343–354.
  5. Szele Tibor Emlékérem (in Hungarian). János Bolyai Mathematical Society, retrieved 2010-01-21.
  6. News about mathematics, Eötvös Loránd University, Faculty of Science, Institute of Mathematics, retrieved 2010-01-21.
  7. Frank András 60. születésnapja alkalmából Archived 2011-07-21 at the Wayback Machine (in Hungarian), retrieved 2010-01-21.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.