- Ciprian Borcea, Ileana Streinu, Proceedings of the eighteenth annual symposium on Computational geometry, 2002, 25
- Gábor J. Székely, Maria L. Rizzo, “The Energy of Data”, Annu. Rev. Stat. Appl., 4, no. 1, 2017, 447
- Lee-Ad Gottlieb, Robert Krauthgamer, “A Nonlinear Approach to Dimension Reduction”, Discrete Comput Geom, 54, no. 2, 2015, 291
- Balabhaskar Balasundaram, Sergiy Butenko, “Constructing test functions for global optimization using continuous formulations of graph problems”, Optimization Methods and Software, 20, no. 4-5, 2005, 439
- R. Smarandache, P.O. Vontobel, “Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes”, IEEE Trans. Inform. Theory, 53, no. 7, 2007, 2376
- Michel Marie Deza, Elena Deza, Encyclopedia of Distances, 2014, 359
- David Avis, “Computational experience with the reverse search vertex enumeration algorithm”, Optimization Methods and Software, 10, no. 2, 1998, 107
- Philipp Krahenbuhl, Vladlen Koltun, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015, 1574
- Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Živný, “A Tractable Class of Binary VCSPs via M-Convex Intersection”, ACM Trans. Algorithms, 15, no. 3, 2019, 1
- Eugene Kamarchik, David A. Mazziotti, “Global Energy Minima of Molecular Clusters Computed in Polynomial Time with Semidefinite Programming”, Phys. Rev. Lett., 99, no. 24, 2007, 243002