풀커슨상

델버트 레이 풀커슨 상(영어: Delbert Ray Fulkerson Prize)은 이산수학 분야에서 뛰어난 논문에 주어지는 상이다. 풀커슨 상은 1979년에 미국의 수학자 델버트 레이 풀커슨(영어: Delbert Ray Fulkerson, 1924년 8월 14일~1976년 1월 10일)을 기리기 위하여 창설되었고, 이후 3년마다 수여되고 있다. 미국 수학회와 수리최적화학회(영어: Mathematical Optimization Society)에서 공동으로 수여한다. 한 번에 최대 3개의 논문까지 수여될 수 있으며, 각 논문의 공저자의 수는 제한이 없다. 상금은 원래 750 미국 달러였으나, 1994년에 1500 미국 달러로 증가하였다. Richard M. Karp, "On the computational complexity of combinatorial problems", Networks 5: 45–68, 1975. Kenneth Appel and Wolfgang Haken, "Every planar map is four colorable, Part I: Discharging," Illinois Journal of Mathematics 21: 429–490, 1977 Paul Seymour, "The matroids with the max-flow min-cut property," Journal of Combinatorial Theory, Series B, 23: 189–222, 1977. D.B. Judin and Arkadi Nemirovski, "Informational complexity and effective methods of solution for convex extremal problems," Ekonomika i Matematicheskie Metody 12: 357–369, 1976. Leonid Khachiyan, "A polynomial algorithm in linear programming," Akademiia Nauk SSSR. Doklady 244: 1093–1096, 1979. Martin Grötschel, László Lovász and Alexander Schrijver, "The ellipsoid method and its consequences in combinatorial optimization," Combinatorica 1: 169–197, 1981. G. P. Egorychev, "The solution of van der Waerden's problem for permanents," Akademiia Nauk SSSR. Doklady 258: 1041–1044, 1981. D. I. Falikman, "A proof of the van der Waerden conjecture on the permanent of a doubly stochastic matrix," Matematicheskie Zametki 29: 931–938, 1981. Jozsef Beck, "Roth's estimate of the discrepancy of integer sequences is nearly sharp," Combinatorica 1 (4): 319–325, 1981. H. W. Lenstra, Jr., "Integer programming with a fixed number of variables," Mathematics of Operations Research 8 (4): 538–548, 1983. Eugene M. Luks, "Isomorphism of graphs of bounded valence can be tested in polynomial time," Journal of Computer and System Sciences 25 (1): 42–65, 1982. Éva Tardos, "A strongly polynomial minimum cost circulation algorithm," Combinatorica 5: 247-256, 1985. Narendra Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica 4:373–395, 1984. Martin E. Dyer, Alan M. Frieze and Ravindran Kannan, "A random polynomial time algorithm for approximating the volume of convex bodies", Journal of the Association for Computing Machinery 38 (1): 1–17, 1991. 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. Louis Billera, "Homology of smooth splines: Generic triangulations and a conjecture of Strang", Transactions of the AMS 310: 325–340, 1988. Gil Kalai, "Upper bounds for the diameter and height of graphs of the convex polyhedra", Discrete and Computational Geometry 8: 363–372, 1992. Neil Robertson, Paul Seymour and Robin Thomas, "Hadwiger's conjecture for K 6 {\displaystyle K_{6}} -free graphs," Combinatorica 13: 279–361, 1993. Jeong Han Kim, "The Ramsey Number R(3,t) Has Order of Magnitude t^2/log t," Random Structures and Algorithms 7 (3): 173–207, 1995. Michel X. Goemans and David P. Williamson, "Improved approximation algorithms for the maximum cut and satisfiability probelsm using semi-definite programming", Journal of the Association for Computing Machinery 42 (6): 1115–1145, 1995. 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. 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. 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. 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. Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas, "The strong perfect graph theorem", Annals of Mathematics, 164: 51–229, 2006. Daniel A. Spielman and Shang-Hua Teng, "Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time", Journal of the ACM 51: 385–463, 2004. Thomas C. Hales, "A proof of the Kepler conjecture", Annals of Mathematics 162: 1063–1183, 2005. Samuel P. Ferguson, "Sphere Packings, V. Pentahedral Prisms", Discrete and Computational Geometry 36: 167–204, 2006. Sanjeev Arora, Satish Rao, and Umesh Vazirani, "Expander flows, geometric embeddings and graph partitioning", Journal of the ACM 56: 1-37, 2009. Anders Johansson, Jeff Kahn, and Van H. Vu, "Factors in random graphs", Random Structures and Algorithms 33: 1-28, 2008. László Lovász and Balázs Szegedy, "Limits of dense graph sequences", Journal of Combinatorial Theory, Series B, 96: 933-957, 2006. “The Fulkerson Prize” (영어). Mathematical Optimization Society.  (수리최적화학회 웹사이트) “Delbert Ray Fulkerson Prize” (영어). American Mathematical Society.  (미국 수학회 웹사이트)