Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Largest Eigenvalue of Sparse Random Graphs
Combinatorics, Probability and Computing
Spectral norm of random matrices
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
Spectral techniques for graph bisection in genetic algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Exploiting social networks for threshold signing: attack-resilience vs. availability
Proceedings of the 2008 ACM symposium on Information, computer and communications security
On Construction of Almost-Ramanujan Graphs
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes
IEEE Transactions on Information Theory
Finding Planted Partitions in Random Graphs with General Degree Distributions
SIAM Journal on Discrete Mathematics
Towards attack resilient social network based threshold signing
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Approximating independent set in perturbed graphs
Discrete Applied Mathematics
| Hi-index | 0.06 |