Permutation Enumeration
Permutation Enumeration is a combinatorial enumeration method that systematically counts or generates all possible arrangements of a finite set of distinct elements according to prescribed structural or positional constraints.
166
Publications
5.6K
Citations
210
Authors
157
Institutions
Publications per year
2017–2026
8
166
1–5 of 166
210
7
h-index
6
h-index
6
h-index
6
h-index
6
h-index
1–5 of 210
157

Centre National de la Recherche Scientifique
Paris, France
8 h-index
9 publications
419 citations

University of Otago
Dunedin, New Zealand
8 h-index
13 publications
353 citations
Université de Bordeaux
Bordeaux, France
8 h-index
9 publications
180 citations
University of Florida
Gainesville, United States
7 h-index
8 publications
137 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
7 h-index
9 publications
153 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
7 publications
436 citations
University of California San Diego
San Diego, United States
5 h-index
5 publications
135 citations
Institut Polytechnique de Bordeaux
Bordeaux, France
4 h-index
4 publications
77 citations
1–8 of 157
16 publications · 1.2K citations
15
h-index
12 publications · 387 citations
11
h-index
14 publications · 327 citations
11
h-index
13 publications · 446 citations
11
h-index
AC · 7 publications · 106 citations
7
h-index
1–5