Cita APA (7a ed.)

Emmerich, M. T. M., Pereverdieva, K., & Deutz, A. H. (2026). Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane.

Cita Chicago Style (17a ed.)

Emmerich, Michael T. M., Ksenia Pereverdieva, y André H. Deutz. Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane. 2026.

Cita MLA (9a ed.)

Emmerich, Michael T. M., et al. Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane. 2026.