1979 Richard M Karp
... for 'On the computational complexity of combinatorial problems', Networks 5 (1975), 45-68.
1979 Kenneth Appel and Wolfgang Haken
... for 'Every planar map is four colorable, Part I: Discharging', Illinois Journal of Mathematics 21 (1977), 429-490.
1979 Paul D Seymour
... for 'The matroids with the max-flow min-cut property', Journal of Combinatorial Theory Series B 23 (1977), 189-222.
1982 D B Judin and A S Nemirovskii
... for 'Informational complexity and effective methods of solution for convex extremal problems', Ekonomika i Matematicheskie Metody 12 (1976), 357-369.
1982 L G Khachiyan
... for 'A polynomial algorithm in linear programming', Akademiia Nauk SSSR. Doklady 244 (1979), 1093-1096.
1982 G P Egorychev
... for 'The solution of van der Waerden's problem for permanents', Akademiia Nauk SSSR. Doklady 258 (1981), 1041-1044.
1982 D I Falikman
... for 'A proof of the van der Waerden conjecture on the permanent of a doubly stochastic matrix', Matematicheskie Zametki 29 (1981), 931-938.
1982 M Grötschel, L Lovasz and A Schrijver
... for 'The ellipsoid method and its consequences in combinatorial optimization', Combinatorica 1 (1981), 169-197.
1985 Jozsef Beck
... for 'Roth's estimate of the discrepancy of integer sequences is nearly sharp', Combinatorica 1 (4),319-325, (1981).
1985 H. W. Lenstra, Jr.
... for 'Integer programming with a fixed number of variables', Mathematics of Operations Research 8 (4), 538-548, (1983).
1985 Eugene M. Luks
... for 'Isomorphism of graphs of bounded valence can be tested in polynomial time', Journal of Computer and System Sciences 25 (1), 42-65, (1982).
1988 Eva Tardos
... for 'A strongly polynomial minimum cost circulation algorithm', Combinatorica 5 (1985), pp. 247-256.
1988 Narendra Karmarkar
... for 'A new polynomial-time algorithm for linear programming', Combinatorica 4 (1984), pp. 373-395.
1991 Martin Dyer, Alan Frieze, and Ravi Kannan
... for 'A random polynomial time algorithm for approximating the volume of convex bodies', Journal of the Association for Computing Machinery 38/1 (1991) 1-17.
1991 Alfred Lehman
... for '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) 101-105.
1991 Nikolai E Mnev
... for '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) 527-544.
1994 Louis Billera
... for 'Homology of smooth splines: Generic triangulations and a conjecture of Strang', Transactions of the AMS 310 (1988) 325-340.
1994 Gil Kalai
... for 'Upper bounds for the diameter and height of graphs of the convex polyhedra', Discrete and Computational Geometry 8 (1992) 363-372.
1994 Neil Robertson, Paul D Seymour, and Robin Thomas
... for 'Hadwiger's conjecture for K6; free graphs', Combinatorica 13 (1993) 279-361.
1997 Jeong Han Kim
... for 'The Ramsey Number R(3, t) Has Order of Magnitude t2/log t', Random Structures and Algorithms 7, (3) 1995, 173-207.
2000 Michel X Goemans and David P. Williamson
... for 'Improved approximation algorithms for the maximum cut and satisfiability probelsm using semi-definite programming', Journal of the Association for Computing Machinery 42 (1995), no. 6, 1115-1145.
2000 Michele Conforti, Gerard Cornuejols, and M. R. Rao
... for 'Decomposition of balanced matrices', Journal of Combinatorial Theory, Series B, 77 (1999), no. 2, 292-406.
2003 J. F. Geelen, A. M. H. Gerards, and A. Kapoor
... for 'The Excluded Minors for GF(4)-Representable Matroids', Journal of Combinatorial Theory Series B, 79 (2000), no. 2, 247-299.
2003 Bertrand Guenin
... for 'A characterization of weakly bipartite graphs', Journal of Combinatorial Theory Series B, 83 (2001), no. 1, 112-168.
2003 Satoru Iwata, Lisa Fleischer, and Satoru Fujishige
... for 'A combinatorial strongly polynomial algorithm for minimizing submodular functions', Journal of the ACM 48, July 2001, no. 4, 761-777.
2003 Alexander Schrijver
... for 'A combinatorial algorithm minimizing submodular functions in strongly polynomial time', Journal of Combinatorial Theory Series B 80 (2000), no. 2, 346-355.
2006 Manindra Agrawal, Neeraj Kayal and Nitin Saxena
... for 'PRIMES is in P', Annals of Mathematics 160, issue 2, 2004, 781-793
2006 Mark Jerrum, Alistair Sinclair and Eric Vigoda
... for 'A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries', J. ACM 51, Issue 4, 2004, 671-697.
2006 Neil Robertson and Paul D Seymour
... for 'Graph Minors. XX. Wagner's conjecture', Journal of Combinatorial Theory Series B 92 (2) 2004, 325-357.
The URL of this page is:
http://www-history.mcs.st-andrews.ac.uk/history/Societies/AMSFulkerson.html