- N. Yu. Zolotykh, “New modification of the double description method for constructing the skeleton of a polyhedral cone”, Comput. Math. and Math. Phys., 52, no. 1, 2012, 146

- M.J. Wainwright, M.I. Jordan, “Log-determinant relaxation for approximate inference in discrete Markov random fields”, IEEE Trans. Signal Process., 54, no. 6, 2006, 2099

- Uriel Feige, Gideon Schechtman, “On the optimality of the random hyperplane rounding technique for MAX CUT”, Random Struct Algorithms, 20, no. 3, 2002, 403

- Kedar Dhamdhere, 3122, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2004, 96

- S. J. Dilworth, Denka Kutzarova, Svetozar Stankov, “Metric embeddings of Laakso graphs into Banach spaces”, Banach J. Math. Anal., 16, no. 4, 2022, 60

- Antoine Deza, Boris Goldengorin, Dmitrii V. Pasechnik, “The isometries of the cut, metric and hypermetric cones”, J Algebr Comb, 23, no. 2, 2006, 197

- Costantino Budroni, Temporal Quantum Correlations and Hidden Variable Models, 2016, 1

- Venkat Chandrasekaran, Benjamin Recht, Pablo A. Parrilo, Alan S. Willsky, “The Convex Geometry of Linear Inverse Problems”, Found Comput Math, 12, no. 6, 2012, 805

- Koji Matsushita, “Toric rings of (0,1)-polytopes with small rank”, Illinois J. Math., -1, no. -1, 2024

- Oktay Günlük, Jon Lee, Janny Leung, 154, Mixed Integer Nonlinear Programming, 2012, 513
