András Frank
András Frank (born June 3, 1949 in Budapest ) is a Hungarian mathematician who deals with combinatorics .
Frank studied at the Loránd Eötvös University from 1967 to 1972 and received his doctorate under László Lovász at the Hungarian Academy of Sciences in 1980 and habilitated in 1990 (doctoral degree in the Russian system). He is a professor in the Operations Research department at Lorand Eötvös University. From 2011 to 2014 he is also director of the Mathematical Institute there.
Frank is particularly concerned with graph theory and combinatorial optimization . He founded and heads the research group for combinatorial optimization at Eötvös University and the Hungarian Academy of Sciences (EGRES).
With his doctoral student Éva Tardos he showed how some polynomialzeitlich detachable combinatorial optimization problems can be solved much polynomialzeitlich.
In 2002 he received the Tibor Szele Prize of the Janos Bolyai Society and in 2009 the Albert Szent-Györgyi Prize.
Fonts
- Connections in combinatorial optimization, Oxford University Press 2011
Web links
Individual evidence
- ↑ EGRES
- ^ Mathematics Genealogy Project
- ^ Frank, Tardos An application of simultaneous diophantine approximation in combinatorial optimization , Combinatorica, Volume 7, 1987, pp. 49-65
| personal data | |
|---|---|
| SURNAME | Frank, András |
| BRIEF DESCRIPTION | Hungarian mathematician |
| DATE OF BIRTH | June 3, 1949 |
| PLACE OF BIRTH | Budapest |