Enumerative Combinatorics is a branch of combinatorics that focuses on counting the number of elements in finite sets, particularly the exact enumeration of combinatorial structures according to specified constraints.
4.9K
Publications
210.2K
Citations
5.5K
Authors
1.7K
Institutions
Publications per year
2017–2026
459
Publications
4.9K
Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text
The Complexity of Enumeration and Reliability Problems
Leslie G. Valiant · SIAM Journal on Computing · 1979 · 2.1K citations
Algebraic Combinatorics on Words
M. Lothaire · Cambridge University Press eBooks · 2002 · 1.8K citations
1–5 of 4.9K
Authors
5.5K
- NA
19
h-index
- BD
19
h-index
- FH
18
h-index
- TM
17
h-index
- BS
17
h-index
1–5 of 5.5K
Institutions
1.7K
Centre National de la Recherche Scientifique
Paris, France
38 h-index
198 publications
7.8K citations
Hungarian Academy of Sciences
Budapest, Hungary
37 h-index
142 publications
6.1K citations
Massachusetts Institute of Technology
Cambridge, United States
37 h-index
111 publications
10.7K citations
University of California San Diego
San Diego, United States
28 h-index
80 publications
4.9K citations
University of Waterloo
Waterloo, Canada
28 h-index
94 publications
3.3K citations
Tel Aviv University
Tel Aviv, Israel
28 h-index
78 publications
3.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
27 h-index
110 publications
3.9K citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
25 h-index
74 publications
3.3K citations
1–8 of 1.7K
Venues
- Discrete Mathematics
331 publications · 12.7K citations
54
h-index
- Journal of Combinatorial Theory Series A
200 publications · 11K citations
52
h-index
- The Electronic Journal of Combinatorics
276 publications · 8.8K citations
45
h-index
- Journal of Graph Theory
144 publications · 5.1K citations
39
h-index
- Theoretical Computer Science
90 publications · 4.7K citations
36
h-index
1–5