查看“︁富尔克森奖”︁的源代码

{{Infobox award
| name = 富尔克森奖
| subheader = <!-- or | current_awards = -->
| image = 
| image_size = <!-- or | image_upright = -->
| alt = 
| caption = 
| description = [[离散数学]]领域的杰出论文
| sponsor =
| date = <!-- {{start date|YYYY|MM|DD}} -->
| location = <!-- or | venue = or | site = -->
| country = [[美国]]
| presenter = {{en-link|国际数学优化学会|Mathematical Optimization Society}}<br />[[美国数学学会]]
| host = <!-- or | hosts = -->
| former name = 
| preshow_host = 
| acts =
| reward = 1500[[美元]]
| year = 1979年
| year2 = 
| holder_label = 
| holder = <!-- or | winner = or | winners = -->
| most_awards = <!-- or | most_wins = -->
| most_nominations = 
| award1_type = 
| award1_winner = 
| award2_type = 
| award2_winner = 
| award3_type = 
| award3_winner = 
| award4_type = 
| award4_winner = 
| award5_type = 
| award5_winner = 
| website = <!-- {{URL|	http://www.ams.org/profession/prizes-awards/ams-prizes/fulkerson-prize}} -->
| network = <!-- or | network_list = -->
| runtime = 
| viewership = <!-- or | ratings = -->
| producer = 
| director = 
| image2 = 
| image2size = <!-- or | image_upright2 -->
| alt2 = 
| caption2 = 
| previous = 
| main = 
| next = 
}}

'''富尔克森奖'''（{{lang-en|Fulkerson Prize}}）是{{en-link|国际数学优化学会|Mathematical Optimization Society}}和[[美国数学学会]]联合设立的奖项，专门奖励[[离散数学]]领域的杰出论文。在国际数学优化学会每三年召开一次的大会上奖励至多三篇论文，奖金各1500美元。最初奖金来自于一个纪念基金。此纪念基金是由数学家{{en-link|戴尔伯特·雷·富尔克森|Delbert Ray Fulkerson}}的朋友们建立的、美国数学学会管理，用于激励富尔克森自己研究领域的杰出数学成果。目前奖金来自于国际数学优化学会管理的一笔捐赠资产。

==获奖论文==

<ref name="名单">{{cite web |title=Mathematical Optimization Society |url=http://www.mathopt.org/?nav=fulkerson#winners |website=Mathematical Optimization Society |accessdate=2020-04-19 |archive-date=2019-02-12 |archive-url=https://web.archive.org/web/20190212173654/http://www.mathopt.org/?nav=fulkerson#winners |dead-url=yes }}</ref>
* 1979年: 
** [[理查德·卡普]] - 对很多重要的[[NP完全]]问题进行分类。<ref>{{cite journal | last1 = Karp | first1 = Richard M. | authorlink = Richard M. Karp | year = 1975 | title = On the computational complexity of combinatorial problems | url =https://archive.org/details/sim_networks_1975-01_5_1/page/45| journal = Networks | volume = 5 | issue = | pages = 45–68 | doi=10.1002/net.1975.5.1.45}}</ref>
** [[凱尼斯·阿佩爾]]和[[沃夫冈·哈肯]] - [[四色定理]]。<ref>{{cite journal | last1 = Appel | first1 = Kenneth | authorlink = Kenneth Appel | authorlink2 = Wolfgang Haken | last2 = Haken | first2 = Wolfgang | year = 1977 | title = Every planar map is four colorable, Part I: Discharging | url =https://archive.org/details/sim_illinois-journal-of-mathematics_1977-06_21_2/page/n210| journal = Illinois Journal of Mathematics | volume = 21 | issue = | pages = 429–490 }}</ref>
** {{en-link|Paul Seymour|Paul Seymour (mathematician)}} - 把[[最大流最小割定理]]推广到[[拟阵]]。<ref>{{cite journal | last1 = Seymour | first1 = Paul | authorlink = Paul Seymour (mathematician) | year = 1977 | title = The matroids with the max-flow min-cut property | url = | journal = [[Journal of Combinatorial Theory]] | volume = 23 | issue = | pages = 189–222 | doi=10.1016/0095-8956(77)90031-4}}</ref>
* 1982: 
** D.B. Judin, [[阿爾卡迪·內米羅夫斯基]], {{en-link|Leonid Khachiyan}}, {{en-link|Martin Grötschel}}, [[洛瓦兹·拉兹洛]] 和 {{en-link|Alexander Schrijver}} - [[线性规划]]和[[组合优化]]中的{{en-link|椭球方法|ellipsoid method}}。<ref>{{cite journal | last1 = Judin | first1 = D.B. | authorlink2 = Arkadi Nemirovski | last2 = Nemirovski | first2 = Arkadi | year = 1976 | title = Informational complexity and effective methods of solution for convex extremal problems | url = | journal = Ekonomika i Matematicheskie Metody | volume = 12 | issue = | pages = 357–369 }}</ref><ref>{{cite journal | last1 = Khachiyan | first1 = Leonid | authorlink = Leonid Khachiyan | year = 1979 | title = A polynomial algorithm in linear programming | url = | journal = Akademiia Nauk SSSR. Doklady | volume = 244 | issue = | pages = 1093–1096 }}</ref> <ref>{{citation|newspaper=[[Boston Globe]]|url=http://www.boston.com/news/globe/obituaries/articles/2005/05/05/leonid_khachiyan_professor_leading_computer_scientist/|date=May 5, 2005|title=Leonid Khachiyan, professor, leading computer scientist|accessdate=2020-04-19|archive-date=2016-03-03|archive-url=https://web.archive.org/web/20160303183945/http://www.boston.com/news/globe/obituaries/articles/2005/05/05/leonid_khachiyan_professor_leading_computer_scientist/|dead-url=no}}.</ref> <ref>{{cite journal | last1 = Grötschel | first1 = Martin | authorlink2 = László Lovász | authorlink3 = Alexander Schrijver | last2 = Lovász | first2 = László | last3 = Schrijver | first3 = Alexander | year = 1981 | title = The ellipsoid method and its consequences in combinatorial optimization | url = | journal = [[Combinatorica]] | volume = 1 | issue = | pages = 169–197 | doi=10.1007/bf02579273}}</ref>
**{{en-link|G. P. Egorychev|Georgy Petrovich Egorychev}}和D. I. Falikman - 证明[[范德瓦尔登]]的猜想：所有元素都相等的矩阵在所有{{Link-en|双随机矩阵|Doubly stochastic matrix}}中有着最小的[[积和式]]。<ref>{{cite journal | last1 = Egorychev | first1 = G. P. | year = 1981 | title = The solution of van der Waerden's problem for permanents | url = | journal = Akademiia Nauk SSSR. Doklady | volume = 258 | issue = | pages = 1041–1044 }}</ref><ref>{{cite journal | last1 = Falikman | first1 = D. I. | year = 1981 | title = A proof of the van der Waerden conjecture on the permanent of a doubly stochastic matrix | url = | journal = Matematicheskie Zametki | volume = 29 | issue = | pages = 931–938 }}</ref>
** 
* 1985: 
** {{en-link|Jozsef Beck}} - [[等差数列]]的{{en-link|差异|discrepancy theory}}的紧界。<ref>{{cite journal | last1 = Beck | first1 = Jozsef | authorlink = Jozsef Beck | year = 1981 | title = Roth's estimate of the discrepancy of integer sequences is nearly sharp | url = | journal = [[Combinatorica]] | volume = 1 | issue = 4| pages = 319–325 | doi=10.1007/bf02579452}}</ref>
** [[亨德里克·倫斯特拉]] - 应用[[几何数论]]在约束个数的多项式时间内求解变元数较少的[[整数规划]]问题。<ref>{{cite journal | last1 = Lenstra | first1 = H. W. | authorlink = Hendrik Lenstra | last2 = Jr | first2 =  | year = 1983 | title = Integer programming with a fixed number of variables | url = | journal = Mathematics of Operations Research | volume = 8 | issue = 4| pages = 538–548 | doi=10.1287/moor.8.4.538}}</ref>
** {{en-link|Eugene M. Luks}} - 对于最大[[度_(图论)|度]]有上界的图求解[[图同构]]问题的[[时间复杂度#多项式时间|多项式时间]]算法。<ref>{{cite journal | last1 = Luks | first1 = Eugene M. | year = 1982 | title = Isomorphism of graphs of bounded valence can be tested in polynomial time | url = | journal = Journal of Computer and System Sciences | volume = 25 | issue = 1| pages = 42–65 | doi=10.1016/0022-0000(82)90009-5 }}</ref><ref>{{citation|url=https://news.google.com/newspapers?id=w_hVAAAAIBAJ&sjid=huEDAAAAIBAJ&pg=6539,2351404&dq=fulkerson-prize&hl=en|newspaper=[[The Register-Guard|Eugene Register-Guard]]|title=U of O Computer Chief Gets Top Award|date=August 10, 1985|accessdate=2020-04-19|archive-date=2021-12-07|archive-url=https://web.archive.org/web/20211207100726/https://news.google.com/newspapers?id=w_hVAAAAIBAJ&sjid=huEDAAAAIBAJ&pg=6539%2C2351404&dq=fulkerson-prize&hl=en|dead-url=no}}.</ref>
* 1988: 
** [[愛娃·塔多斯]] - 在[[时间复杂度#多项式时间|强多项式时间]]内求解网络中的最小费用[[环流问题|环流]]。<ref>{{cite journal | last1 = Tardos | first1 = Éva | authorlink = Éva Tardos | year = 1985 | title = A strongly polynomial minimum cost circulation algorithm | url = | journal = [[Combinatorica]] | volume = 5 | issue = | pages = 247–256 | doi=10.1007/bf02579369}}</ref>
** {{en-link|Narendra Karmarkar}} - [[线性规划]]中的{{en-link|Karmarkar算法|Karmarkar's algorithm}}。<ref>{{cite journal | last1 = Karmarkar | first1 = Narendra | authorlink = Narendra Karmarkar | year = 1984 | title = A new polynomial-time algorithm for linear programming | url = | journal = [[Combinatorica]] | volume = 4 | issue = | pages = 373–395 | doi=10.1007/bf02579150}}</ref>
* 1991: 
** Martin E. Dyer, Alan M. Frieze 和 Ravindran Kannan - 基于[[隨機漫步]]的计算[[凸体]]体积的[[近似算法]]。<ref>{{cite journal | last1 = Dyer | first1 = Martin E. | authorlink = Martin Dyer | authorlink2 = Alan M. Frieze | authorlink3 = Ravindran Kannan | last2 = Frieze | first2 = Alan M. | last3 = Kannan | first3 = Ravindran | year = 1991 | title = A random polynomial time algorithm for approximating the volume of convex bodies | url = | journal = [[Journal of the ACM]] | volume = 38 | issue = 1| pages = 1–17 | doi=10.1145/102782.102783}}</ref>
** Alfred Lehman - 关于[[邏輯矩陣]]的[[完美图]]理论。<ref>Alfred Lehman, "The width-length inequality and degenerate projective planes," W. Cook and P. D. Seymour (eds.), Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 1, (American Mathematical Society, 1990) pp. 101-105.</ref>
** Nikolai E. Mnev - {{en-link|Mnev通用定理|Mnev's universality theorem}}：每个{{en-link|半代数集|Semialgebraic set}}都等价于一个定向[[拟阵]]的所有实现构成的空间。<ref>Nikolai E. Mnev, "The universality theorems on the classification problem of configuration varieties and convex polytope varieties," O. Ya. Viro (ed.), Topology and Geometry-Rohlin Seminar, Lecture Notes in Mathematics 1346 (Springer-Verlag, Berlin, 1988) pp. 527-544.</ref>
* 1994: 
** {{en-link|Louis Billera}} - 求出空间{{en-link|三角剖分|Triangulation_(geometry)}}上的分段多项式函数空间的基。<ref>{{cite journal | last1 = Billera | first1 = Louis | year = 1988 | title = Homology of smooth splines: Generic triangulations and a conjecture of Strang | url = | journal = [[Transactions of the American Mathematical Society]] | volume = 310 | issue = | pages = 325–340 | doi=10.2307/2001125}}</ref>
** {{en-link|Gil Kalai}} - 在{{en-link|Hirsch猜想|Hirsch conjecture}}上的进展。<ref>{{cite journal | last1 = Kalai | first1 = Gil | authorlink = Gil Kalai | year = 1992 | title = Upper bounds for the diameter and height of graphs of the convex polyhedra | url = | journal = [[Discrete and Computational Geometry]] | volume = 8 | issue = | pages = 363–372 | doi=10.1007/bf02293053 }}</ref>
** {{en-link|Neil Robertson|Neil Robertson (mathematician)}}, {{en-link|Paul Seymour|Paul Seymour (mathematician)}}和[[罗宾·托马斯]] - {{en-link|哈德维格猜想|Hadwiger conjecture (graph theory)}}的6色情形。<ref>{{cite journal | last1 = Robertson | first1 = Neil | authorlink = Neil Robertson (mathematician) | authorlink2 = Paul Seymour (mathematician) | authorlink3 = Robin Thomas (mathematician) | last2 = Seymour | first2 = Paul | last3 = Thomas | first3 = Robin | year = 1993 | title = Hadwiger's conjecture for K_6-free graphs | url =https://archive.org/details/sim_combinatorica_1993_13_3/page/279| journal = [[Combinatorica]] | volume = 13 | issue = | pages = 279–361 | doi=10.1007/bf01202354}}</ref>
* 1997: 
**{{en-link|Jeong Han Kim}} - 求出[[拉姆齐定理|拉姆齐数]]''R''(3,''t'')的[[渐近分析|渐进增长率]]。<ref>{{citation | last = Kim | first = Jeong Han | authorlink = Jeong Han Kim | doi = 10.1002/rsa.3240070302 | issue = 3 | journal = Random Structures & Algorithms | mr = 1369063 | pages = 173–207 | title = The Ramsey number ''R''(3,''t'') has order of magnitude ''t''<sup>2</sup>/log&nbsp;''t'' | volume = 7 | year = 1995}}.</ref>
* 2000: 
** {{en-link|Michel X. Goemans|Michel Goemans}}和{{en-link|David P. Williamson}} - 基于[[半正定规划]]的[[近似算法]]。<ref>{{cite journal | last1 = Goemans | first1 = Michel X. | last2 = Williamson | first2 = David P. | year = 1995 | title = Improved approximation algorithms for the maximum cut and satisfiability probelsm using semi-definite programming | url = | journal = [[Journal of the ACM]] | volume = 42 | issue = 6| pages = 1115–1145 | doi=10.1145/227683.227684}}</ref>
** Michele Conforti, {{en-link|Gérard Cornuéjols}}和{{en-link|Mendu Rammohan Rao}} - 在[[时间复杂度#多项式时间|多项式时间]]内识别{{en-link|平衡逻辑矩阵|Balanced matrix}}的算法。<ref>Michele Conforti, Gérard Cornuéjols, and [[Mendu Rammohan Rao|M. R. Rao]], "Decomposition of balanced matrices", ''[[Journal of Combinatorial Theory]]'', Series B, 77 (2): 292–406, 1999.</ref><ref>{{citation|title=MR Rao New Dean Of ISB|newspaper=[[The Financial Express (India)|Financial Express]]|date=July 2, 2004|url=http://www.financialexpress.com/news/mr-rao-new-dean-of-isb/109506/|accessdate=2020-04-19|archive-date=2022-03-19|archive-url=https://web.archive.org/web/20220319060917/https://www.financialexpress.com/news/mr-rao-new-dean-of-isb/109506/|dead-url=no}}.</ref>
* 2003:
** {{en-link|Jim Geelen}}, A. M. H. Gerards 和 A. Kapoor - 关于{{en-link|拟阵子式|matroid minor}}的{{en-link|Rota猜想|Rota's conjecture}}在[[有限域|GF(4)]]的情形。<ref>[[Jim Geelen|J. F. Geelen]], A. M. H. Gerards and A. Kapoor, "The Excluded Minors for GF(4)-Representable Matroids," ''[[Journal of Combinatorial Theory]]'', Series B, 79 (2): 247–2999, 2000.</ref><ref name="fpc03">[http://www.mathopt.org/?nav=fulkerson_2003 2003 Fulkerson Prize citation] {{Wayback|url=http://www.mathopt.org/?nav=fulkerson_2003 |date=20160304031624 }}, retrieved 2012-08-18.</ref>
** Bertrand Guenin - 弱[[二部图]]的一个{{en-link|禁止子图刻画|Forbidden graph characterization}}。<ref>Bertrand Guenin, "A characterization of weakly bipartite graphs," ''[[Journal of Combinatorial Theory]]'', Series B, 83 (1): 112–168, 2001.</ref><ref name="fpc03"/>
** Satoru Iwata, Lisa Fleischer, Satoru Fujishige和{{en-link|Alexander Schrijver}} - 证明{{en-link|次模函数最小化问题|Submodular_set_function#Optimization_problems}}是强多项式时间的。<ref>Satoru Iwata, Lisa Fleischer, Satoru Fujishige, "A combinatorial strongly polynomial algorithm for minimizing submodular functions," ''[[Journal of the ACM]]'', 48 (4): 761–777, 2001.</ref><ref>[[Alexander Schrijver]], "A combinatorial algorithm minimizing submodular functions in strongly polynomial time," ''[[Journal of Combinatorial Theory]]'', Series B 80 (2): 346–355, 2000.</ref><ref name="fpc03"/>
* 2006:
** {{en-link|Manindra Agrawal}}, {{en-link|Neeraj Kayal}} 和 {{en-link|Nitin Saxena}} - [[AKS質數測試]].<ref>[[Manindra Agrawal]], [[Neeraj Kayal]] and [[Nitin Saxena]], "PRIMES is in P," ''[[Annals of Mathematics]]'', 160 (2): 781–793, 2004.</ref><ref>{{citation|newspaper=[[The Hindu]]|date=June 11, 2009|first=M. S.|last=Raghunathan|title=India as a player in Mathematics|url=http://www.hindu.com/2009/06/11/stories/2009061155161000.htm|accessdate=2020-04-19|archive-date=2009-06-14|archive-url=https://web.archive.org/web/20090614043518/http://www.hindu.com/2009/06/11/stories/2009061155161000.htm|dead-url=yes}}.</ref><ref name="fpc06">[http://www.mathopt.org/?nav=fulkerson_2006 2006 Fulkerson Prize citation] {{Wayback|url=http://www.mathopt.org/?nav=fulkerson_2006 |date=20160304023253 }}, retrieved 2012-08-19.</ref>
** {{en-link|Mark Jerrum}}, [[阿利斯泰尔·辛克莱尔]] 和 Eric Vigoda - 对[[积和式]]的近似计算。<ref>[[Mark Jerrum]], [[Alistair Sinclair]] and [[Eric Vigoda]], "A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries," ''[[Journal of the ACM]]'', 51 (4): 671–697, 2004.</ref><ref name="fpc06"/>
** {{en-link|Neil Robertson|Neil Robertson (mathematician)}} 和 {{en-link|Paul Seymour|Paul Seymour (mathematician)}} - {{en-link|Robertson-Seymour定理|Robertson–Seymour theorem}}。.<ref>[[Neil Robertson (mathematician)|Neil Robertson]] and [[Paul Seymour (mathematician)|Paul Seymour]],  "Graph Minors. XX. Wagner's conjecture," ''[[Journal of Combinatorial Theory]]'', Series B, 92 (2): 325–357, 2004.</ref><ref name="fpc06"/>
* 2009:
** {{en-link|Maria Chudnovsky}}, Neil Robertson, Paul Seymour 和 罗宾·托马斯 - {{en-link|强完美图定理|strong perfect graph theorem}}。<ref>{{cite journal | last1 = Chudnovsky | first1 = Maria | authorlink = Maria Chudnovsky | last2 = Robertson | first2 = Neil | last3 = Seymour | first3 = Paul | last4 = Thomas | first4 = Robin | year = 2006 | title = The strong perfect graph theorem | url =https://archive.org/details/sim_annals-of-mathematics_2006-07_164_1/page/51| journal = [[Annals of Mathematics]] | volume = 164 | issue = | pages = 51–229 | doi=10.4007/annals.2006.164.51| arxiv = math/0212070 }}</ref><ref name="fpc09">[http://www.mathopt.org/?nav=fulkerson_2009 2009 Fulkerson Prize citation] {{Wayback|url=http://www.mathopt.org/?nav=fulkerson_2009 |date=20180517223410 }}, retrieved 2012-08-19.</ref>
** {{en-link|Daniel A. Spielman}} 和 [[滕尚华]] - [[线性规划]]算法的{{en-link|光滑分析|smoothed analysis}}。<ref>{{cite journal | last1 = Spielman | first1 = Daniel A. | authorlink = Daniel A. Spielman | authorlink2 = Shang-Hua Teng | last2 = Teng | first2 = Shang-Hua | year = 2004 | title = Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time | url = | journal = [[Journal of the ACM]] | volume = 51 | issue = | pages = 385–463 | doi=10.1145/990308.990310| arxiv = math/0212413 }}</ref><ref name="fpc09"/>
** [[托马斯·黑尔斯]] 和 Samuel P. Ferguson - 证明关于[[最密堆积]]的[[克卜勒猜想]]。<ref>{{cite journal | last1 = Hales | first1 = Thomas C. | authorlink = Thomas Callister Hales | year = 2005 | title = A proof of the [[Kepler conjecture]] | url = | journal = [[Annals of Mathematics]] | volume = 162 | issue = | pages = 1063–1183 }}</ref><ref>{{cite journal | last1 = Ferguson | first1 = Samuel P. | year = 2006 | title = Sphere Packings, V. Pentahedral Prisms | url = | journal = [[Discrete and Computational Geometry]] | volume = 36 | issue = | pages = 167–204 | doi=10.1007/s00454-005-1214-y}}</ref><ref name="fpc09"/>
* 2012:
** {{en-link|Sanjeev Arora}}, Satish Rao 和 [[烏梅什·瓦茲拉尼]] - 把图的{{en-link|顶点割|Vertex_separator}}和相关问题的近似比例从<math>O(\log n)</math>改进到<math>O(\sqrt{\log n})</math>。<ref>{{cite journal | last1 = Arora | first1 = Sanjeev | authorlink = Sanjeev Arora | authorlink3 = Umesh Vazirani | last2 = Rao | first2 = Satish | last3 = Vazirani | first3 = Umesh | year = 2009 | title = Expander flows, geometric embeddings and graph partitioning | url = | journal = [[Journal of the ACM]] | volume = 56 | issue = | pages = 1–37 | doi=10.1145/1502793.1502794}}</ref>
** Anders Johansson, {{en-link|Jeff Kahn}} 和 {{en-link|Van H. Vu}} - 确定了[[随机图]]具有下述性质的边密度的阈值：能被同构于一个给定的更小图的图的不交并覆盖。<ref>{{cite journal | last1 = Johansson | first1 = Anders | authorlink2 = Jeff Kahn | authorlink3 = Van H. Vu | last2 = Kahn | first2 = Jeff | last3 = Vu | first3 = Van H. | year = 2008 | title = Factors in random graphs | url = | journal = Random Structures and Algorithms | volume = 33 | issue = | pages = 1–28 | doi=10.1002/rsa.20224}}</ref>
** [[洛瓦兹·拉兹洛]]和{{en-link|Balázs Szegedy}} - 刻画{{en-link|稠密图|dense graph}}序列的[[子图]]的重数。<ref>{{cite journal | last1 = Lovász | first1 = László | authorlink = László Lovász | last2 = Szegedy | first2 = Balázs | year = 2006 | title = Limits of dense graph sequences | url = | journal = [[Journal of Combinatorial Theory]] | volume = 96 | issue = | pages = 933–957 | doi=10.1016/j.jctb.2006.05.002| arxiv = math/0408173 }}</ref>
* 2015 : 
**{{en-link|Francisco Santos Leal}} - 举出{{en-link|Hirsch猜想|Hirsch conjecture}}的一个反例。<ref>{{citation|last=Santos|first=Francisco
|title=A counterexample to the Hirsch conjecture
|journal=[[Annals of Mathematics]] | volume=176 | issue=1 | pages=383–412|doi=10.4007/annals.2012.176.1.7 |mr=2925387
|year=2011|arxiv=1006.2814}}</ref><ref>[http://www.mathopt.org/?nav=fulkerson_2015 2015 Fulkerson Prize citation] {{Wayback|url=http://www.mathopt.org/?nav=fulkerson_2015 |date=20201011175223 }}, retrieved 2015-07-18.</ref>
* 2018 :
** {{en-link|Robert Morris|Robert Morris (mathematician)}}, {{en-link|小早川美晴|Yoshiharu Kohayakawa}}, Simon Griffiths, Peter Allen 和 Julia Böttcher - ''The chromatic thresholds of graphs''
** Thomas Rothvoss - ''The Matching Polytope has Exponential Extension Complexity''

==参考资料==
{{reflist}}

==外部链接==
* [http://www.mathopt.org/?nav=fulkerson 官方网站]{{Wayback|url=http://www.mathopt.org/?nav=fulkerson |date=20190212173654 }} (MOS)
* [http://www.ams.org/prizes/fulkerson-prize.html 有详细介绍的官方网站]{{Wayback|url=http://www.ams.org/prizes/fulkerson-prize.html |date=20100315140649 }} (AMS website)

[[Category:学术荣誉]]
[[Category:計算機科學獎項]]
[[Category:数学奖项]]
[[Category:美国数学学会奖项]]
[[Category:以人名命名的奖项]]
[[Category:1979年建立的奖项]]
[[Category:富尔克森奖得主]]