1. Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding $$k$$ points with minimum diameter and related problems. J. Algorithms 12(1), 38–56 (1991)
2. Atanassov, R., Bose, P., Couture, M., Maheshwari, A., Morin, P., Paquette, M., Smid, M., Wuhrer, S.: Algorithms for optimal outlier removal. J. Discrete Algorithms 7(2), 239–248 (2009)
3. Backurs, A., Dikkala, N., Tzamos, Ch.: Tight hardness results for maximum weight rectangles. In: 43rd International Colloquium on Automata, Languages, and Programming. Leibniz Int. Proc. Inform., vol. 55, # 81. Leibniz-Zent. Inform., Wadern (2016)
4. Barba, L., Durocher, S., Fraser, R., Hurtado, F., Mehrabi, S., Mondal, D., Morrison, J., Skala, M., Wahid, M.A.: On $$k$$-enclosing objects in a coloured point set. In: 25th Canadian Conference on Computational Geometry (Waterloo 2013), # 35. Carleton University, Ottawa (2013). http://cccg.ca/proceedings/2013/papers/paper_35.pdf
5. Barbay, J., Chan, T.M., Navarro, G., Pérez-Lantero, P.: Maximum-weight planar boxes in $$O(n^2)$$ time (and better). Inf. Process. Lett. 114(8), 437–445 (2014)