Our paper “Enumerating Top-k Quasi-Cliques” by Seyed-Vahid Sanei-Mehri, Apurba Das, and Srikanta Tirthapura, has been accepted to IEEE Bigdata Conference 2018 as a short paper. On the topic of finding dense subgraphs in a graph, this paper presents hardness results as well as algorithms for the problem of enumerating “quasi-cliques”, a relaxation of cliques in a graph. Congrats Vahid and Apurba!
