Brandes, Ulrik and Delling, Daniel and Gaertler, Marco and Görke, Robert and Hoefer, Martin and Nikoloski, Zoran and Wagner, Dorothea. On Finding Graph Clusterings with Maximum Modularity. Graph-Theoretic Concepts in Computer Science. editor(s) Brandstädt, Andreas and Kratsch, Dieter and Müller, Haiko. Lecture Notes in Computer Science, (4769) 121-132, Springer, Berlin / Heidelberg, Year 2007.

Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd. Content Aggregation on Knowledge Bases using Graph Clustering. The Semantic Web: Research and Applications. editor(s) Sure, York and Domingue, John. LNAI, (4011) 530-544, Springer, Heidelberg, Year 2006.

Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd. Content Aggregation on Knowledge Bases using Graph Clustering. Proceedings of the 3rd European Semantic Web Conference. LNCS, (4011) 530-544, Springer, Budva, Montenegro, Year 2006.

Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd. Content Aggregation on Knowledge Bases using Graph Clustering. The Semantic Web: Research and Applications. editor(s) Sure, York and Domingue, John. LNAI, (4011) 530-544, Springer, Heidelberg, Year 2006.

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

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

Ng, Andrew Y. and Jordan, Michael I. and Weiss, Yair. On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems 14. 849--856, MIT Press, Year 2001.

Ranade, A.G.. Some uses of spectral methods. Year 2000.

Spielman, Daniel A. and Teng, Shang. Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. University of California at Berkeley, Berkeley, CA, USA, Year 1996.

Pothen, A. and Simon, H.D. and Liou, K.P.. Partitioning Sparse Matrices with Eigenvectors of Graphs. In SIAM J. MATRIX ANAL. APPLIC., (11) 3: 430--452, Year 1990.

Donath, W.E. and Hoffman, A.J.. Lower bounds for the partitioning of graphs. In IBM Journal of Research and Development, (17) 5: 420--425, Year 1973.