풀커슨상: 두 판 사이의 차이
내용 삭제됨 내용 추가됨
Osteologia (토론 | 기여) 잔글 →수상자 |
Osteologia (토론 | 기여) 편집 요약 없음 |
||
39번째 줄:
| 닐 로버트슨({{llang|en|Neil Robertson}}), 폴 시모어({{llang|en|Paul Seymour}}), 로빈 토머스({{llang|en|Robin Thomas}})
|-
| 1997 || [[김정한 (수학자)|김정한]] || <ref>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.</ref>
|-
| rowspan=2 | 2000 || 미셸 그자비에 괴망({{llang|fr|Michel Xavier Goemans}}), David P. Williamson || <ref>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.</ref>
|-
| 미켈란젤로 콘포르티({{llang|it|Michelangelo Conforti}}), 제라르 피에르 코르뉘에졸({{llang|fr|Gérard Pierre Cornuéjols}}), 멘두 람모한 라오(Mendu Rammohan Rao) || <ref>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.</ref>
|-
| rowspan=3 | 2003 || 제임스 길런({{llang|en|James F. Geelen}}), 알버르트 헤라르츠({{llang|nl|Albert M. H. Gerards}}), 아자이 카푸르(Ajai Kapoor) || <ref>[[Jim Geelen|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.</ref>
|-
| Bertrand Guenin || <ref>Bertrand Guenin, "A characterization of weakly bipartite graphs," ''[[Journal of Combinatorial Theory]]'', Series B, 83 (1): 112–168, 2001.</ref>
|-
| 이와타 사토루({{llang|ja|岩田 覚}}), Lisa Fleischer, 후지시게 사토루({{llang|ja|藤重 悟}}), Alexander Schrijver || <ref>Satoru Iwata, Lisa Fleischer, Satoru Fujishige, "A combinatorial strongly polynomial algorithm for minimizing submodular functions," ''[[Journal of the ACM]]'', 48 (4): 761–777, 2001.</ref><ref>[[Alexander Schrijver]], "A combinatorial algorithm minimizing submodular functions in strongly polynomial time," ''[[Journal of Combinatorial Theory]]'', Series B 80 (2): 346–355, 2000.</ref>
|-
| rowspan=3 | 2006 || Manindra Agarwal, Neeraj Kayal, Nitin Saxena || <ref>[[Manindra Agrawal]], [[Neeraj Kayal]] and [[Nitin Saxena]], "PRIMES is in P," ''[[Annals of Mathematics]]'', 160 (2): 781–793, 2004.</ref>
|-
| Mark Jerrum, Alistair Sinclair, Eric Vigoda || <ref>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.</ref>
|-
| 닐 로버트슨({{llang|en|Neil Robertson}}), 폴 시모어({{llang|en|Paul Seymour}}) || <ref>Neil Robertson and Paul Seymour, "Graph Minors. XX. Wagner's conjecture," ''Journal of Combinatorial Theory'', Series B, 92 (2): 325–357, 2004.</ref>
|-
| rowspan=3| 2009 || Maria Chudnovsky, 닐 로버트슨({{llang|en|Neil Robertson}}), 폴 시모어({{llang|en|Paul Seymour}}), 로빈 토머스({{llang|en|Robin Thomas}})
| |||