Clustering gene expression patterns
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Finding a large hidden clique in a random graph
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Finding Large Independent Sets in Polynomial Expected Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Max Cut for Random Graphs with a Planted Partition
Combinatorics, Probability and Computing
Finding Large Independent Sets in Polynomial Expected Time
Combinatorics, Probability and Computing
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Spectral clustering with limited independence
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding Additive Biclusters with Random Background
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
How hard is it to approximate the best Nash equilibrium?
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Random Tensors and Planted Cliques
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Small Clique Detection and Approximate Nash Equilibria
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Correlation clustering with noisy input
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A Note on Edge-based Graph Partitioning and its Linear Algebraic Structure
Journal of Mathematical Modelling and Algorithms
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing
Finding a maximum independent set in a sparse random graph
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
A spanning tree-based encoding of the MAX CUT problem for evolutionary search
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Statistical algorithms and a lower bound for detecting planted cliques
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |