Mark Braverman, Kun-Ko, Young , Rubinstein, Aviad , and Weinstein, Omri . 2015. “Eth Hardness For Densest-\Emphk-Subgraph With Perfect Completeness”. Electron. Colloquium Comput. Complex., 22, Pp. 74. http://eccc.hpi-web.de/report/2015/074.