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
Go with the Winners Algorithms for Cliques in Random Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
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
The Lovász Number of Random Graphs
Combinatorics, Probability and Computing
Solving random satisfiable 3CNF formulas in expected polynomial time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding Large Independent Sets in Polynomial Expected Time
Combinatorics, Probability and Computing
Solving NP-hard semirandom graph problems in polynomial expected time
Journal of Algorithms
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Theoretical Computer Science
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
Correlation clustering with noisy input
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
SIAM Journal on Optimization
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
Complete convergence of message passing algorithms for some satisfiability problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Computer Science Review
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Sorting noisy data with partial information
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
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 |