- Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh, “Compacting cuts”, ACM Trans. Algorithms, 5, № 3, 2009, 1
- Yonatan Aumann, Yuval Rabani, “An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm”, SIAM J. Comput., 27, № 1, 1998, 291
- Nicolas Catusse, Victor Chepoi, Yann Vaxès, “Embedding into the rectilinear plane in optimal O(n2) time”, Theoretical Computer Science, 412, № 22, 2011, 2425
- Paradigms of Combinatorial Optimization, 2014, 707
- Michel Deza, Monique Laurent, “Applications of cut polyhedra — I”, Journal of Computational and Applied Mathematics, 55, № 2, 1994, 191
- David Avis, Hiroshi Imai, Tsuyoshi Ito, “On the relationship between convex bodies related to correlation experiments with dichotomic observables”, J. Phys. A: Math. Gen., 39, № 36, 2006, 11283
- Meera Sitharam, Joel Willoughby, 9201, Automated Deduction in Geometry, 2015, 129
- Michel Deza, Monique Laurent, “Hypercube embedding of generalized bipartite metrics”, Discrete Applied Mathematics, 56, № 2-3, 1995, 215
- Krzysztof Onak, Anastasios Sidiropoulos, Proceedings of the twenty-fourth annual symposium on Computational geometry, 2008, 28
- Selim Esedoḡ Lu, Felix Otto, “Threshold Dynamics for Networks with Arbitrary Surface Tensions”, Comm Pure Appl Math, 68, № 5, 2015, 808