Reid Andersen, Kumar Chellapilla. Finding Dense Subgraphs with Size Bounds. In Konstantin Avrachenkov, Debora Donato, Nelly Litvak, editors, Algorithms and Models for the Web-Graph, 6th International Workshop, WAW 2009, Barcelona, Spain, February 12-13, 2009. Proceedings. Volume 5427 of Lecture Notes in Computer Science, pages 25-37, Springer, 2009. [doi]
@inproceedings{AndersenC09,
title = {Finding Dense Subgraphs with Size Bounds},
author = {Reid Andersen and Kumar Chellapilla},
year = {2009},
doi = {10.1007/978-3-540-95995-3_3},
url = {http://dx.doi.org/10.1007/978-3-540-95995-3_3},
researchr = {https://researchr.org/publication/AndersenC09},
cites = {0},
citedby = {0},
pages = {25-37},
booktitle = {Algorithms and Models for the Web-Graph, 6th International Workshop, WAW 2009, Barcelona, Spain, February 12-13, 2009. Proceedings},
editor = {Konstantin Avrachenkov and Debora Donato and Nelly Litvak},
volume = {5427},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-95994-6},
}