A survey of graph layout problems
ACM Computing Surveys (CSUR)
Machine Learning
Max Cut for Random Graphs with a Planted Partition
Combinatorics, Probability and Computing
Clustering via matrix powering
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A spectral heuristic for bisecting random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Error bounds for correlation clustering
ICML '05 Proceedings of the 22nd international conference on Machine learning
A rigorous analysis of population stratification with limited data
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Collaborative partitioning with maximum user satisfaction
Proceedings of the 17th ACM conference on Information and knowledge management
Single- and multi-objective evolutionary algorithms for graph bisectioning
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Community detection algorithms: a comparative analysis: invited presentation, extended abstract
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
A spectral method for MAX2SAT in the planted solution model
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Fast detection of size-constrained communities in large networks
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
Clustering Algorithms for Chains
The Journal of Machine Learning Research
Efficient community detection using power graph analysis
Proceedings of the 9th workshop on Large-scale and distributed informational retrieval
Boosting spectral partitioning by sampling and iteration
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Bounding the misclassification error in spectral partitioning in the planted partition model
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Reconstructing many partitions using spectral techniques
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A simple message passing algorithm for graph partitioning problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Computer Science Review
GANC: Greedy agglomerative normalized cut for graph clustering
Pattern Recognition
An efficient generator for clustered dynamic random networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Structure and attributes community detection benchmark and a novel selection method
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Proceedings of the 7th Workshop on Social Network Mining and Analysis
Overlapping community detection in networks: The state-of-the-art and comparative study
ACM Computing Surveys (CSUR)
Hierarchical community decomposition via oblivious routing techniques
Proceedings of the first ACM conference on Online social networks
On defining and computing communities
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |