Similar Items: On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
- Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
- Local Depth-Based Corrections to Maxmin Landmark Selection for Lazy Witness Persistence
- Apple Peel Unfolding of Archimedean and Catalan Solids
- On the volume of the elliptope and related metric polytopes
- Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
- Peeling Rotten Potatoes for a Faster Approximation of Convex Cover