Sparsest cuts and bottlenecks in graphs

Sparsest cuts and concurrent flows in product graphs

Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)

NP-hardness of Euclidean sum-of-squares clustering

Machine Learning

A nondifferentiable optimization approach to ratio-cut partitioning

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms

Determining edge expansion and other connectivity measures of graphs of bounded genus

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I

The complexity status of problems related to sparsest cuts

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut

SIAM Journal on Computing

The complexity of finding uniform sparsest cuts in various graph classes

Journal of Discrete Algorithms

Polynomiality of sparsest cuts with fixed number of sources

Operations Research Letters

Survey: Graph clustering

Computer Science Review

Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs

Networks

An overview of algorithms for network survivability

ISRN Communications and Networking

Sparsest cut on bounded treewidth graphs: algorithms and hardness results

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

On connected two communities

ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135

Employee workload balancing by graph partitioning

Discrete Applied Mathematics