Fulkerson Prize

Fulkerson Prize

The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Programming Society (MPS) and the American Mathematical Society (AMS). Up to three awards of $1500 each are presented at each (triennial) International Symposium of the MPS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS.

Winners

* 1979: Richard M. Karp; Kenneth Appel and Wolfgang Haken; Paul Seymour.
* 1982: D.B. Judin and A.S. Nemirovskii; Leonid Khachiyan; G. P. Egorychev; D.I. Falikman; Martin Grötschel, Laszlo Lovasz and Alexander Schrijver.
* 1985: Jozsef Beck; H. W. Lenstra, Jr.; Eugene M. Luks.
* 1988: Éva Tardos; Narendra Karmarkar.
* 1991: Martin E. Dyer, Alan M. Frieze and Ravindran Kannan; Alfred Lehman; Nikolai E. Mnev.
* 1994: Louis Billera; Gil Kalai; Neil Robertson, Paul Seymour and Robin Thomas.
* 1997: Jeong Han Kim.
* 2000: Michel X. Goemans and David P. Williamson; Michele Conforti and Gerard Cornuejols and M. R. Rao.
* 2003: J. F. Geelen, A. M. H. Gerards and A. Kapoor; Bertrand Guenin; Satoru Iwata, Lisa Fleischer, Satoru Fujishige; Alexander Schrijver.
* 2006: Manindra Agarwal, Neeraj Kayal and Nitin Saxena; Mark Jerrum, Alistair Sinclair and Eric Vigoda; Neil Robertson and Paul Seymour.

External links

* [http://www.ams.org/prizes/fulkerson-prize.html Official site with award details]


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • D. R. Fulkerson — Delbert Ray Fulkerson (August 14, 1924 – January 10, 1976) was a mathematician who co developed the Ford Fulkerson algorithm, one of the most well known algorithms to solve the maximum flow problem in networks. Fulkerson was brought up in small… …   Wikipedia

  • Manindra Agrawal — मणीन्द्र अग्रवाल Born May 20, 1966 (1966 05 20) (age 45) Allahabad, India Residence …   Wikipedia

  • Combinatorica — is an international journal of mathematics, publishing papers in the fields of combinatorics and computer science. It started in 1981, with László Babai and László Lovász as the editors in chief with Paul Erdős as honorary editor in chief. The… …   Wikipedia

  • Neeraj Kayal — (Hindi: नीरज कयाल) is an Indian computer scientist. Kayal was born and raised in Guwahati, India. Kayal graduated with a B.Tech from the Computer Science Department of the Indian Institute of Technology, Kanpur (IITK), India in 2002. In that year …   Wikipedia

  • Карп, Ричард Мэннинг — Ричард Мэннинг Карп Richard Manning Karp …   Википедия

  • Mark Jerrum — Mark Richard Jerrum is a British computer scientist and computational theorist. Jerrum received his Ph.D. in computer science in 1981 from University of Edinburgh under the supervision of Leslie Valiant.[1] He is professor of pure mathematics at… …   Wikipedia

  • List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… …   Wikipedia

  • Jeong Han Kim — (born July 20 1962) is a South Korean mathematician specializing in combinatorics and computational mathematics. He studied physics and mathematical physics at Yonsei University, and earned his Ph.D in mathematics at Rutgers University. He was a… …   Wikipedia

  • AKS primality test — The AKS primality test (also known as Agrawal–Kayal–Saxena primality test and cyclotomic AKS test) is a deterministic primality proving algorithm created and published by three Indian Institute of Technology Kanpur computer scientists, Manindra… …   Wikipedia

  • Neil Robertson (mathematician) — Neil Robertson Born November 30, 1938 Canada Residence United States, Canada N …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”