Before revision:  They also gave an efficient polynomial time approximation scheme (EPTAS) for disk graphs , however the complexity of maximum clique in this setting remains unknown.
After revision:  They also gave an efficient polynomial time approximation scheme (EPTAS) for disk graphs . However, the complexity of maximum clique in this setting remains unknown.