Interval Partitions
Interval Partitions is a combinatorial construct in partition calculus that consists of a finite sequence of disjoint, contiguous subsets of a linearly ordered set, each forming an interval, such that their union exhausts the original set.
41
Publications
1.8K
Citations
75
Authors
54
Institutions
Publications per year
2017–2026
4
Parents
41
1–5 of 41
75
2
h-index
Institut national de recherche en sciences et technologies du numérique, France
2 publications · 125 citations
2
h-index
Universidade Federal de Pernambuco, Brazil
2 publications · 125 citations
2
h-index
2
h-index
2
h-index
1–5 of 75
54

Universidade Federal de Pernambuco
Recife, Brazil
2 h-index
2 publications
125 citations
National Chung Cheng University
Minxiong, Taiwan
2 h-index
4 publications
77 citations
University of California, Berkeley
Berkeley, United States
2 h-index
2 publications
253 citations
Osaka Prefecture University
Sakai, Japan
2 h-index
4 publications
54 citations

Sorbonne Université
Paris, France
2 h-index
2 publications
136 citations

Universidad Pública de Navarra (UPNA)
Pamplona, Spain
1 h-index
2 publications
74 citations
Translational Innovation in Medicine and Complexity
Grenoble, France
1 h-index
2 publications
76 citations
University of Oxford
Oxford, United Kingdom
1 h-index
1 publications
14 citations
1–8 of 54
2 publications · 22 citations
2
h-index
2 publications · 98 citations
2
h-index
CMB · 1 publications · 12 citations
1
h-index
Repository · 1 publications · 10 citations
1
h-index
EJP · 1 publications · 10 citations
1
h-index
1–5