Partition Enumeration Algorithms

Partition Enumeration Algorithms is a computational method in partition calculus that systematically generates all possible partitions of a set according to specified structural or combinatorial constraints.

60

Publications

2.6K

Citations

102

Authors

71

Institutions

Publications per year

2017–2026

2

Authors

102

  1. CD
    Carla D. Savage

    North Carolina State University, United States

    2 publications · 33 citations

    2

    h-index

  2. PZ
    Paul Zinn-Justin

    Centre National de la Recherche Scientifique, France

    2 publications · 68 citations

    2

    h-index

  3. CK
    Christian Krattenthaler

    University of Vienna, Austria

    2 publications · 36 citations

    2

    h-index

  4. TB
    Tiffany Barnes

    North Carolina State University, United States

    2 publications · 33 citations

    2

    h-index

  5. PD
    Philippe Di Francesco

    Institut de Physique Théorique, France

    2 publications · 68 citations

    2

    h-index

1–5 of 102

Venues

  1. Journal of Combinatorial Theory Series A

    5 publications · 347 citations

    5

    h-index

  2. Discrete Mathematics

    5 publications · 205 citations

    5

    h-index

  3. European Journal of Combinatorics

    4 publications · 117 citations

    4

    h-index

  4. The Computer Journal

    2 publications · 63 citations

    2

    h-index

  5. Mathematics of Computation

    MCOM · 2 publications · 46 citations

    2

    h-index

1–5