- Bernhard Korte, Jens Vygen, Kombinatorische Optimierung, 2012, 437
- Sandi Klavžar, Iztok Peterin, “Characterizing subgraphs of Hamming graphs”, Journal of Graph Theory, 49, no. 4, 2005, 302
- Antoine Deza, Komei Fukuda, Tomohiko Mizutani, Cong Vo, 2866, Discrete and Computational Geometry, 2003, 118
- S.A. Khot, N.K. Vishnoi, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005, 53
- Jeff Cheeger, Bruce Kleiner, Assaf Naor, “Compression bounds for Lipschitz maps from the Heisenberg group to L1”, Acta Math., 207, no. 2, 2011, 291
- Victor Chepoi, Arnaud Labourel, Sébastien Ratel, “On density of subgraphs of Cartesian products”, Journal of Graph Theory, 93, no. 1, 2020, 64
- Michel Deza, Mathieu Dutour Sikirić, “Generalized cut and metric polytopes of graphs and simplicial complexes”, Optim Lett, 14, no. 2, 2020, 273
- Catherine Babecki, Rekha R. Thomas, “Graphical designs and gale duality”, Math. Program., 200, no. 2, 2023, 703
- David AVIS, Sonoko MORIYAMA, Masaki OWARI, “From Bell Inequalities to Tsirelson's Theorem”, IEICE Trans. Fundamentals, E92-A, no. 5, 2009, 1254
- James Lee, Assaf Naor, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006, 99