Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives.