Ordered Partitions
Ordered Partitions is a combinatorial construct in partition calculus that consists of a sequence of disjoint, non-empty subsets of a totally ordered set arranged in a specific linear order, where the ordering of the blocks respects the underlying order of elements.
121
Publications
5.9K
Citations
200
Authors
141
Institutions
Publications per year
2017–2026
11
Variants
Compositions
Parents
121
Three Partition Refinement Algorithms
Robert Paige, Robert E. Tarjan · SIAM Journal on Computing · 1987 · 1.2K citations
mRuby, a Bright Monomeric Red Fluorescent Protein for Labeling of Subcellular Structures
Simone Kredel, Franz Oswald, Karin Nienhaus et al. · PLoS ONE · 2009 · 226 citations · Full text
John R. Stembridge · Transactions of the American Mathematical Society · 1997 · 187 citations · Full text
1–5 of 121
200
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 200
141
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
8 publications
253 citations

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

University of Waterloo
Waterloo, Canada
3 h-index
3 publications
88 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
3 publications
46 citations

Wrocław University of Science and Technology
Wroclaw, Poland
3 h-index
6 publications
140 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
3 publications
289 citations
Laboratoire d'Informatique Algorithmique: Fondements et Applications
Paris, France
3 h-index
4 publications
123 citations
Université Paris Cité
Paris, France
3 h-index
5 publications
140 citations
1–8 of 141
9 publications · 600 citations
9
h-index
9 publications · 424 citations
9
h-index
6 publications · 273 citations
6
h-index
5 publications · 137 citations
5
h-index
4 publications · 72 citations
4
h-index
1–5