풀커슨상: 두 판 사이의 차이

내용 삭제됨 내용 추가됨
57번째 줄:
| 닐 로버트슨({{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 || 마리아 후드노브스키추드노브스키({{llang|en|Maria Chudnovsky}}, {{llang|he|מריה צ'ודנובסקי}}), 닐 로버트슨({{llang|en|Neil Robertson}}), 폴 시모어({{llang|en|Paul Seymour}}), 로빈 토머스({{llang|en|Robin Thomas}})
|-
| 대니얼 앨런 스필먼({{llang|en|Daniel Alan Spielman}}), 텅샹화({{zh|s=滕尚华|t=滕尚華|p=Téng Shànghuá}}) || <ref>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.</ref>