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
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
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
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
Foundations and Trends® in Theoretical Computer Science
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
Spectral methods for matrices and tensors
Proceedings of the forty-second ACM symposium on Theory of computing
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
Inapproximability of NP-complete variants of nash equilibrium
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
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
The spectral gap of random graphs with given expected degrees
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
An adaptive spectral heuristic for partitioning random graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
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
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Maximum cliques in graphs with small intersection number and random intersection graphs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A spectral approach to detecting subtle anomalies in graphs
Journal of Intelligent Information Systems
| Hi-index | 0.00 |