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.
- Terence Tao — trusted by 207 researchers here
- Zolt'an Szab'o — trusted by 90 researchers here
- Peter S. Ozsv'ath — trusted by 89 researchers here
- Paul Glasserman — trusted by 150 researchers here
- Andrei Zelevinsky — trusted by 106 researchers here
- Sergey Fomin — trusted by 107 researchers here
- Jean Bourgain — trusted by 79 researchers here
- Kunal Talwar — trusted by 120 researchers here
- Frank McSherry — trusted by 120 researchers here
- S. P'ech'e — trusted by 86 researchers here
- William T. Gowers — trusted by 79 researchers here
- 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.
- Algebraic Graph Theory (2026) — 8,709 citations
- Analytic Combinatorics (2009) — 3,964 citations
- Monte Carlo Methods in Financial Engineering (2003) — 3,847 citations
- The Gaia Methodology for Agent-Oriented Analysis and Design (2000) — 2,210 citations
- Stochastic Geometry for Wireless Networks (2012) — 2,198 citations
- Pseudorandom Bits for Polynomials (2007) — 1,931 citations
- Combinatorics of Coxeter Groups (2005) — 1,884 citations
- Character Theory of Finite Groups (2010) — 1,597 citations
- On Circulant Matrices (2012) — 1,231 citations
- Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices (2004) — 1,186 citations
- Cluster algebras II: Finite type classification (2002) — 1,087 citations
- Finite Group Theory (2003) — 1,074 citations
- Numerical Optimization: Theoretical and Practical Aspects (2003) — 1,054 citations
- The relationship of average volume of alcohol consumption and patterns of drinking to burden of disease: an overview. (2003, Addiction) — 1,033 citations
- The classical groups (2009) — 1,027 citations
- A random graph model for massive graphs (2000, Symposium on the Theory of Computing) — 1,014 citations
- Unsolved problems in number theory (2001, Periodica Mathematica Hungarica) — 1,013 citations
- Graph Minors. XX. Wagner's conjecture (2004, J. Comb. Theory B) — 992 citations
- Moduli spaces of local systems and higher Teichmüller theory (2003) — 978 citations
- The primes contain arbitrarily long arithmetic progressions (2004) — 975 citations
- Limits of dense graph sequences (2004, J. Comb. Theory B) — 974 citations
- A new proof of Szemerédi's theorem (2001) — 935 citations
- The average distances in random graphs with given expected degrees (2002) — 929 citations
- Holomorphic disks and topological invariants for closed three-manifolds (2001) — 912 citations
- Log-Gases and Random Matrices (LMS-34) (2010) — 893 citations
- The degree sequence of a scale‐free random graph process (2001, Random Struct. Algorithms) — 830 citations
- Random Matrix Theory and ζ(1/2+it) (2000) — 815 citations
- Graph minors XXIII. Nash-Williams' immersion conjecture (2010, J. Comb. Theory B) — 810 citations
- Additive Combinatorics: Long arithmetic progressions in sum sets (2006) — 788 citations
- polymake: a Framework for Analyzing Convex Polytopes (2000) — 765 citations
- Introductory Econometrics: User Guide (2005) — 763 citations
- On the Foundations of Combinatorial Theory (2009) — 759 citations
- Permutohedra, Associahedra, and Beyond (2005) — 730 citations
- Cluster algebras IV: Coefficients (2006, Compositio Mathematica) — 724 citations
- Cluster algebras III: Upper bounds and double Bruhat cells (2003) — 712 citations
- On the Representation Theory of the Symmetric Groups (2005) — 711 citations
- Corneal avascularity is due to soluble VEGF receptor-1 (2006, Nature) — 707 citations
- Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing (2007) — 699 citations
- A Generalized Birthday Problem (2002, Annual International Cryptology Conference) — 696 citations
- The Strong Perfect Graph Theorem (2002) — 680 citations
- Modelling using Polynomial Regression (2012) — 678 citations
- Total positivity, Grassmannians, and networks (2006) — 678 citations
- Mathematical Modeling (2012, Encyclopedia of Social Network Analysis and Mining) — 666 citations
- Representations of reductive groups over finite rings (2002) — 650 citations
- Khovanov homology and the slice genus (2004) — 649 citations
- 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
- Zeros of Gaussian Analytic Functions and Determinantal Point Processes (2009, University Lecture Series) — 640 citations
- Holomorphic disks and three-manifold invariants: Properties and applications (2001) — 633 citations
- Greedy approximation algorithms for finding dense components in a graph (2000, International Workshop on Approximation Algorithms for Combinatorial Optimization) — 622 citations
- Lectures on Symplectic Geometry (2008) — 617 citations
Most active researchers
By papers in this topic: a volume measure, not trust.
- Terence Tao — 53 papers
- Jean Bourgain — 31 papers
- Taekyun Kim — 26 papers
- Ben Joseph Green — 22 papers
- Robert M. Guralnick — 19 papers
- Zolt'an Szab'o — 18 papers
- Peter S. Ozsv'ath — 17 papers
- Thomas Lam — 17 papers
- A. Skiba — 16 papers
- Gunter Malle — 16 papers
- Pham Huu Tiep — 16 papers
- Van H. Vu — 15 papers