Winners Fulkerson Prize

^ richard m. karp, on computational complexity of combinatorial problems , networks 5: 45–68, 1975.
^ kenneth appel , wolfgang haken, every planar map 4 colorable, part i: discharging, illinois journal of mathematics 21: 429–490, 1977.
^ paul seymour , matroids max-flow min-cut property, journal of combinatorial theory, series b, 23: 189–222, 1977.
^ d.b. judin , arkadi nemirovski, informational complexity , effective methods of solution convex extremal problems, ekonomika matematicheskie metody 12: 357–369, 1976.
^ leonid khachiyan, polynomial algorithm in linear programming, akademiia nauk sssr. doklady 244: 1093–1096, 1979.
^ leonid khachiyan, professor, leading computer scientist , boston globe, may 5, 2005 .
^ martin grötschel, lászló lovász , alexander schrijver, ellipsoid method , consequences in combinatorial optimization, combinatorica 1: 169–197, 1981.
^ g. p. egorychev, solution of van der waerden s problem permanents, akademiia nauk sssr. doklady 258: 1041–1044, 1981.
^ d. i. falikman, proof of van der waerden conjecture on permanent of doubly stochastic matrix, matematicheskie zametki 29: 931–938, 1981.
^ jozsef beck, roth s estimate of discrepancy of integer sequences sharp, combinatorica 1 (4): 319–325, 1981.
^ h. w. lenstra, jr., integer programming fixed number of variables, mathematics of operations research 8 (4): 538–548, 1983.
^ eugene m. luks, isomorphism of graphs of bounded valence can tested in polynomial time, journal of computer , system sciences 25 (1): 42–65, 1982.
^ u of o computer chief gets top award , eugene register-guard, august 10, 1985 .
^ Éva tardos, polynomial minimum cost circulation algorithm, combinatorica 5: 247-256, 1985.
^ narendra karmarkar, new polynomial-time algorithm linear programming, combinatorica 4:373–395, 1984.
^ martin e. dyer, alan m. frieze , ravindran kannan, random polynomial time algorithm approximating volume of convex bodies , journal of acm 38 (1): 1–17, 1991.
^ alfred lehman, width-length inequality , degenerate projective planes, w. cook , p. d. seymour (eds.), polyhedral combinatorics, dimacs series in discrete mathematics , theoretical computer science, volume 1, (american mathematical society, 1990) pp. 101-105.
^ nikolai e. mnev, universality theorems on classification problem of configuration varieties , convex polytope varieties, o. ya. viro (ed.), topology , geometry-rohlin seminar, lecture notes in mathematics 1346 (springer-verlag, berlin, 1988) pp. 527-544.
^ louis billera, homology of smooth splines: generic triangulations , conjecture of strang , transactions of american mathematical society 310: 325–340, 1988.
^ gil kalai, upper bounds diameter , height of graphs of convex polyhedra , discrete , computational geometry 8: 363–372, 1992.
^ neil robertson, paul seymour , robin thomas, hadwiger s conjecture k_6-free graphs, combinatorica 13: 279–361, 1993.
^ kim, jeong han (1995), ramsey number r(3,t) has order of magnitude t/log t , random structures & algorithms, 7 (3): 173–207, doi:10.1002/rsa.3240070302, mr 1369063 .
^ michel x. goemans , david p. williamson, improved approximation algorithms maximum cut , satisfiability probelsm using semi-definite programming , journal of acm 42 (6): 1115–1145, 1995.
^ michele conforti, gérard cornuéjols, , m. r. rao, decomposition of balanced matrices , journal of combinatorial theory, series b, 77 (2): 292–406, 1999.
^ mr rao new dean of isb , financial express, july 2, 2004 .
^ j. f. geelen, a. m. h. gerards , a. kapoor, excluded minors gf(4)-representable matroids, journal of combinatorial theory, series b, 79 (2): 247–2999, 2000.
^ 2003 fulkerson prize citation, retrieved 2012-08-18.
^ bertrand guenin, characterization of weakly bipartite graphs, journal of combinatorial theory, series b, 83 (1): 112–168, 2001.
^ satoru iwata, lisa fleischer, satoru fujishige, combinatorial polynomial algorithm minimizing submodular functions, journal of acm, 48 (4): 761–777, 2001.
^ alexander schrijver, combinatorial algorithm minimizing submodular functions in polynomial time, journal of combinatorial theory, series b 80 (2): 346–355, 2000.
^ manindra agrawal, neeraj kayal , nitin saxena, primes in p, annals of mathematics, 160 (2): 781–793, 2004.
^ raghunathan, m. s. (june 11, 2009), india player in mathematics , hindu .
^ 2006 fulkerson prize citation, retrieved 2012-08-19.
^ mark jerrum, alistair sinclair , eric vigoda, polynomial-time approximation algorithm permanent of matrix nonnegative entries, journal of acm, 51 (4): 671–697, 2004.
^ neil robertson , 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, , robin thomas, strong perfect graph theorem , annals of mathematics, 164: 51–229, 2006.
^ 2009 fulkerson prize citation, retrieved 2012-08-19.
^ daniel a. spielman , shang-hua teng, smoothed analysis of algorithms: why simplex algorithm takes polynomial time , journal of acm 51: 385–463, 2004.
^ thomas c. hales, proof of kepler conjecture , annals of mathematics 162: 1063–1183, 2005.
^ samuel p. ferguson, sphere packings, v. pentahedral prisms , discrete , computational geometry 36: 167–204, 2006.
^ sanjeev arora, satish rao, , umesh vazirani, expander flows, geometric embeddings , graph partitioning , journal of acm 56: 1-37, 2009.
^ anders johansson, jeff kahn, , van h. vu, factors in random graphs , random structures , algorithms 33: 1-28, 2008.
^ lászló lovász , balázs szegedy, limits of dense graph sequences , journal of combinatorial theory, series b, 96: 933-957, 2006.
^ santos, francisco (2011), counterexample hirsch conjecture , annals of mathematics, 176 (1): 383–412, arxiv:1006.2814 , doi:10.4007/annals.2012.176.1.7, mr 2925387 
^ 2015 fulkerson prize citation, retrieved 2015-07-18.