A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Papers matching “disk gaps” 1

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Michael Emmerich, Ksenia Pereverdieva, Andre H. Deutz

0

citations

1 result