Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig. The Complexity of Detecting Fixed-Density Clusters. In Rossella Petreschi, Giuseppe Persiano, Riccardo Silvestri, editors, Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings. Volume 2653 of Lecture Notes in Computer Science, pages 201-212, Springer, 2003. [doi]
@inproceedings{HolzapfelKMT03,
title = {The Complexity of Detecting Fixed-Density Clusters},
author = {Klaus Holzapfel and Sven Kosub and Moritz G. Maaß and Hanjo Täubig},
year = {2003},
url = {http://link.springer.de/link/service/series/0558/bibs/2653/26530201.htm},
researchr = {https://researchr.org/publication/HolzapfelKMT03},
cites = {0},
citedby = {0},
pages = {201-212},
booktitle = {Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings},
editor = {Rossella Petreschi and Giuseppe Persiano and Riccardo Silvestri},
volume = {2653},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-40176-8},
}