1. Adamson, D., Deligkas, A., Gusev, V., Potapov, I.: On the Hardness of Energy Minimisation for Crystal Structure Prediction.
arXiv.org/abs/1910.12026
2. Ageev, A.A., Kelmanov, A.V., Pyatkin, A.V.: Np-hardness of the euclidean max-cut problem. Doklady Math. 89, 343–345 (2014)
3. Barahona, F.: On the computational complexity of Ising spin glass models. J. Phys. A: Math. Gen. 15(10), 3241–3253 (1982)
4. Buckingham, R.A.: The classical equation of state of gaseous helium, neon and argon. Proc. Royal Soc. London Ser. A. Math. Phys. Sci. 168(933), 264–283 (1938)
5. Cerioli, M.R., Faria, L., Ferreira, T.O., Protti, F.: A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation. RAIRO 45(3), 331–346 (2011)