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
398
On the Complexity of Nonnegative Matrix Factorization
Stephen A. Vavasis · SIAM Journal on Optimization · 2009 · 600 citations
The maximum numbers of faces of a convex polytope
Peter McMullen · Mathematika · 1970 · 585 citations
Geometric Algorithms and Combinatorial Optimization
Janny Leung, Martin Grötschel, László Lovász et al. · Journal of the Operational Research Society · 1989 · 450 citations
1–5 of 398
647
8
h-index
6
h-index
5
h-index
5
h-index
5
h-index
1–5 of 647
374
University College London
London, United Kingdom
10 h-index
12 publications
1.1K citations
Georgia Institute of Technology
Atlanta, United States
10 h-index
19 publications
667 citations

Centre National de la Recherche Scientifique
Paris, France
10 h-index
15 publications
302 citations
University of California, Davis
Davis, United States
9 h-index
16 publications
1.3K citations
University of Washington
Seattle, United States
9 h-index
9 publications
428 citations
Hebrew University of Jerusalem
Jerusalem, Israel
7 h-index
7 publications
462 citations

McGill University
Montreal, Canada
7 h-index
9 publications
320 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
7 publications
369 citations
1–8 of 374
32 publications · 1.5K citations
21
h-index
27 publications · 1.2K citations
16
h-index
22 publications · 585 citations
15
h-index
14 publications · 538 citations
12
h-index
11 publications · 276 citations
11
h-index
1–5