Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z. & Wagner, D. (2007). On Finding Graph Clusterings with Maximum Modularity. In A. Brandstädt, D. Kratsch & H. Müller (ed.), Graph-Theoretic Concepts in Computer Science , Vol. 4769 (pp. 121-132) . Springer . ISBN: 978-3-540-74838-0.

Schmitz, C., Hotho, A., Jäschke, R. & Stumme, G. (2006). Content Aggregation on Knowledge Bases using Graph Clustering. In Y. Sure & J. Domingue (eds.), The Semantic Web: Research and Applications (p./pp. 530-544), Heidelberg: Springer.

Schmitz, C., Hotho, A., Jäschke, R. & Stumme, G. (2006). Content Aggregation on Knowledge Bases using Graph Clustering. Proceedings of the 3rd European Semantic Web Conference (p./pp. 530-544), June, Budva, Montenegro: Springer. ISBN: 3-540-34544-2

Schmitz, C., Hotho, A., Jäschke, R. & Stumme, G. (2006). Content Aggregation on Knowledge Bases using Graph Clustering. In Y. Sure & J. Domingue (eds.), The Semantic Web: Research and Applications (p./pp. 530-544), Heidelberg: Springer.

Dhillon, I. S., Mallela, S. & Modha, D. S. (2003). Information-Theoretic Co-Clustering. Proceedings of The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD-2003) (p./pp. 89--98), .

Newman, M. E. J. (2003). The structure and function of complex networks

Ng, A. Y., Jordan, M. I. & Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems 14 (p./pp. 849--856), : MIT Press.

Ranade, A. (2000). Some uses of spectral methods

Spielman, D. A. & Teng, S. (1996). Spectral Partitioning Works: Planar Graphs and Finite Element Meshes (). .

Pothen, A., Simon, H. & Liou, K. (1990). Partitioning Sparse Matrices with Eigenvectors of Graphs. SIAM J. MATRIX ANAL. APPLIC., 11, 430--452.

Donath, W. & Hoffman, A. (1973). Lower bounds for the partitioning of graphs. IBM Journal of Research and Development, 17, 420--425.