The elimination distance of a graph to the class of bounded degree graphs can be efficiently computed on planar graphs.
