98:
1457:
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.
1467:
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.
123:(AMS). Up to three awards of $ 1,500 each are presented at each (triennial) International Symposium of the MOS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late
2425:
727:
2420:
930:
2435:
1484:
688:
1323:
1122:
127:
to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS.
1839:
2445:
2078:
1530:
410:
1778:
Satoru Iwata, Lisa
Fleischer, Satoru Fujishige, "A combinatorial strongly polynomial algorithm for minimizing submodular functions,"
116:
57:
2415:
508:
2193:
1915:
1798:
1765:
1733:
1694:
1048:
1020:
221:
1906:
1559:
562:
398:
570:
359:
2440:
1713:
784:
120:
62:
1910:
1567:
1563:
1039:
593:
566:
406:
402:
163:
1199:
Falikman, D. I. (1981). "A proof of the van der
Waerden conjecture on the permanent of a doubly stochastic matrix".
1656:"Improved approximation algorithms for the maximum cut and satisfiability probelsm using semi-definite programming"
962:
217:
211:
2430:
2154:
733:
277:
459:
229:
167:
310:
556:
519:
466:
455:
341:
225:
2125:
2034:
1430:
1262:
858:
617:
250:
2188:
1144:
747:
693:
195:
91:
2232:
2043:
1934:
1824:
766:
281:
124:
1891:, "A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries,"
1708:
836:
805:
801:
788:
497:
112:
34:
2130:
1995:(2004). "Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time".
1435:
1267:
1793:
1148:
1081:(1976). "Informational complexity and effective methods of solution for convex extremal problems".
648:
578:
515:
451:
425:
296:
260:
199:
191:
97:
892:
2300:
2291:
2241:
2202:
2116:
2006:
1997:
1988:
1943:
1893:
1888:
1780:
1689:
1660:
1503:
1421:
1376:
1328:
611:
599:
542:
470:
314:
306:
246:
207:
157:
820:
1849:
658:
1884:
1078:
828:
809:
792:
772:
751:
621:
607:
552:
384:
183:
2310:
2251:
2212:
2170:
2135:
2087:
2052:
2016:
1953:
1932:; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006). "The strong perfect graph theorem".
1929:
1811:
1669:
1627:
1581:
1539:
1493:
1440:
1419:(1991). "A random polynomial time algorithm for approximating the volume of convex bodies".
1416:
1390:
1358:
1303:
1272:
1232:
1162:
1100:
1057:
993:
652:
589:
530:
363:
333:
203:
187:
2322:
2263:
1796:, "A combinatorial algorithm minimizing submodular functions in strongly polynomial time,"
1639:
2318:
2259:
1731:, A. M. H. Gerards and A. Kapoor, "The Excluded Minors for GF(4)-Representable Matroids,"
1635:
1250:
981:
884:
478:
474:
300:
274:
264:
256:
139:
824:
2400:
2111:
1992:
1412:
1015:
644:
625:
603:
447:
377:
for finding bases of piecewise-polynomial function spaces over triangulations of space.
348:
329:
270:
153:
2289:
RothvoĂź, Thomas (2017). "The matching polytope has exponential extension complexity".
2409:
2107:
1599:
1572:
1381:
1349:
1344:
1308:
1291:
1223:
1180:
Egorychev, G. P. (1981). "The solution of van der
Waerden's problem for permanents".
1153:
1062:
1043:
1011:
862:
636:
501:
429:
421:
374:
352:
292:
149:
44:
1819:
1815:
1221:(1981). "Roth's estimate of the discrepancy of integer sequences is nearly sharp".
1151:(1981). "The ellipsoid method and its consequences in combinatorial optimization".
1127:
832:
741:
538:
534:
493:
2394:
2057:
2038:
511:
of the weakly bipartite graphs (graphs whose bipartite subgraph polytope is 0-1).
2255:
1880:
1408:
1218:
755:
574:
548:
362:, that every semialgebraic set is equivalent to the space of realizations of an
337:
325:
242:
143:
2216:
1957:
1480:"Homology of smooth splines: Generic triangulations and a conjecture of Strang"
2092:
2073:
1728:
845:
640:
489:
2276:
1975:
1868:
1751:
2158:
2139:
1844:
1526:"Upper bounds for the diameter and height of graphs of the convex polyhedra"
1521:
997:
737:
380:
1631:
1292:"Isomorphism of graphs of bounded valence can be tested in polynomial time"
936:
Zilin Jiang, Jonathan Tidor, Yuan Yao, Shengtong Zhang, and Yufei Zhao for
2020:
1674:
1655:
1444:
1276:
944:
The junta method for hypergraphs and the Erdős–Chvátal simplex conjecture
2388:
2361:
2336:
2230:
Santos, Francisco (2011). "A counterexample to the Hirsch conjecture".
2114:(2009). "Expander flows, geometric embeddings and graph partitioning".
1585:
1544:
1525:
1507:
1394:
1362:
1236:
1166:
849:
171:
2174:
224:'s conjecture that the matrix with all entries equal has the smallest
92:
http://www.ams.org/profession/prizes-awards/ams-prizes/fulkerson-prize
2207:
2011:
1948:
984:(1975). "On the computational complexity of combinatorial problems".
2314:
1498:
1479:
1347:(1985). "A strongly polynomial minimum cost circulation algorithm".
1018:(1977). "Every planar map is four colorable, Part I: Discharging".
841:
Proof of the 1-factorization and
Hamilton decomposition conjectures
267:
with few variables in time polynomial in the number of constraints.
2305:
2246:
1763:
Bertrand Guenin, "A characterization of weakly bipartite graphs,"
1379:(1984). "A new polynomial-time algorithm for linear programming".
1253:(1983). "Integer programming with a fixed number of variables".
2191:; Szegedy, Balázs (2006). "Limits of dense graph sequences".
740:
for determining the threshold of edge density above which a
875:
744:
can be covered by disjoint copies of a given smaller graph.
592:, Neil Robertson, Paul Seymour, and Robin Thomas, for the
1123:"Leonid Khachiyan, professor, leading computer scientist"
754:
for characterizing subgraph multiplicity in sequences of
1103:(1979). "A polynomial algorithm in linear programming".
952:
1570:(1993). "Hadwiger's conjecture for K_6-free graphs".
895:
696:
661:
514:
Satoru Iwata, Lisa
Fleischer, Satoru Fujishige, and
387:
by proving subexponential bounds on the diameter of
867:
87:
79:
71:
50:
40:
29:
24:
924:
721:
682:
1654:Goemans, Michel X.; Williamson, David P. (1995).
1485:Transactions of the American Mathematical Society
1044:"The matroids with the max-flow min-cut property"
2426:Awards of the Mathematical Optimization Society
854:Complexity of Counting CSP with Complex Weights
2368:. American Mathematical Society. July 23, 2024
16:Award for advancements in discrete mathematics
8:
1913:, "Graph Minors. XX. Wagner's conjecture,"
2421:Awards of the American Mathematical Society
2362:"2024 Delbert Ray Fulkerson Prize Awarded"
96:
21:
2304:
2245:
2206:
2129:
2091:
2056:
2010:
1947:
1688:Michele Conforti, Gérard Cornuéjols, and
1673:
1543:
1497:
1434:
1307:
1266:
1061:
932:algorithms for volume and Gaussian volume
913:
900:
894:
703:
695:
660:
492:, A. M. H. Gerards and A. Kapoor for the
2436:1979 establishments in the United States
2074:"Sphere Packings, V. Pentahedral Prisms"
1971:
1969:
1967:
1864:
1862:
1860:
1747:
1745:
1743:
1692:, "Decomposition of balanced matrices",
620:and Samuel P. Ferguson, for proving the
1296:Journal of Computer and System Sciences
973:
1324:"U of O Computer Chief Gets Top Award"
111:for outstanding papers in the area of
7:
2161:(2008). "Factors in random graphs".
1838:Raghunathan, M. S. (June 11, 2009).
942:Nathan Keller and Noam Lifshitz for
938:Equiangular lines with a fixed angle
791:, Simon Griffiths, Peter Allen, and
2343:. Mathematical Optimization Society
2079:Discrete and Computational Geometry
1737:, Series B, 79 (2): 247–2999, 2000.
1531:Discrete and Computational Geometry
722:{\displaystyle O({\sqrt {\log n}})}
2039:"A proof of the Kepler conjecture"
1919:, Series B, 92 (2): 325–357, 2004.
1840:"India as a player in Mathematics"
1769:, Series B, 83 (1): 112–168, 2001.
1698:, Series B, 77 (2): 292–406, 1999.
1620:Random Structures & Algorithms
1255:Mathematics of Operations Research
1083:Ekonomika I Matematicheskie Metody
797:The chromatic thresholds of graphs
33:Outstanding papers in the area of
14:
2401:AMS archive of past prize winners
1802:, Series B 80 (2): 346–355, 2000.
117:Mathematical Optimization Society
58:Mathematical Optimization Society
2395:Official site with award details
2163:Random Structures and Algorithms
509:forbidden minor characterization
344:for the volume of convex bodies.
2194:Journal of Combinatorial Theory
1916:Journal of Combinatorial Theory
1799:Journal of Combinatorial Theory
1766:Journal of Combinatorial Theory
1734:Journal of Combinatorial Theory
1695:Journal of Combinatorial Theory
1049:Journal of Combinatorial Theory
1021:Illinois Journal of Mathematics
220:and D. I. Falikman for proving
142:for classifying many important
919:
906:
716:
700:
677:
665:
1:
2277:2015 Fulkerson Prize citation
1976:2009 Fulkerson Prize citation
1869:2006 Fulkerson Prize citation
1752:2003 Fulkerson Prize citation
121:American Mathematical Society
63:American Mathematical Society
2072:Ferguson, Samuel P. (2006).
2058:10.4007/annals.2005.162.1065
1309:10.1016/0022-0000(82)90009-5
1182:Akademiia Nauk SSSR. Doklady
1105:Akademiia Nauk SSSR. Doklady
1063:10.1016/0095-8956(77)90031-4
925:{\displaystyle O^{*}(n^{3})}
594:strong perfect graph theorem
391:-dimensional polytopes with
115:is sponsored jointly by the
2256:10.4007/annals.2012.176.1.7
1602:(1995). "The Ramsey number
557:approximating the permanent
383:for making progress on the
360:Mnev's universality theorem
351:analogues of the theory of
278:graph isomorphism algorithm
2462:
2446:Awards established in 1979
2217:10.1016/j.jctb.2006.05.002
1958:10.4007/annals.2006.164.51
963:List of mathematics awards
655:and related problems from
522:to be strongly polynomial.
409:for the six-color case of
212:combinatorial optimization
2093:10.1007/s00454-005-1214-y
1828:, 160 (2): 781–793, 2004.
1610:) has order of magnitude
771:a counter-example of the
683:{\displaystyle O(\log n)}
571:Robertson–Seymour theorem
297:minimum cost circulations
1897:, 51 (4): 671–697, 2004.
1784:, 48 (4): 761–777, 2001.
1709:"MR Rao New Dean Of ISB"
1290:Luks, Eugene M. (1982).
624:on the densest possible
460:semidefinite programming
456:approximation algorithms
342:approximation algorithms
301:strongly polynomial time
245:for tight bounds on the
230:doubly stochastic matrix
168:max-flow min-cut theorem
2416:Computer science awards
2279:, retrieved 2015-07-18.
2140:10.1145/1502793.1502794
1978:, retrieved 2012-08-19.
1871:, retrieved 2012-08-19.
1754:, retrieved 2012-08-18.
1478:Billera, Louis (1988).
1201:Matematicheskie Zametki
998:10.1002/net.1975.5.1.45
520:submodular minimization
251:arithmetic progressions
1632:10.1002/rsa.3240070302
926:
859:Ken-Ichi Kawarabayashi
723:
684:
507:Bertrand Guenin for a
426:asymptotic growth rate
280:for graphs of bounded
2337:"The Fulkerson Prize"
2233:Annals of Mathematics
2044:Annals of Mathematics
2021:10.1145/990308.990310
1935:Annals of Mathematics
1825:Annals of Mathematics
1675:10.1145/227683.227684
1445:10.1145/102782.102783
1329:Eugene Register-Guard
927:
889:Gaussian cooling and
767:Francisco Santos Leal
724:
685:
555:and Eric Vigoda, for
475:balanced 0-1 matrices
411:Hadwiger's conjecture
311:Karmarkar's algorithm
166:for generalizing the
125:Delbert Ray Fulkerson
2441:Discrete mathematics
1822:, "PRIMES is in P,"
1277:10.1287/moor.8.4.538
1149:Schrijver, Alexander
893:
806:extension complexity
804:for his work on the
789:Yoshiharu Kohayakawa
694:
659:
358:Nikolai E. Mnev for
113:discrete mathematics
35:discrete mathematics
2299:(6): A41:1–A41:19.
2153:Johansson, Anders;
1989:Spielman, Daniel A.
1794:Alexander Schrijver
1377:Karmarkar, Narendra
1143:Grötschel, Martin;
649:approximation ratio
579:well-quasi-ordering
516:Alexander Schrijver
452:David P. Williamson
261:geometry of numbers
200:Alexander Schrijver
2292:Journal of the ACM
2117:Journal of the ACM
1998:Journal of the ACM
1894:Journal of the ACM
1781:Journal of the ACM
1661:Journal of the ACM
1586:10.1007/bf01202354
1545:10.1007/bf02293053
1422:Journal of the ACM
1395:10.1007/bf02579150
1363:10.1007/bf02579369
1332:. August 10, 1985.
1251:Lenstra, H. W. Jr.
1237:10.1007/bf02579452
1167:10.1007/bf02579273
1079:Nemirovski, Arkadi
922:
732:Anders Johansson,
719:
680:
647:for improving the
612:linear programming
600:Daniel A. Spielman
543:AKS primality test
465:Michele Conforti,
347:Alfred Lehman for
315:linear programming
307:Narendra Karmarkar
208:linear programming
158:four color theorem
2389:Official web page
2366:News from the AMS
2175:10.1002/rsa.20224
1930:Chudnovsky, Maria
1885:Alistair Sinclair
1852:on June 14, 2009.
1714:Financial Express
1417:Kannan, Ravindran
1101:Khachiyan, Leonid
953:
876:
810:matching polytope
773:Hirsch conjecture
714:
622:Kepler conjecture
608:smoothed analysis
553:Alistair Sinclair
498:Rota's conjecture
467:Gérard Cornuéjols
448:Michel X. Goemans
385:Hirsch conjecture
257:H. W. Lenstra Jr.
184:Arkadi Nemirovski
105:
104:
2453:
2431:Triennial events
2377:
2376:
2374:
2373:
2358:
2352:
2351:
2349:
2348:
2333:
2327:
2326:
2308:
2286:
2280:
2274:
2268:
2267:
2249:
2227:
2221:
2220:
2210:
2185:
2179:
2178:
2150:
2144:
2143:
2133:
2104:
2098:
2097:
2095:
2069:
2063:
2062:
2060:
2051:(3): 1063–1183.
2035:Hales, Thomas C.
2031:
2025:
2024:
2014:
1985:
1979:
1973:
1962:
1961:
1951:
1926:
1920:
1904:
1898:
1878:
1872:
1866:
1855:
1853:
1848:. Archived from
1835:
1829:
1812:Manindra Agrawal
1809:
1803:
1791:
1785:
1776:
1770:
1761:
1755:
1749:
1738:
1726:
1720:
1718:
1705:
1699:
1686:
1680:
1679:
1677:
1668:(6): 1115–1145.
1651:
1645:
1643:
1596:
1590:
1589:
1556:
1550:
1549:
1547:
1518:
1512:
1511:
1501:
1475:
1469:
1465:
1459:
1455:
1449:
1448:
1438:
1405:
1399:
1398:
1373:
1367:
1366:
1341:
1335:
1333:
1320:
1314:
1313:
1311:
1287:
1281:
1280:
1270:
1247:
1241:
1240:
1215:
1209:
1208:
1196:
1190:
1189:
1177:
1171:
1170:
1140:
1134:
1132:
1119:
1113:
1112:
1097:
1091:
1090:
1074:
1068:
1067:
1065:
1056:(2–3): 189–222.
1036:
1030:
1029:
1008:
1002:
1001:
982:Karp, Richard M.
978:
951:
931:
929:
928:
923:
918:
917:
905:
904:
883:Ben Cousins and
874:
728:
726:
725:
720:
715:
704:
689:
687:
686:
681:
653:graph separators
590:Maria Chudnovsky
531:Manindra Agrawal
473:for recognizing
424:for finding the
364:oriented matroid
334:Ravindran Kannan
265:integer programs
204:ellipsoid method
192:Martin Grötschel
188:Leonid Khachiyan
101:
100:
22:
2461:
2460:
2456:
2455:
2454:
2452:
2451:
2450:
2406:
2405:
2385:
2380:
2371:
2369:
2360:
2359:
2355:
2346:
2344:
2335:
2334:
2330:
2315:10.1145/3127497
2288:
2287:
2283:
2275:
2271:
2229:
2228:
2224:
2187:
2186:
2182:
2152:
2151:
2147:
2131:10.1.1.310.2258
2112:Vazirani, Umesh
2110:; Rao, Satish;
2106:
2105:
2101:
2071:
2070:
2066:
2033:
2032:
2028:
1993:Teng, Shang-Hua
1987:
1986:
1982:
1974:
1965:
1928:
1927:
1923:
1905:
1901:
1879:
1875:
1867:
1858:
1837:
1836:
1832:
1810:
1806:
1792:
1788:
1777:
1773:
1762:
1758:
1750:
1741:
1727:
1723:
1717:. July 2, 2004.
1707:
1706:
1702:
1687:
1683:
1653:
1652:
1648:
1598:
1597:
1593:
1560:Robertson, Neil
1558:
1557:
1553:
1520:
1519:
1515:
1499:10.2307/2001125
1477:
1476:
1472:
1466:
1462:
1456:
1452:
1436:10.1.1.145.4600
1413:Frieze, Alan M.
1409:Dyer, Martin E.
1407:
1406:
1402:
1375:
1374:
1370:
1343:
1342:
1338:
1322:
1321:
1317:
1289:
1288:
1284:
1268:10.1.1.431.5444
1249:
1248:
1244:
1217:
1216:
1212:
1198:
1197:
1193:
1179:
1178:
1174:
1142:
1141:
1137:
1121:
1120:
1116:
1099:
1098:
1094:
1076:
1075:
1071:
1038:
1037:
1033:
1016:Haken, Wolfgang
1010:
1009:
1005:
980:
979:
975:
971:
959:
909:
896:
891:
890:
885:Santosh Vempala
837:Andrew Treglown
802:Thomas Rothvoss
692:
691:
657:
656:
626:sphere packings
618:Thomas C. Hales
479:polynomial time
275:polynomial time
222:van der Waerden
218:G. P. Egorychev
140:Richard M. Karp
133:
119:(MOS) and the
109:Fulkerson Prize
95:
67:
25:Fulkerson Prize
20:
17:
12:
11:
5:
2459:
2457:
2449:
2448:
2443:
2438:
2433:
2428:
2423:
2418:
2408:
2407:
2404:
2403:
2398:
2392:
2384:
2383:External links
2381:
2379:
2378:
2353:
2328:
2281:
2269:
2240:(1): 383–412.
2222:
2201:(6): 933–957.
2189:Lovász, László
2180:
2145:
2108:Arora, Sanjeev
2099:
2064:
2026:
1980:
1963:
1921:
1907:Neil Robertson
1899:
1873:
1856:
1830:
1804:
1786:
1771:
1756:
1739:
1721:
1700:
1681:
1646:
1626:(3): 173–207.
1600:Kim, Jeong Han
1591:
1580:(3): 279–361.
1551:
1538:(4): 363–372.
1513:
1492:(1): 325–340.
1470:
1460:
1450:
1400:
1389:(4): 373–395.
1368:
1357:(3): 247–256.
1336:
1315:
1282:
1261:(4): 538–548.
1242:
1231:(4): 319–325.
1210:
1191:
1172:
1161:(2): 169–197.
1145:Lovász, László
1135:
1131:. May 5, 2005.
1114:
1092:
1069:
1031:
1012:Appel, Kenneth
1003:
972:
970:
967:
966:
965:
958:
955:
949:
948:
947:
946:
940:
934:
921:
916:
912:
908:
903:
899:
872:
871:
870:
869:
856:
843:
815:
814:
813:
799:
793:Julia Böttcher
779:
778:
777:
761:
760:
759:
752:Balázs Szegedy
745:
730:
718:
713:
710:
707:
702:
699:
679:
676:
673:
670:
667:
664:
645:Umesh Vazirani
631:
630:
629:
615:
604:Shang-Hua Teng
597:
584:
583:
582:
563:Neil Robertson
560:
546:
525:
524:
523:
512:
505:
502:matroid minors
484:
483:
482:
463:
442:
441:
440:
430:Ramsey numbers
416:
415:
414:
399:Neil Robertson
396:
378:
369:
368:
367:
356:
353:perfect graphs
345:
330:Alan M. Frieze
326:Martin E. Dyer
320:
319:
318:
304:
287:
286:
285:
282:maximum degree
271:Eugene M. Luks
268:
259:for using the
254:
237:
236:
235:
233:
215:
177:
176:
175:
161:
154:Wolfgang Haken
147:
132:
129:
103:
102:
89:
85:
84:
81:
77:
76:
73:
69:
68:
66:
65:
60:
54:
52:
48:
47:
42:
38:
37:
31:
27:
26:
18:
15:
13:
10:
9:
6:
4:
3:
2:
2458:
2447:
2444:
2442:
2439:
2437:
2434:
2432:
2429:
2427:
2424:
2422:
2419:
2417:
2414:
2413:
2411:
2402:
2399:
2397:(AMS website)
2396:
2393:
2390:
2387:
2386:
2382:
2367:
2363:
2357:
2354:
2342:
2338:
2332:
2329:
2324:
2320:
2316:
2312:
2307:
2302:
2298:
2294:
2293:
2285:
2282:
2278:
2273:
2270:
2265:
2261:
2257:
2253:
2248:
2243:
2239:
2235:
2234:
2226:
2223:
2218:
2214:
2209:
2204:
2200:
2196:
2195:
2190:
2184:
2181:
2176:
2172:
2168:
2164:
2160:
2156:
2149:
2146:
2141:
2137:
2132:
2127:
2123:
2119:
2118:
2113:
2109:
2103:
2100:
2094:
2089:
2085:
2081:
2080:
2075:
2068:
2065:
2059:
2054:
2050:
2046:
2045:
2040:
2036:
2030:
2027:
2022:
2018:
2013:
2008:
2004:
2000:
1999:
1994:
1990:
1984:
1981:
1977:
1972:
1970:
1968:
1964:
1959:
1955:
1950:
1945:
1941:
1937:
1936:
1931:
1925:
1922:
1918:
1917:
1912:
1908:
1903:
1900:
1896:
1895:
1890:
1886:
1882:
1877:
1874:
1870:
1865:
1863:
1861:
1857:
1851:
1847:
1846:
1841:
1834:
1831:
1827:
1826:
1821:
1817:
1813:
1808:
1805:
1801:
1800:
1795:
1790:
1787:
1783:
1782:
1775:
1772:
1768:
1767:
1760:
1757:
1753:
1748:
1746:
1744:
1740:
1736:
1735:
1730:
1725:
1722:
1716:
1715:
1710:
1704:
1701:
1697:
1696:
1691:
1685:
1682:
1676:
1671:
1667:
1663:
1662:
1657:
1650:
1647:
1641:
1637:
1633:
1629:
1625:
1621:
1617:
1613:
1609:
1605:
1601:
1595:
1592:
1587:
1583:
1579:
1575:
1574:
1573:Combinatorica
1569:
1568:Thomas, Robin
1565:
1564:Seymour, Paul
1561:
1555:
1552:
1546:
1541:
1537:
1533:
1532:
1527:
1523:
1517:
1514:
1509:
1505:
1500:
1495:
1491:
1487:
1486:
1481:
1474:
1471:
1464:
1461:
1454:
1451:
1446:
1442:
1437:
1432:
1428:
1424:
1423:
1418:
1414:
1410:
1404:
1401:
1396:
1392:
1388:
1384:
1383:
1382:Combinatorica
1378:
1372:
1369:
1364:
1360:
1356:
1352:
1351:
1350:Combinatorica
1346:
1340:
1337:
1331:
1330:
1325:
1319:
1316:
1310:
1305:
1301:
1297:
1293:
1286:
1283:
1278:
1274:
1269:
1264:
1260:
1256:
1252:
1246:
1243:
1238:
1234:
1230:
1226:
1225:
1224:Combinatorica
1220:
1214:
1211:
1206:
1202:
1195:
1192:
1187:
1183:
1176:
1173:
1168:
1164:
1160:
1156:
1155:
1154:Combinatorica
1150:
1146:
1139:
1136:
1130:
1129:
1124:
1118:
1115:
1110:
1106:
1102:
1096:
1093:
1088:
1084:
1080:
1077:Judin, D.B.;
1073:
1070:
1064:
1059:
1055:
1051:
1050:
1045:
1041:
1040:Seymour, Paul
1035:
1032:
1027:
1023:
1022:
1017:
1013:
1007:
1004:
999:
995:
991:
987:
983:
977:
974:
968:
964:
961:
960:
956:
954:
945:
941:
939:
935:
933:
914:
910:
901:
897:
886:
882:
881:
879:
878:
877:
868:
864:
863:Mikkel Thorup
860:
857:
855:
851:
847:
844:
842:
838:
834:
830:
826:
822:
819:
818:
816:
811:
807:
803:
800:
798:
794:
790:
786:
785:Robert Morris
783:
782:
780:
775:
774:
768:
765:
764:
762:
757:
753:
749:
748:László Lovász
746:
743:
739:
735:
731:
711:
708:
705:
697:
674:
671:
668:
662:
654:
650:
646:
642:
638:
637:Sanjeev Arora
635:
634:
632:
627:
623:
619:
616:
613:
609:
605:
601:
598:
595:
591:
588:
587:
585:
580:
576:
573:showing that
572:
568:
564:
561:
558:
554:
550:
547:
544:
540:
536:
532:
529:
528:
526:
521:
517:
513:
510:
506:
503:
499:
495:
491:
488:
487:
485:
480:
476:
472:
468:
464:
461:
457:
453:
449:
446:
445:
443:
438:
434:
431:
427:
423:
422:Jeong Han Kim
420:
419:
417:
412:
408:
404:
400:
397:
394:
390:
386:
382:
379:
376:
375:Louis Billera
373:
372:
370:
365:
361:
357:
354:
350:
346:
343:
339:
335:
331:
327:
324:
323:
321:
316:
312:
308:
305:
302:
298:
294:
291:
290:
288:
283:
279:
276:
272:
269:
266:
262:
258:
255:
252:
248:
244:
241:
240:
238:
234:
231:
227:
223:
219:
216:
213:
209:
205:
201:
197:
196:László Lovász
193:
189:
185:
181:
180:
178:
173:
169:
165:
162:
159:
155:
151:
150:Kenneth Appel
148:
145:
141:
138:
137:
135:
134:
130:
128:
126:
122:
118:
114:
110:
99:
93:
90:
86:
82:
80:First awarded
78:
74:
70:
64:
61:
59:
56:
55:
53:
49:
46:
45:United States
43:
39:
36:
32:
28:
23:
2370:. Retrieved
2365:
2356:
2345:. Retrieved
2340:
2331:
2296:
2290:
2284:
2272:
2237:
2231:
2225:
2208:math/0408173
2198:
2192:
2183:
2166:
2162:
2148:
2121:
2115:
2102:
2083:
2077:
2067:
2048:
2042:
2029:
2012:math/0212413
2002:
1996:
1983:
1949:math/0212070
1939:
1933:
1924:
1914:
1911:Paul Seymour
1902:
1892:
1876:
1850:the original
1843:
1833:
1823:
1820:Nitin Saxena
1816:Neeraj Kayal
1807:
1797:
1789:
1779:
1774:
1764:
1759:
1732:
1729:J. F. Geelen
1724:
1712:
1703:
1693:
1684:
1665:
1659:
1649:
1623:
1619:
1615:
1611:
1607:
1603:
1594:
1577:
1571:
1554:
1535:
1529:
1516:
1489:
1483:
1473:
1463:
1453:
1426:
1420:
1403:
1386:
1380:
1371:
1354:
1348:
1339:
1327:
1318:
1302:(1): 42–65.
1299:
1295:
1285:
1258:
1254:
1245:
1228:
1222:
1219:Beck, Jozsef
1213:
1204:
1200:
1194:
1188:: 1041–1044.
1185:
1181:
1175:
1158:
1152:
1138:
1128:Boston Globe
1126:
1117:
1111:: 1093–1096.
1108:
1104:
1095:
1086:
1082:
1072:
1053:
1047:
1034:
1025:
1019:
1006:
989:
985:
976:
950:
943:
937:
888:
873:
866:
853:
840:
833:Deryk Osthus
825:Daniela KĂĽhn
796:
770:
756:dense graphs
742:random graph
575:graph minors
567:Paul Seymour
539:Nitin Saxena
535:Neeraj Kayal
518:for showing
490:J. F. Geelen
436:
432:
407:Robin Thomas
403:Paul Seymour
392:
388:
295:for finding
182:D.B. Judin,
164:Paul Seymour
108:
106:
51:Presented by
2124:(2): 1–37.
2086:: 167–204.
2005:: 385–463.
1889:Eric Vigoda
1881:Mark Jerrum
1429:(1): 1–17.
1345:Tardos, Éva
614:algorithms.
549:Mark Jerrum
338:random-walk
247:discrepancy
243:Jozsef Beck
144:NP-complete
30:Awarded for
2410:Categories
2372:2024-07-25
2347:2024-07-25
2341:MOS Prizes
2159:Vu, Van H.
2155:Kahn, Jeff
1942:: 51–229.
1614:/log
1522:Kalai, Gil
1207:: 931–938.
1089:: 357–369.
1028:: 429–490.
969:References
846:Jin-Yi Cai
821:BĂ©la Csaba
641:Satish Rao
569:, for the
541:, for the
349:0,1-matrix
293:Éva Tardos
2306:1311.2369
2247:1006.2814
2126:CiteSeerX
1845:The Hindu
1690:M. R. Rao
1431:CiteSeerX
1263:CiteSeerX
992:: 45–68.
902:∗
738:Van H. Vu
734:Jeff Kahn
709:
672:
471:M. R. Rao
458:based on
381:Gil Kalai
263:to solve
226:permanent
146:problems.
72:Reward(s)
2169:: 1–28.
2037:(2005).
1524:(1992).
1468:527-544.
1458:101-105.
1042:(1977).
986:Networks
957:See also
829:Allan Lo
496:case of
202:for the
172:matroids
156:for the
2323:3713797
2264:2925387
1640:1369063
1508:2001125
850:Xi Chen
808:of the
577:form a
428:of the
395:facets.
340:-based
228:of any
131:Winners
88:Website
75:$ 1,500
41:Country
2321:
2262:
2128:
1638:
1506:
1433:
1265:
880:2024:
835:, and
817:2021:
781:2018:
763:2015:
736:, and
643:, and
633:2012:
606:, for
586:2009:
527:2006:
486:2003:
469:, and
444:2000:
418:1997:
371:1994:
322:1991:
289:1988:
273:for a
239:1985:
179:1982:
136:1979:
94:
2391:(MOS)
2301:arXiv
2242:arXiv
2203:arXiv
2007:arXiv
1944:arXiv
1504:JSTOR
494:GF(4)
19:Award
1909:and
1887:and
1818:and
887:for
865:for
861:and
852:for
848:and
839:for
795:for
769:for
750:and
651:for
602:and
565:and
537:and
454:for
450:and
405:and
336:for
332:and
313:for
309:for
210:and
198:and
152:and
107:The
83:1979
2311:doi
2252:doi
2238:176
2213:doi
2171:doi
2136:doi
2088:doi
2053:doi
2049:162
2017:doi
1954:doi
1940:164
1670:doi
1628:doi
1618:".
1606:(3,
1582:doi
1540:doi
1494:doi
1490:310
1441:doi
1391:doi
1359:doi
1304:doi
1273:doi
1233:doi
1186:258
1163:doi
1109:244
1058:doi
994:doi
706:log
690:to
669:log
610:of
500:on
477:in
435:(3,
299:in
249:of
206:in
170:to
2412::
2364:.
2339:.
2319:MR
2317:.
2309:.
2297:64
2295:.
2260:MR
2258:.
2250:.
2236:.
2211:.
2199:96
2197:.
2167:33
2165:.
2157:;
2134:.
2122:56
2120:.
2084:36
2082:.
2076:.
2047:.
2041:.
2015:.
2003:51
2001:.
1991:;
1966:^
1952:.
1938:.
1883:,
1859:^
1842:.
1814:,
1742:^
1711:.
1666:42
1664:.
1658:.
1636:MR
1634:.
1622:.
1578:13
1576:.
1566:;
1562:;
1534:.
1528:.
1502:.
1488:.
1482:.
1439:.
1427:38
1425:.
1415:;
1411:;
1385:.
1353:.
1326:.
1300:25
1298:.
1294:.
1271:.
1257:.
1227:.
1205:29
1203:.
1184:.
1157:.
1147:;
1125:.
1107:.
1087:12
1085:.
1054:23
1052:.
1046:.
1026:21
1024:.
1014:;
988:.
831:,
827:,
823:,
787:,
639:,
551:,
533:,
439:).
401:,
328:,
194:,
190:,
186:,
2375:.
2350:.
2325:.
2313::
2303::
2266:.
2254::
2244::
2219:.
2215::
2205::
2177:.
2173::
2142:.
2138::
2096:.
2090::
2061:.
2055::
2023:.
2019::
2009::
1960:.
1956::
1946::
1854:.
1719:.
1678:.
1672::
1644:.
1642:.
1630::
1624:7
1616:t
1612:t
1608:t
1604:R
1588:.
1584::
1548:.
1542::
1536:8
1510:.
1496::
1447:.
1443::
1397:.
1393::
1387:4
1365:.
1361::
1355:5
1334:.
1312:.
1306::
1279:.
1275::
1259:8
1239:.
1235::
1229:1
1169:.
1165::
1159:1
1133:.
1066:.
1060::
1000:.
996::
990:5
920:)
915:3
911:n
907:(
898:O
812:.
776:.
758:.
729:.
717:)
712:n
701:(
698:O
678:)
675:n
666:(
663:O
628:.
596:.
581:.
559:.
545:.
504:.
481:.
462:.
437:t
433:R
413:.
393:n
389:d
366:.
355:.
317:.
303:.
284:.
253:.
232:.
214:.
174:.
160:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
