1. Aggarwal, A., Suri, S.: Fast algorithms for computing the largest empty rectangle. In: SoCG, Waterloo, Canada, pp. 278–290 (1987)
2. Arkin, E.M., Banik, A., Carmi, P., Citovsky, G., Katz, M.J., Mitchell, J.S.B., Simakov, M.: Conflict-free covering. In: CCCG, Kingston, Ontario, Canada, 10–12 August 2015
3. Lecture Notes in Computer Science;EM Arkin,2015
4. Arkin, E.M., Díaz-Báñez, J.M., Hurtado, F., Kumar, P., Mitchell, J.S.B., Palop, B., Pérez-Lantero, P., Saumell, M., Silveira, R.I.: Bichromatic 2-center of pairs of points. Comput. Geom. 48(2), 94–107 (2015)
5. Armaselu, B., Daescu, O.: Maximum area rectangle separating red and blue points. In: CCCG 2016, British Columbia, Canada, 3–5 August 2016, pp. 244–251 (2016)