富尔克森奖 (Chinese Wikipedia)
Analysis of information sources in references of the Wikipedia article "富尔克森奖" in Chinese language version.
refsWebsite
Global rank
Chinese rank
1st place
1st place
low place
low place
6th place
4th place
310th place
915th place
59th place
494th place
798th place
7,649th place
ams.org
- Kim, Jeong Han, The Ramsey number R(3,t) has order of magnitude t2/log t, Random Structures & Algorithms, 1995, 7 (3): 173–207, MR 1369063, doi:10.1002/rsa.3240070302.
- Santos, Francisco, A counterexample to the Hirsch conjecture, Annals of Mathematics, 2011, 176 (1): 383–412, MR 2925387, arXiv:1006.2814
, doi:10.4007/annals.2012.176.1.7
archive.org
- Karp, Richard M. On the computational complexity of combinatorial problems. Networks. 1975, 5: 45–68. doi:10.1002/net.1975.5.1.45.
- Appel, Kenneth; Haken, Wolfgang. Every planar map is four colorable, Part I: Discharging. Illinois Journal of Mathematics. 1977, 21: 429–490.
- Robertson, Neil; Seymour, Paul; Thomas, Robin. Hadwiger's conjecture for K_6-free graphs. Combinatorica. 1993, 13: 279–361. doi:10.1007/bf01202354.
- Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin. The strong perfect graph theorem. Annals of Mathematics. 2006, 164: 51–229. arXiv:math/0212070 . doi:10.4007/annals.2006.164.51.
arxiv.org
- Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin. The strong perfect graph theorem. Annals of Mathematics. 2006, 164: 51–229. arXiv:math/0212070 . doi:10.4007/annals.2006.164.51.
- Spielman, Daniel A.; Teng, Shang-Hua. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM. 2004, 51: 385–463. arXiv:math/0212413 . doi:10.1145/990308.990310.
- Lovász, László; Szegedy, Balázs. Limits of dense graph sequences. Journal of Combinatorial Theory. 2006, 96: 933–957. arXiv:math/0408173 . doi:10.1016/j.jctb.2006.05.002.
- Santos, Francisco, A counterexample to the Hirsch conjecture, Annals of Mathematics, 2011, 176 (1): 383–412, MR 2925387, arXiv:1006.2814 , doi:10.4007/annals.2012.176.1.7
boston.com
- Leonid Khachiyan, professor, leading computer scientist, Boston Globe, May 5, 2005 [2020-04-19], （原始内容存档于2016-03-03）.
doi.org
- Karp, Richard M. On the computational complexity of combinatorial problems. Networks. 1975, 5: 45–68. doi:10.1002/net.1975.5.1.45.
- Seymour, Paul. The matroids with the max-flow min-cut property. Journal of Combinatorial Theory. 1977, 23: 189–222. doi:10.1016/0095-8956(77)90031-4.
- Grötschel, Martin; Lovász, László; Schrijver, Alexander. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica. 1981, 1: 169–197. doi:10.1007/bf02579273.
- Beck, Jozsef. Roth's estimate of the discrepancy of integer sequences is nearly sharp. Combinatorica. 1981, 1 (4): 319–325. doi:10.1007/bf02579452.
- Lenstra, H. W.; Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research. 1983, 8 (4): 538–548. doi:10.1287/moor.8.4.538.
- Luks, Eugene M. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences. 1982, 25 (1): 42–65. doi:10.1016/0022-0000(82)90009-5.
- Tardos, Éva. A strongly polynomial minimum cost circulation algorithm. Combinatorica. 1985, 5: 247–256. doi:10.1007/bf02579369.
- Karmarkar, Narendra. A new polynomial-time algorithm for linear programming. Combinatorica. 1984, 4: 373–395. doi:10.1007/bf02579150.
- Dyer, Martin E.; Frieze, Alan M.; Kannan, Ravindran. A random polynomial time algorithm for approximating the volume of convex bodies. Journal of the ACM. 1991, 38 (1): 1–17. doi:10.1145/102782.102783.
- Billera, Louis. Homology of smooth splines: Generic triangulations and a conjecture of Strang. Transactions of the American Mathematical Society. 1988, 310: 325–340. doi:10.2307/2001125.
- Kalai, Gil. Upper bounds for the diameter and height of graphs of the convex polyhedra. Discrete and Computational Geometry. 1992, 8: 363–372. doi:10.1007/bf02293053.
- Robertson, Neil; Seymour, Paul; Thomas, Robin. Hadwiger's conjecture for K_6-free graphs. Combinatorica. 1993, 13: 279–361. doi:10.1007/bf01202354.
- Kim, Jeong Han, The Ramsey number R(3,t) has order of magnitude t2/log t, Random Structures & Algorithms, 1995, 7 (3): 173–207, MR 1369063, doi:10.1002/rsa.3240070302.
- Goemans, Michel X.; Williamson, David P. Improved approximation algorithms for the maximum cut and satisfiability probelsm using semi-definite programming. Journal of the ACM. 1995, 42 (6): 1115–1145. doi:10.1145/227683.227684.
- Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin. The strong perfect graph theorem. Annals of Mathematics. 2006, 164: 51–229. arXiv:math/0212070 . doi:10.4007/annals.2006.164.51.
- Spielman, Daniel A.; Teng, Shang-Hua. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM. 2004, 51: 385–463. arXiv:math/0212413 . doi:10.1145/990308.990310.
- Ferguson, Samuel P. Sphere Packings, V. Pentahedral Prisms. Discrete and Computational Geometry. 2006, 36: 167–204. doi:10.1007/s00454-005-1214-y.
- Arora, Sanjeev; Rao, Satish; Vazirani, Umesh. Expander flows, geometric embeddings and graph partitioning. Journal of the ACM. 2009, 56: 1–37. doi:10.1145/1502793.1502794.
- Johansson, Anders; Kahn, Jeff; Vu, Van H. Factors in random graphs. Random Structures and Algorithms. 2008, 33: 1–28. doi:10.1002/rsa.20224.
- Lovász, László; Szegedy, Balázs. Limits of dense graph sequences. Journal of Combinatorial Theory. 2006, 96: 933–957. arXiv:math/0408173 . doi:10.1016/j.jctb.2006.05.002.
- Santos, Francisco, A counterexample to the Hirsch conjecture, Annals of Mathematics, 2011, 176 (1): 383–412, MR 2925387, arXiv:1006.2814 , doi:10.4007/annals.2012.176.1.7
financialexpress.com
- MR Rao New Dean Of ISB, Financial Express, July 2, 2004 [2020-04-19], （原始内容存档于2022-03-19）.
hindu.com
- Raghunathan, M. S., India as a player in Mathematics, The Hindu, June 11, 2009 [2020-04-19], （原始内容存档于2009-06-14）.
mathopt.org
- Mathematical Optimization Society. Mathematical Optimization Society. [2020-04-19]. （原始内容存档于2019-02-12）.
- 2003 Fulkerson Prize citation （页面存档备份，存于互联网档案馆）, retrieved 2012-08-18.
- 2006 Fulkerson Prize citation （页面存档备份，存于互联网档案馆）, retrieved 2012-08-19.
- 2009 Fulkerson Prize citation （页面存档备份，存于互联网档案馆）, retrieved 2012-08-19.
- 2015 Fulkerson Prize citation （页面存档备份，存于互联网档案馆）, retrieved 2015-07-18.
news.google.com
- U of O Computer Chief Gets Top Award, Eugene Register-Guard, August 10, 1985 [2020-04-19], （原始内容存档于2021-12-07）.
web.archive.org
- Mathematical Optimization Society. Mathematical Optimization Society. [2020-04-19]. （原始内容存档于2019-02-12）.
- Leonid Khachiyan, professor, leading computer scientist, Boston Globe, May 5, 2005 [2020-04-19], （原始内容存档于2016-03-03）.
- U of O Computer Chief Gets Top Award, Eugene Register-Guard, August 10, 1985 [2020-04-19], （原始内容存档于2021-12-07）.
- MR Rao New Dean Of ISB, Financial Express, July 2, 2004 [2020-04-19], （原始内容存档于2022-03-19）.
- 2003 Fulkerson Prize citation （页面存档备份，存于互联网档案馆）, retrieved 2012-08-18.
- Raghunathan, M. S., India as a player in Mathematics, The Hindu, June 11, 2009 [2020-04-19], （原始内容存档于2009-06-14）.
- 2006 Fulkerson Prize citation （页面存档备份，存于互联网档案馆）, retrieved 2012-08-19.
- 2009 Fulkerson Prize citation （页面存档备份，存于互联网档案馆）, retrieved 2012-08-19.
- 2015 Fulkerson Prize citation （页面存档备份，存于互联网档案馆）, retrieved 2015-07-18.