Before revision:  This contrasts with the fact that these problems require 2^{\Omega(n)} time under ETH in constant-ply Euclidean unit disk graphs.
After revision:  This contrasts with the fact that these problems require 2^{\Omega(n)} time under ETH in constant maximum degree Euclidean unit disk graphs.