Charalampos E. Tsourakakis. The K-clique Densest Subgraph Problem. In Aldo Gangemi, Stefano Leonardi, Alessandro Panconesi, editors, Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18-22, 2015. pages 1122-1132, ACM, 2015. [doi]
@inproceedings{Tsourakakis15a,
title = {The K-clique Densest Subgraph Problem},
author = {Charalampos E. Tsourakakis},
year = {2015},
doi = {10.1145/2736277.2741098},
url = {http://doi.acm.org/10.1145/2736277.2741098},
researchr = {https://researchr.org/publication/Tsourakakis15a},
cites = {0},
citedby = {0},
pages = {1122-1132},
booktitle = {Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18-22, 2015},
editor = {Aldo Gangemi and Stefano Leonardi and Alessandro Panconesi},
publisher = {ACM},
isbn = {978-1-4503-3469-3},
}