Fulkerson Prize
Encyclopedia
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.
Discrete mathematics
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics – such as integers, graphs, and statements in logic – do not...
is sponsored jointly by the Mathematical Programming Society
Mathematical Programming Society
Known as the Mathematical Programming Society until 2010, the Mathematical Optimization Society is an international association of researchers active in optimization...
(MPS) and the American Mathematical Society
American Mathematical Society
The American Mathematical Society is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, which it does with various publications and conferences as well as annual monetary awards and prizes to mathematicians.The society is one of the...
(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 AppelKenneth AppelKenneth Ira Appel is a mathematician who in 1976, with colleague Wolfgang Haken at the University of Illinois at Urbana-Champaign, solved one of the most famous problems in mathematics, the four-color theorem...
and Wolfgang HakenWolfgang HakenWolfgang Haken is a mathematician who specializes in topology, in particular 3-manifolds.In 1976 together with colleague Kenneth Appel at the University of Illinois at Urbana-Champaign, Haken solved one of the most famous problems in mathematics, the four-color theorem...
; Paul Seymour. - 1982: D.B. Judin and Arkadi NemirovskiArkadi NemirovskiArkadi Nemirovski is a professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Institute of Technology.Arkadi Nemirovski earned the Ph.D. in Mathematics from Moscow State University and the Doctor of Sciences in Mathematics from the Institute of Cybernetics of...
; Leonid KhachiyanLeonid KhachiyanLeonid Genrikhovich Khachiyan was a Soviet mathematician of Armenian descent who taught Computer Science at Rutgers University. He was most famous for his Ellipsoid algorithm for linear programming, which was the first such algorithm known to have a polynomial running time...
; G. P. Egorychev; D.I. Falikman; Martin Grötschel, László LovászLászló LovászLászló Lovász is a Hungarian mathematician, best known for his work in combinatorics, for which he was awarded the Wolf Prize and the Knuth Prize in 1999, and the Kyoto Prize in 2010....
and Alexander Schrijver. - 1985: Jozsef BeckJózsef BeckJózsef Beck is a Harold H. Martin Professor of Mathematics at Rutgers University.His contributions to combinatorics include the partial colouring lemma and the Beck–Fiala theorem in discrepancy theory, the algorithmic version of the Lovász local lemma, the two extremes theorem in combinatorial...
; H. W. Lenstra, Jr.Hendrik LenstraHendrik Willem Lenstra, Jr. is a Dutch mathematician.-Biography:Lenstra received his doctorate from the University of Amsterdam in 1977 and became a professor there in 1978...
; Eugene M. Luks. - 1988: Éva TardosÉva TardosÉva Tardos is a Hungarian mathematician, winner of the Fulkerson Prize , and professor of Computer Science at Cornell University.Research Interests:...
; Narendra KarmarkarNarendra KarmarkarNarendra K. Karmarkar is an Indian mathematician, renowned for developing Karmarkar's algorithm. He is listed as an ISI highly cited researcher.- Biography :...
. - 1991: Martin E. DyerMartin DyerMartin Edward Dyer is a professor in the School of Computing at the University of Leeds, Leeds, England. He graduated from the University of Leeds in 1967, obtained his MSc from Imperial College, University of London in 1968 and his PhD from the University of Leeds in 1979...
, Alan M. FriezeAlan M. FriezeAlan M. Frieze is a professor in the Department of Mathematical Sciences at Carnegie Mellon University, Pittsburgh, United States. He graduated from the University of Oxford in 1966, and obtained his PhD from the University of London in 1975. His research interests lie in combinatorics, discrete...
and Ravindran KannanRavindran KannanRavindran Kannan is currently a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science. Before joining Microsoft, he was the William K. Lanman...
; Alfred Lehman; Nikolai E. Mnev. - 1994: Louis Billera; Gil KalaiGil KalaiGil Kalai is the Henry and Manya Noskwith Professor of Mathematics at the Hebrew University of Jerusalem, and adjunct professor of mathematics and of computer science at Yale University, and the editor of the Israel Journal of Mathematics.-Biography:...
; Neil RobertsonNeil Robertson (mathematician)G. Neil Robertson is a mathematician working mainly in topological graph theory, currently a distinguished professor at the Ohio State University. He earned his Ph.D. in 1969 at the University of Waterloo under his doctoral advisor William Tutte. According to the criteria of the Erdős Number...
, Paul Seymour and Robin ThomasRobin Thomas (mathematician)Robin Thomas is a mathematician working in graph theory at the Georgia Institute of Technology.Thomas received his doctorate in 1985 from Charles University in Prague, Czechoslovakia , under the supervision of Jaroslav Nešetřil...
. - 1997: Jeong Han KimJeong Han KimJeong Han Kim 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...
. - 2000: Michel X. Goemans and David P. Williamson; Michele Conforti and Gerard Cornuejols and M. R. RaoMendu Rammohan Rao-Biography:He has a PhD in Industrial Administration from Carnegie Mellon University. He also has a Master in Engineering and Master of Science in Industrial Engineering and Industrial Management....
. - 2003: J. F. GeelenJim GeelenJames F. Geelen is a professor at the Department of Combinatorics and Optimization in the faculty of mathematics at the University of Waterloo, where he holds the Canada Research Chair in Combinatorial optimization. He is known for his work on Matroid theory and the extension of the Graph Minors...
, A. M. H. Gerards and A. Kapoor; Bertrand Guenin; Satoru Iwata, Lisa Fleischer, Satoru Fujishige; Alexander Schrijver. - 2006: Manindra AgrawalManindra AgrawalManindra Agrawal is a professor at the department of computer science and engineering and the Dean of Resource, Planning and Generation at the Indian Institute of Technology, Kanpur. He is also the recipient of the first Infosys Prize for Mathematics.-Early life:Manindra Agrawal obtained a...
, Neeraj KayalNeeraj KayalNeeraj Kayal 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 , India in 2002...
and Nitin SaxenaNitin SaxenaNitin Saxena is an Indian scientist, active in the fields of mathematics and theoretical computer science. His research focuses on topics in computational complexity, especially algebraic approaches....
; Mark JerrumMark JerrumMark 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...
, Alistair SinclairAlistair SinclairAlistair Sinclair is a British computer scientist and computational theorist.Sinclair received his B.A. in Mathematics from St. John’s College, Cambridge in 1979, and his Ph.D. in Computer Science from the University of Edinburgh in 1988 under the supervision of Mark Jerrum...
and Eric Vigoda; Neil RobertsonNeil Robertson (mathematician)G. Neil Robertson is a mathematician working mainly in topological graph theory, currently a distinguished professor at the Ohio State University. He earned his Ph.D. in 1969 at the University of Waterloo under his doctoral advisor William Tutte. According to the criteria of the Erdős Number...
and Paul Seymour. - 2009:
- Maria ChudnovskyMaria ChudnovskyMaria Chudnovsky is an Israeli mathematician. She is professor in the departments of mathematics and of industrial engineering and operations research at Columbia University. She grew up in Russia and Israel, studying at the Technion, and received her Ph.D. in 2003 from Princeton University under...
, Neil Robertson, Paul Seymour, and Robin Thomas, for "The strong perfect graph theorem", Annals of MathematicsAnnals of MathematicsThe Annals of Mathematics is a bimonthly mathematical journal published by Princeton University and the Institute for Advanced Study. It ranks amongst the most prestigious mathematics journals in the world by criteria such as impact factor.-History:The journal began as The Analyst in 1874 and was...
, 164 (2006) 51–229. - Daniel A. Spielman and Shang-Hua Teng, for "Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time", Journal of the ACM 51 (2004) 385–463.
- Thomas C. HalesThomas Callister HalesThomas Callister Hales is an American mathematician. He is known for his 1998 computer-aided proof of the Kepler conjecture, a centuries-old problem in discrete geometry which states that the most space-efficient way to pack spheres is in a pyramid shape...
, for "A proof of the Kepler conjectureKepler conjectureThe Kepler conjecture, named after the 17th-century German astronomer Johannes Kepler, is a mathematical conjecture about sphere packing in three-dimensional Euclidean space. It says that no arrangement of equally sized spheres filling space has a greater average density than that of the cubic...
", Annals of Mathematics 162 (2005) 1063–1183. - Samuel P. Ferguson, for "Sphere Packings, V. Pentahedral Prisms", Discrete and Computational GeometryDiscrete and Computational GeometryDiscrete & Computational Geometry is a peer-reviewed mathematics journal published quarterly by Springer. Founded in 1986, the journal publishes articles on in discrete geometry and computational geometry....
36 (2006) 167–204.
- Maria Chudnovsky