Discrete Mathematics and Combinatorics

A topic in the Science corpus, drawn from 3,917 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. Pascal Paillier — trusted by 402 researchers here
  2. Johannes Blömer — trusted by 341 researchers here
  3. Alan M. Frieze — trusted by 384 researchers here
  4. Terence Tao — trusted by 207 researchers here
  5. Roger A. Horn — trusted by 317 researchers here
  6. Charles R. Johnson — trusted by 311 researchers here
  7. Lloyd S. Shapley — trusted by 224 researchers here
  8. David Weininger — trusted by 244 researchers here
  9. Zolt'an Szab'o — trusted by 90 researchers here
  10. Peter S. Ozsv'ath — trusted by 89 researchers here
  11. Paul Glasserman — trusted by 150 researchers here
  12. Andrei Zelevinsky — trusted by 106 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. Random graphs (2006) — 12,398 citations
  2. Algebraic Graph Theory (2026) — 8,709 citations
  3. Analytic Combinatorics (2009) — 3,964 citations
  4. Monte Carlo Methods in Financial Engineering (2003) — 3,847 citations
  5. The Matrix Cookbook (2006) — 3,299 citations
  6. Spectra of Graphs (2011) — 2,935 citations
  7. Weisfeiler-Lehman Graph Kernels (2011) — 2,430 citations
  8. The Gaia Methodology for Agent-Oriented Analysis and Design (2000) — 2,210 citations
  9. Stochastic Geometry for Wireless Networks (2012) — 2,198 citations
  10. Foundations of Cryptography: Volume 1, Basic Tools (2001) — 2,159 citations
  11. Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks (2018) — 2,039 citations
  12. Pseudorandom Bits for Polynomials (2007) — 1,931 citations
  13. Combinatorics of Coxeter Groups (2005) — 1,884 citations
  14. Character Theory of Finite Groups (2010) — 1,597 citations
  15. Graph Kernels (2008) — 1,295 citations
  16. On Circulant Matrices (2012) — 1,231 citations
  17. Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices (2004) — 1,186 citations
  18. Cluster algebras II: Finite type classification (2002) — 1,087 citations
  19. Finite Group Theory (2003) — 1,074 citations
  20. On Graph Kernels: Hardness Results and Efficient Alternatives (2003) — 1,062 citations
  21. Numerical Optimization: Theoretical and Practical Aspects (2003) — 1,054 citations
  22. The relationship of average volume of alcohol consumption and patterns of drinking to burden of disease: an overview. (2003, Addiction) — 1,033 citations
  23. The classical groups (2009) — 1,027 citations
  24. A random graph model for massive graphs (2000, Symposium on the Theory of Computing) — 1,014 citations
  25. Unsolved problems in number theory (2001, Periodica Mathematica Hungarica) — 1,013 citations
  26. Graph Minors. XX. Wagner's conjecture (2004, J. Comb. Theory B) — 992 citations
  27. Moduli spaces of local systems and higher Teichmüller theory (2003) — 978 citations
  28. The primes contain arbitrarily long arithmetic progressions (2004) — 975 citations
  29. Limits of dense graph sequences (2004, J. Comb. Theory B) — 974 citations
  30. A new proof of Szemerédi's theorem (2001) — 935 citations
  31. The average distances in random graphs with given expected degrees (2002) — 929 citations
  32. Holomorphic disks and topological invariants for closed three-manifolds (2001) — 912 citations
  33. Marginalized Kernels Between Labeled Graphs (2003) — 898 citations
  34. Log-Gases and Random Matrices (LMS-34) (2010) — 893 citations
  35. The degree sequence of a scale‐free random graph process (2001, Random Struct. Algorithms) — 830 citations
  36. Random Matrix Theory and ζ(1/2+it) (2000) — 815 citations
  37. Graph minors XXIII. Nash-Williams' immersion conjecture (2010, J. Comb. Theory B) — 810 citations
  38. Additive Combinatorics: Long arithmetic progressions in sum sets (2006) — 788 citations
  39. polymake: a Framework for Analyzing Convex Polytopes (2000) — 765 citations
  40. Introductory Econometrics: User Guide (2005) — 763 citations
  41. On the Foundations of Combinatorial Theory (2009) — 759 citations
  42. Permutohedra, Associahedra, and Beyond (2005) — 730 citations
  43. Cluster algebras IV: Coefficients (2006, Compositio Mathematica) — 724 citations
  44. Cluster algebras III: Upper bounds and double Bruhat cells (2003) — 712 citations
  45. On the Representation Theory of the Symmetric Groups (2005) — 711 citations
  46. Corneal avascularity is due to soluble VEGF receptor-1 (2006, Nature) — 707 citations
  47. Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing (2007) — 699 citations
  48. A Generalized Birthday Problem (2002, Annual International Cryptology Conference) — 696 citations
  49. The Strong Perfect Graph Theorem (2002) — 680 citations
  50. Modelling using Polynomial Regression (2012) — 678 citations

Most active researchers

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