Similar Items: The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem
- Witness Set: A Visibility Problem in $NPcap XP$
- Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
- The Magnitude of Dominated Sets: A Pareto Compliant Indicator Grounded in Metric Geometry
- Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
- Apple Peel Unfolding of Archimedean and Catalan Solids
- On the volume of the elliptope and related metric polytopes