On the performance of spectral graph partitioning methods

Coarse-grained parallelism for hierarchical radiosity using group iterative methods

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques

Hierarchical partitioning for field-programmable systems

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design

The path resistance method for bounding &lgr;2 of a Laplacian

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

S-HARP: a scalable parallel dynamic partitioner for adaptive mesh-based computations

SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing

A Graph Theoretic Approach to Software Watermarking

IHW '01 Proceedings of the 4th International Workshop on Information Hiding

New Spectral Lower Bounds on the Bisection Width of Graphs

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science

Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

New spectral lower bounds on the bisection width of graphs

Theoretical Computer Science

Pairwise data clustering and applications

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Spectral clustering with more than K eigenvectors

Neurocomputing

Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Unsupervised sparse matrix co-clustering for marketing and sales intelligence

PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I