Given a set of points P and axis-aligned rectangles R in the plane, point p∈P is called exposed if it lies outside all R. In max-exposure problem, given an integer parameter k, we want to delete k from so as maximize number points. We show that problem NP-hard assuming plausible complexity conjectures also hard approximate even when are translates two fixed rectangles. However, only consists si...