Set Partitions
Set Partitions is a combinatorial construct that consists of a decomposition of a given set into a collection of non-empty, pairwise disjoint subsets whose union is the original set.
212
Publications
33.9K
Citations
342
Authors
212
Institutions
Publications per year
2017–2026
23
Variants
Set Partition
212
Well-Separated Clusters and Optimal Fuzzy Partitions
J. C. Dunn · Journal of Cybernetics · 1974 · 2.5K citations
Crossings and nestings of matchings and partitions
William Chen, Eva Y.P. Deng, Rosena R. X. Du et al. · Transactions of the American Mathematical Society · 2006 · 280 citations · Full text
1–5 of 212
342
8
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 342
212
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
12 publications
845 citations
University of Haifa
Haifa, Israel
8 h-index
10 publications
209 citations
Charles University
Prague, Czechia
6 h-index
7 publications
314 citations
University of California San Diego
San Diego, United States
6 h-index
11 publications
391 citations

Pennsylvania State University
State College, United States
5 h-index
5 publications
200 citations

University of the Witwatersrand
Johannesburg, South Africa
4 h-index
4 publications
50 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
3 publications
47 citations
Georgia Institute of Technology
Atlanta, United States
3 h-index
5 publications
159 citations
1–8 of 212
18 publications · 849 citations
15
h-index
18 publications · 535 citations
13
h-index
11 publications · 283 citations
10
h-index
9 publications · 310 citations
9
h-index
PROC · 7 publications · 158 citations
7
h-index
1–5