Symeonidis, Panagiotis, Nanopoulos, Alexandros and Manolopoulos, Yannis. "Tag recommendations based on tensor dimensionality reduction." Paper presented at the meeting of the RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems, New York, NY, USA, 2008.

Spielman, D.A.. "Spectral Graph Theory and its Applications." Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on (2007): 29-38.

Newman, MEJ. "Finding community structure in networks using the eigenvectors of matrices." Physical Review E 74 , no. 3 (2006): 36104.

Dias, Vânia M.F., de Figueiredo, Celina M.H. and Szwarcfiter, Jayme L.. "Generating bicliques of a graph in lexicographic order." Theoretical Computer Science 337 , no. 1-3 (2005): 240 - 248.

White, S. and Smyth, P.. "A spectral clustering approach to finding communities in graph." (2005): .

Haveliwala, T.H. and Kamvar, S.D.. "The second eigenvalue of the Google matrix." A Stanford University Technical Report http://dbpubs. stanford. edu (2003): .

Yu, Stella X. and Shi, Jianbo. "Multiclass Spectral Clustering." Paper presented at the meeting of the Proc. International Conference on Computer Vision (ICCV 03), Nice, France, 2003.

Blelloch, Guy. "Graph Separators." 2002.

Dhillon, Inderjit S.. "Co-clustering documents and words using bipartite spectral graph partitioning." Paper presented at the meeting of the KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA, 2001.

Monien, B. On Spectral Bounds for the k-Partitioning of Graphs. (2001). .

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

Barabasi, A. L. and Albert, R.. "Emergence of scaling in random networks." Science 286 , no. 5439 (1999): 509--512.

Chung, F. R. K.. Spectral Graph Theory. : American Mathematical Society, 1997.

Bolla, Marianna and Tusnády, Gábor. "Spectra and optimal partitions of weighted graphs." Discrete Math. 128 , no. 1-3 (1994): 1--20.

Chan, Pak K., Schlag, Martine D. F. and Zien, Jason Y.. "Spectral K-way ratio-cut partitioning and clustering.." IEEE Trans. on CAD of Integrated Circuits and Systems 13 , no. 9 (1994): 1088-1096.

Hagen, Lars W. and Kahng, Andrew B.. "New spectral methods for ratio cut partitioning and clustering.." IEEE Trans. on CAD of Integrated Circuits and Systems 11 , no. 9 (1992): 1074-1085.

Mohar, B.. "The Laplacian spectrum of graphs." Graph Theory, Combinatorics, and Applications 2 (1991): 871--898.

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

Johnson, David S. and Papadimitriou, Christos H.. "On generating all maximal independent sets." Inf. Process. Lett. 27 , no. 3 (1988): 119--123.

Fiedler, M.. "A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory." Czechoslovak Mathematical Journal 25 , no. 100 (1975): 619--633.