- D. Avis, V.P. Grishukhin, “A bound on the k-gonality of facets of the hypermetric cone and related complexity problems”, Computational Geometry, 2, № 5, 1993, 241
- David Avis, Hiroshi Imai, Tsuyoshi Ito, “Generating facets for the cut polytope of a graph by triangular elimination”, Math. Program., 112, № 2, 2007, 303
- Victor Chepoi, Vitalii Patlatîi, Chiril Prisăcaru, “L1-embeddability of rectilinear polygons with holes”, J Geom, 56, № 1-2, 1996, 18
- Anja Janßen, Sebastian Neblung, Stilian Stoev, “Tail-dependence, exceedance sets, and metric embeddings”, Extremes, 26, № 4, 2023, 747
- Michel Deza, Monique Laurent, “Facets for the cut cone II: Clique-web inequalities”, Mathematical Programming, 56, № 1-3, 1992, 161
- L. lovász, L. Pyber, D.J.A. Welsh, G.M. Ziegler, Handbook of Combinatorics, 1995, 2039