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

Authors

210

  1. VV
    Vincent Vatter

    University of St Andrews, United Kingdom

    7 publications · 119 citations

    7

    h-index

  2. MD
    M. D. Atkinson

    University of Otago, New Zealand

    6 publications · 138 citations

    6

    h-index

  3. MA
    Michael Albert

    University of Otago, New Zealand

    6 publications · 197 citations

    6

    h-index

  4. TM
    Toufik Mansour

    University of Haifa, Israel

    6 publications · 118 citations

    6

    h-index

  5. MB
    Miklós Bóna

    University of Florida, United States

    6 publications · 279 citations

    6

    h-index

1–5 of 210

Venues

  1. Journal of Combinatorial Theory Series A

    16 publications · 1.2K citations

    15

    h-index

  2. Discrete Mathematics

    12 publications · 387 citations

    11

    h-index

  3. The Electronic Journal of Combinatorics

    14 publications · 327 citations

    11

    h-index

  4. Advances in Applied Mathematics

    13 publications · 446 citations

    11

    h-index

  5. Annals of Combinatorics

    AC · 7 publications · 106 citations

    7

    h-index

1–5