富尔克森奖
参考资料

↑  . Mathematical Optimization Society.   [2020-04-19]. （原始内容存档于2019-02-12）.
↑  Karp, Richard M. . Networks. 1975, 5: 45–68. doi:10.1002/net.1975.5.1.45.
↑  Appel, Kenneth; Haken, Wolfgang. . Illinois Journal of Mathematics. 1977, 21: 429–490.
↑  Seymour, Paul. . Journal of Combinatorial Theory. 1977, 23: 189–222. doi:10.1016/0095-8956(77)90031-4.
↑  Judin, D.B.; Nemirovski, Arkadi. . Ekonomika i Matematicheskie Metody. 1976, 12: 357–369.
↑  Khachiyan, Leonid. . Akademiia Nauk SSSR. Doklady. 1979, 244: 1093–1096.
↑  , Boston Globe, May 5, 2005  [2020-04-19], （原始内容存档于2016-03-03） .
↑  Grötschel, Martin; Lovász, László; Schrijver, Alexander. . Combinatorica. 1981, 1: 169–197. doi:10.1007/bf02579273.
↑  Egorychev, G. P. . Akademiia Nauk SSSR. Doklady. 1981, 258: 1041–1044.
↑  Falikman, D. I. . Matematicheskie Zametki. 1981, 29: 931–938.
↑  Beck, Jozsef. . Combinatorica. 1981, 1 (4): 319–325. doi:10.1007/bf02579452.
↑  Lenstra, H. W.; Jr. . Mathematics of Operations Research. 1983, 8 (4): 538–548. doi:10.1287/moor.8.4.538.
↑  Luks, Eugene M. . Journal of Computer and System Sciences. 1982, 25 (1): 42–65. doi:10.1016/0022-0000(82)90009-5.
↑  , Eugene Register-Guard, August 10, 1985  [2020-04-19], （原始内容存档于2021-12-07） .
↑  Tardos, Éva. . Combinatorica. 1985, 5: 247–256. doi:10.1007/bf02579369.
↑  Karmarkar, Narendra. . Combinatorica. 1984, 4: 373–395. doi:10.1007/bf02579150.
↑  Dyer, Martin E.; Frieze, Alan M.; Kannan, Ravindran. . Journal of the ACM. 1991, 38 (1): 1–17. doi:10.1145/102782.102783.
↑  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.
↑  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.
↑  Billera, Louis. . Transactions of the American Mathematical Society. 1988, 310: 325–340. doi:10.2307/2001125.
↑  Kalai, Gil. . Discrete and Computational Geometry. 1992, 8: 363–372. doi:10.1007/bf02293053.
↑  Robertson, Neil; Seymour, Paul; Thomas, Robin. . Combinatorica. 1993, 13: 279–361. doi:10.1007/bf01202354.
↑  Kim, Jeong Han, , Random Structures & Algorithms, 1995, 7 (3): 173–207, MR 1369063, doi:10.1002/rsa.3240070302 .
↑  Goemans, Michel X.; Williamson, David P. . Journal of the ACM. 1995, 42 (6): 1115–1145. doi:10.1145/227683.227684.
↑  Michele Conforti, Gérard Cornuéjols, and M. R. Rao, "Decomposition of balanced matrices", Journal of Combinatorial Theory, Series B, 77 (2): 292–406, 1999.
↑  , Financial Express, July 2, 2004  [2020-04-19], （原始内容存档于2022-03-19） .
↑  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.
1 2 3  2003 Fulkerson Prize citation （页面存档备份，存于）, retrieved 2012-08-18.
↑  Bertrand Guenin, "A characterization of weakly bipartite graphs," Journal of Combinatorial Theory, Series B, 83 (1): 112–168, 2001.
↑  Satoru Iwata, Lisa Fleischer, Satoru Fujishige, "A combinatorial strongly polynomial algorithm for minimizing submodular functions," Journal of the ACM, 48 (4): 761–777, 2001.
↑  Alexander Schrijver, "A combinatorial algorithm minimizing submodular functions in strongly polynomial time," Journal of Combinatorial Theory, Series B 80 (2): 346–355, 2000.
↑  Manindra Agrawal, Neeraj Kayal and Nitin Saxena, "PRIMES is in P," Annals of Mathematics, 160 (2): 781–793, 2004.
↑  Raghunathan, M. S., , The Hindu, June 11, 2009  [2020-04-19], （原始内容存档于2009-06-14） .
1 2 3  2006 Fulkerson Prize citation （页面存档备份，存于）, retrieved 2012-08-19.
↑  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.
↑  Neil Robertson and Paul Seymour,  "Graph Minors. XX. Wagner's conjecture," Journal of Combinatorial Theory, Series B, 92 (2): 325–357, 2004.
↑  Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin. . Annals of Mathematics. 2006, 164: 51–229. arXiv:math/0212070 . doi:10.4007/annals.2006.164.51.
1 2 3  2009 Fulkerson Prize citation （页面存档备份，存于）, retrieved 2012-08-19.
↑  Spielman, Daniel A.; Teng, Shang-Hua. . Journal of the ACM. 2004, 51: 385–463. arXiv:math/0212413 . doi:10.1145/990308.990310.
↑  Hales, Thomas C. . Annals of Mathematics. 2005, 162: 1063–1183.
↑  Ferguson, Samuel P. . Discrete and Computational Geometry. 2006, 36: 167–204. doi:10.1007/s00454-005-1214-y.
↑  Arora, Sanjeev; Rao, Satish; Vazirani, Umesh. . Journal of the ACM. 2009, 56: 1–37. doi:10.1145/1502793.1502794.
↑  Johansson, Anders; Kahn, Jeff; Vu, Van H. . Random Structures and Algorithms. 2008, 33: 1–28. doi:10.1002/rsa.20224.
↑  Lovász, László; Szegedy, Balázs. . Journal of Combinatorial Theory. 2006, 96: 933–957. arXiv:math/0408173 . doi:10.1016/j.jctb.2006.05.002.
↑  Santos, Francisco, , Annals of Mathematics, 2011, 176 (1): 383–412, MR 2925387, arXiv:1006.2814 , doi:10.4007/annals.2012.176.1.7
↑  2015 Fulkerson Prize citation （页面存档备份，存于）, retrieved 2015-07-18.