Mark Braverman, Kun-Ko, Young , Rubinstein, Aviad , and Weinstein, Omri . 2017. “Eth Hardness For Densest-\Emphk-Subgraph With Perfect Completeness”. In Proceedings Of The Twenty-Eighth Annual Acm-Siam Symposium On Discrete Algorithms, Soda 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, Pp. 1326–1341. SIAM. doi:10.1137/1.9781611974782.86.