The 2010 Laureates / Basic Sciences / Mathematical Sciences (including Pure Mathematics)
image

László Lovász

Hungary, U.S.A. / March 9, 1948
Mathematician
Professor, Eötvös Loránd University

"Outstanding Contributions to Mathematical Sciences Based on Discrete Optimization Algorithms"
Through his advanced research on discrete structures, Dr. Lovász has provided a link among various branches of mathematics in terms of algorithms, thereby influencing a broad spectrum of the mathematical sciences - including discrete mathematics, combinational optimization and theoretical computer science. In so doing, Dr. Lovász has made outstanding contributions to the advancement of both the academic and technological possibilities of the mathematical sciences.

BRIEF BIOGRAPHY
1948
Born in Budapest, Hungary
1971
Dr. Rher. Nat., Eötvös Loránd University
1971-1975
Research Associate, Eötvös Loránd University
1975-1978
Docent, József Attila University
1977
Dr. Math. Sci., Hungarian Academy of Sciences
1978-1982
Professor, József Attila University
1983-2006
Professor, Eötvös Loránd University
1993-2000
Professor, Yale University
1999-2006
Senior Researcher, Microsoft Research
2006-present
Director, Mathematical Institute, Eötvös Loránd University

SELECTED AWARDS AND HONORS
1979
George Pólya Prize, Society for Industrial and Applied Mathematics
1982
Delbert Ray Fulkerson Prize, American Mathematical Society
1998
Commander's Cross Order of Merit of the Republic of Hungary
1999
Wolf Prize in Mathematics, The Wolf Foundation
2001
Gödel Prize, Association for Computer Machinery and European
Association for Theoretical Computer Science
2007
Bolyai János Research Prize, Bolyai Prize Foundation
2008
Széchenyi Grand Prize, The Government of the Republic of Hungary
Members:
European Academy of Arts, Sciences and Humanities, Hungarian Academy of Sciences, The London Mathematical Society, German Academy of Sciences Leopoldina, Russian Academy of Sciences, The Royal Netherlands Academy of Arts and Sciences, The Royal Swedish Academy of Sciences

SELECTED PUBLICATIONS
1972
Normal hypergraphs and the perfect graph conjecture. Discrete Mathematics 2: 253-267.
1975
Problems and results on 3-chromatic hypergraphs and some related questions (Erdős, P. and Lovász, L.). in Infinite and Finite Sets, North Holland, Amsterdam, 609-627.
1979
On the Shannon capacity of graphs. IEEE Transactions on Information Society 25: 1-7.
1981
The ellipsoid method and its consequences in combinatorial optimization (Grötschel , M., Lovász, L., and Schrijver, A). Combinatorica 1: 169-197.
1982
Factoring polynomials with rational coefficients (Lenstra, A. K., Lenstra, H.W., and Lovász, L.). Mathematische Annalen 261: 515-534.
1996
Interactive proofs and the hardness of approximating cliques (Feige, U., Goldwasser, S., Lovász, L., Safra, S., and Szegedy, M.). Journal of the ACM 43: 268-292.