The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem

Lucas Meijer, Till Miltzow, Johanna Ockenfels +1

In the (Nesting) Bird Box Problem we are given a polygonal domain P and a number k and we want to know if there is a set B of k points inside P such that no two points in B can see…