Polytope Enumeration

Polytope Enumeration is a computational method in discrete geometry that systematically generates and classifies all combinatorially distinct polytopes satisfying specified constraints, such as dimension, number of vertices, or facet structure.

178

Publications

9.3K

Citations

276

Authors

183

Institutions

Publications per year

2017–2026

14

Authors

276

  1. SR
    Simone Rinaldi

    University of Florence, Italy

    5 publications · 112 citations

    5

    h-index

  2. DA
    David Avis

    McGill University, Canada

    4 publications · 116 citations

    4

    h-index

  3. MB
    Mireille Bousquet‐Mélou

    Laboratoire Bordelais de Recherche en Informatique, France

    4 publications · 375 citations

    4

    h-index

  4. ES
    Egon Schulte

    Northeastern University, United States

    4 publications · 89 citations

    4

    h-index

  5. KF
    K. Fukuda

    Kagawa University, Japan

    4 publications · 228 citations

    4

    h-index

1–5 of 276

Venues

  1. Discrete & Computational Geometry

    14 publications · 770 citations

    12

    h-index

  2. Discrete Mathematics

    10 publications · 479 citations

    10

    h-index

  3. Journal of Combinatorial Theory Series A

    8 publications · 265 citations

    8

    h-index

  4. Mathematical Programming

    7 publications · 449 citations

    7

    h-index

  5. The Electronic Journal of Combinatorics

    5 publications · 86 citations

    5

    h-index

1–5