Before revision:  Also, we are able to solve special cases of the DkSReg(n, k, d, \delta, \gamma) and DkSReg(n, k, d, \delta, d', \lambda) models introduced in [KL20], when the planted subgraph \mathcal{G is a clique instead of an arbitrary d-regular graph.
After revision:  Also, we are able to solve special cases of the models introduced for the Densest k-subgraph problem in [KL20], when the planted subgraph \mathcal{G is a clique instead of an arbitrary d-regular graph.