Combinatorial Enumeration
Combinatorial Enumeration is the branch of combinatorics concerned with counting the number of distinct configurations in a discrete structure according to prescribed rules or constraints.
2.6K
Publications
112.6K
Citations
3.3K
Authors
1.2K
Institutions
Publications per year
2017–2026
207
2.6K
The Complexity of Enumeration and Reliability Problems
Leslie G. Valiant · SIAM Journal on Computing · 1979 · 2.1K citations
1–5 of 2.6K
3.3K
16
h-index
15
h-index
15
h-index
14
h-index
14
h-index
1–5 of 3.3K
1.2K

Centre National de la Recherche Scientifique
Paris, France
31 h-index
129 publications
5.3K citations
Massachusetts Institute of Technology
Cambridge, United States
25 h-index
54 publications
2.9K citations
Université de Bordeaux
Bordeaux, France
22 h-index
50 publications
4K citations

Hungarian Academy of Sciences
Budapest, Hungary
22 h-index
50 publications
2.4K citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
22 h-index
53 publications
3K citations

University of Waterloo
Waterloo, Canada
21 h-index
49 publications
1.6K citations

Tel Aviv University
Tel Aviv, Israel
19 h-index
39 publications
2K citations
Université Paris Cité
Paris, France
18 h-index
26 publications
1.3K citations
1–8 of 1.2K
182 publications · 8K citations
46
h-index
121 publications · 5.7K citations
39
h-index
133 publications · 3.8K citations
31
h-index
66 publications · 4.3K citations
29
h-index
52 publications · 1.9K citations
25
h-index
1–5