Polyhedral Combinatorics

Polyhedral Combinatorics is a branch of discrete mathematics that studies the combinatorial structure of polyhedra and polytopes, particularly their face lattices, vertex configurations, and integer hulls, to derive optimization-theoretic properties and solve problems in discrete geometry and discrete optimization.

398

Publications

19.6K

Citations

647

Authors

374

Institutions

Publications per year

2017–2026

22

Authors

647

  1. PM
    Peter McMullen

    University College London, United Kingdom

    8 publications · 799 citations

    8

    h-index

  2. MG
    Martin Grötschel

    Zuse Institute Berlin, Germany

    6 publications · 728 citations

    6

    h-index

  3. TH
    Takayuki Hibi

    The University of Osaka, Japan

    5 publications · 212 citations

    5

    h-index

  4. GL
    George L. Nemhauser

    Georgia Institute of Technology, United States

    5 publications · 221 citations

    5

    h-index

  5. DB
    David Barnette

    University of California, Davis, United States

    5 publications · 273 citations

    5

    h-index

1–5 of 647

Venues

  1. Mathematical Programming

    32 publications · 1.5K citations

    21

    h-index

  2. Discrete & Computational Geometry

    27 publications · 1.2K citations

    16

    h-index

  3. Discrete Applied Mathematics

    22 publications · 585 citations

    15

    h-index

  4. Discrete Mathematics

    14 publications · 538 citations

    12

    h-index

  5. Mathematics of Operations Research

    11 publications · 276 citations

    11

    h-index

1–5