2007

Incollection (springerlink:10.1007/978-3-540-74839-7_12)
Brandes, U.; Delling, D.; Gaertler, M.; Görke, R.; Hoefer, M.; Nikoloski, Z. & Wagner, D.
Brandstädt, A.; Kratsch, D. & Müller, H. (ed.)
On Finding Graph Clusterings with Maximum Modularity
Springer, 2007, 4769, 121-132

2006

Inproceedings (schmitz2006content)
Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G.
Sure, Y. & Domingue, J. (ed.)
Content Aggregation on Knowledge Bases using Graph Clustering
Springer, 2006, 4011, 530-544

Inproceedings (schmitz2006content)
Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G.
Content Aggregation on Knowledge Bases using Graph Clustering
Springer, 2006, 4011, 530-544

Inproceedings (schmitz2006content)
Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G.
Sure, Y. & Domingue, J. (ed.)
Content Aggregation on Knowledge Bases using Graph Clustering
Springer, 2006, 4011, 530-544

2003

Inproceedings (dhillon:mallela:modha:03)
Dhillon, I. S.; Mallela, S. & Modha, D. S.
Information-Theoretic Co-Clustering
2003, 89-98

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

2001

Inproceedings (Ng01onspectral)
Ng, A. Y.; Jordan, M. I. & Weiss, Y.
On spectral clustering: Analysis and an algorithm
MIT Press, 2001, 849-856

2000

Unpublished (ranade:sus)
Ranade, A.
Some uses of spectral methods
2000

1996

Techreport (Spielman:1996)
Spielman, D. A. & Teng, S.
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes
University of California at Berkeley, 1996

1990

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

1973

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