- Vladimir Bondarenko, Andrei Nikolaev, “On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems”, International Journal of Mathematics and Mathematical Sciences, 2016, 2016, 1
- David Avis, Patrick Hayden, Mark M. Wilde, “Leggett-Garg inequalities and the geometry of the cut polytope”, Phys. Rev. A, 82, № 3, 2010, 030102
- Hiroshi Hirai, “Metric packing for K 3+K 3”, Combinatorica, 30, № 3, 2010, 295
- Nathan Krislock, Jérôme Malick, Frédéric Roupin, “BiqCrunch”, ACM Trans. Math. Softw., 43, № 4, 2017, 1
- Kartik Krishnan, Tamás Terlaky, Graph Theory and Combinatorial Optimization, 2005, 101
- Alexey B. Petrovsky, 317, Recent Developments and New Directions in Soft Computing, 2014, 19
- Jan Pablo Burgard, Carina Moreira Costa, Christopher Hojny, Thomas Kleinert, Martin Schmidt, “Mixed-integer programming techniques for the minimum sum-of-squares clustering problem”, J Glob Optim, 87, № 1, 2023, 133
- A. B. Petrovsky, “Methods for the group classification of multi-attribute objects (part 2)”, Sci. Tech.Inf. Proc., 37, № 5, 2010, 357
- Subhash Khot, Assaf Naor, 168, Harmonic Analysis and Applications, 2021, 185
- Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer, “Labelings vs. Embeddings: On Distributed and Prioritized Representations of Distances”, Discrete Comput Geom, 71, № 3, 2024, 849