Algorithms, Network Design and Analysis, Optimization

Office: 5153 Upson

Phone: 607.255.0984

Website: click here

Fax: 607.255.4428

After earning her doctorate at Eötvös University in Budapest, Hungary in 1984, Professor Tardos held a Humboldt Fellowship at the University of Bonn, and a postdoctoral fellowship at the Mathematical Sciences Research Institute in Berkeley. In 1986-87, she returned to Eötvös on a fellowship from the Hungarian Academy of Sciences. After two years as a visiting professor at the Massachusetts Institute of Technology, Tardos joined the faculty at Cornell in 1989. Tardos is also a member of the graduate field of Operations Research.

In 1988, Tardos won the Fulkerson Prize, awarded jointly by the Mathematical Programming Society and the American Mathematical Society. She was awarded an Alfred P. Sloan Research Fellowship (1991-93), a National Science Foundation Presidential Young Investigator Award (1991-96), a Guggenheim Fellowship (1999-2000), and the David and Lucille Packard Foundation Fellowship in Science and Engineering (1990-95). She is a member of the American Academy of Arts and Sciences and is an ACM Fellow. She is editor-in-chief of SIAM Journal on Computing, and on the editorial board of Journal of the ACM and Combinatorica.

Tardos's research interest focuses on the design and analysis of efficient methods for combinatorial optimization problems on graphs or networks. Such problems arise in many applications such as vision, and the design, maintenance, and management of communication networks. She is mostly interested in fast combinatorial algorithms that provide provably optimal or close-to-optimal results. She is most known for her work on network-flow algorithms, approximation algorithms for network flows, cut, and clustering problems. Her recent work focuses on algorithmic game theory, an emerging new area of designing systems and algorithms for selfish users.