Discrete Mathematics and Combinatorics

A topic in the Science corpus, drawn from 3,850 papers.

Trusted voices in Discrete Mathematics and Combinatorics

Ordered by the trust Discrete Mathematics and Combinatorics's own network concentrates on each researcher, most first.

  1. Terence Tao — trusted by 207 researchers here
  2. Zolt'an Szab'o — trusted by 90 researchers here
  3. Peter S. Ozsv'ath — trusted by 89 researchers here
  4. Paul Glasserman — trusted by 150 researchers here
  5. Andrei Zelevinsky — trusted by 106 researchers here
  6. Sergey Fomin — trusted by 107 researchers here
  7. Jean Bourgain — trusted by 79 researchers here
  8. Kunal Talwar — trusted by 120 researchers here
  9. Frank McSherry — trusted by 120 researchers here
  10. S. P'ech'e — trusted by 86 researchers here
  11. William T. Gowers — trusted by 79 researchers here
  12. Ben Joseph Green — trusted by 82 researchers here

Most-cited papers in Discrete Mathematics and Combinatorics

Ordered by the recorded citation count from the source corpus; a citation is not an endorsement.

  1. Algebraic Graph Theory (2026) — 8,709 citations
  2. Analytic Combinatorics (2009) — 3,964 citations
  3. Monte Carlo Methods in Financial Engineering (2003) — 3,847 citations
  4. The Gaia Methodology for Agent-Oriented Analysis and Design (2000) — 2,210 citations
  5. Stochastic Geometry for Wireless Networks (2012) — 2,198 citations
  6. Pseudorandom Bits for Polynomials (2007) — 1,931 citations
  7. Combinatorics of Coxeter Groups (2005) — 1,884 citations
  8. Character Theory of Finite Groups (2010) — 1,597 citations
  9. On Circulant Matrices (2012) — 1,231 citations
  10. Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices (2004) — 1,186 citations
  11. Cluster algebras II: Finite type classification (2002) — 1,087 citations
  12. Finite Group Theory (2003) — 1,074 citations
  13. Numerical Optimization: Theoretical and Practical Aspects (2003) — 1,054 citations
  14. The relationship of average volume of alcohol consumption and patterns of drinking to burden of disease: an overview. (2003, Addiction) — 1,033 citations
  15. The classical groups (2009) — 1,027 citations
  16. A random graph model for massive graphs (2000, Symposium on the Theory of Computing) — 1,014 citations
  17. Unsolved problems in number theory (2001, Periodica Mathematica Hungarica) — 1,013 citations
  18. Graph Minors. XX. Wagner's conjecture (2004, J. Comb. Theory B) — 992 citations
  19. Moduli spaces of local systems and higher Teichmüller theory (2003) — 978 citations
  20. The primes contain arbitrarily long arithmetic progressions (2004) — 975 citations
  21. Limits of dense graph sequences (2004, J. Comb. Theory B) — 974 citations
  22. A new proof of Szemerédi's theorem (2001) — 935 citations
  23. The average distances in random graphs with given expected degrees (2002) — 929 citations
  24. Holomorphic disks and topological invariants for closed three-manifolds (2001) — 912 citations
  25. Log-Gases and Random Matrices (LMS-34) (2010) — 893 citations
  26. The degree sequence of a scale‐free random graph process (2001, Random Struct. Algorithms) — 830 citations
  27. Random Matrix Theory and ζ(1/2+it) (2000) — 815 citations
  28. Graph minors XXIII. Nash-Williams' immersion conjecture (2010, J. Comb. Theory B) — 810 citations
  29. Additive Combinatorics: Long arithmetic progressions in sum sets (2006) — 788 citations
  30. polymake: a Framework for Analyzing Convex Polytopes (2000) — 765 citations
  31. Introductory Econometrics: User Guide (2005) — 763 citations
  32. On the Foundations of Combinatorial Theory (2009) — 759 citations
  33. Permutohedra, Associahedra, and Beyond (2005) — 730 citations
  34. Cluster algebras IV: Coefficients (2006, Compositio Mathematica) — 724 citations
  35. Cluster algebras III: Upper bounds and double Bruhat cells (2003) — 712 citations
  36. On the Representation Theory of the Symmetric Groups (2005) — 711 citations
  37. Corneal avascularity is due to soluble VEGF receptor-1 (2006, Nature) — 707 citations
  38. Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing (2007) — 699 citations
  39. A Generalized Birthday Problem (2002, Annual International Cryptology Conference) — 696 citations
  40. The Strong Perfect Graph Theorem (2002) — 680 citations
  41. Modelling using Polynomial Regression (2012) — 678 citations
  42. Total positivity, Grassmannians, and networks (2006) — 678 citations
  43. Mathematical Modeling (2012, Encyclopedia of Social Network Analysis and Mining) — 666 citations
  44. Representations of reductive groups over finite rings (2002) — 650 citations
  45. Khovanov homology and the slice genus (2004) — 649 citations
  46. Sparse nonnegative solution of underdetermined linear equations by linear programming. (2005, Proceedings of the National Academy of Sciences of the United States of America) — 645 citations
  47. Zeros of Gaussian Analytic Functions and Determinantal Point Processes (2009, University Lecture Series) — 640 citations
  48. Holomorphic disks and three-manifold invariants: Properties and applications (2001) — 633 citations
  49. Greedy approximation algorithms for finding dense components in a graph (2000, International Workshop on Approximation Algorithms for Combinatorial Optimization) — 622 citations
  50. Lectures on Symplectic Geometry (2008) — 617 citations

Most active researchers

By papers in this topic: a volume measure, not trust.