NP-hard problem on planar unit disk graph
Did you try doing a search for "planar unit disk graphs"? According to this paper the problem of finding the largest possible induced matching is NP-complete for planar unit disk graphs, according to this paper so is the minimum connected dominating set, and according to this paper so is the maximum number of disjoint dominating sets.