Finding hidden Hamiltonian cycles
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
New approximation algorithms for graph coloring
Journal of the ACM (JACM)
A spectral technique for coloring random 3-colorable graphs (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
General partitioning on random graphs
Journal of Algorithms
Improved Algorithms for the Random Cluster Graph Model
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
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
Colouring Random Graphs in Expected Polynomial Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Coloring Sparse Random Graphs in Polynominal Average Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Algorithms for Colouring Random k-colourable Graphs
Combinatorics, Probability and Computing
Max Cut for Random Graphs with a Planted Partition
Combinatorics, Probability and Computing
A spectral heuristic for bisecting random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
Solving NP-hard semirandom graph problems in polynomial expected time
Journal of Algorithms
Spectral clustering with limited independence
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity analysis of a decentralised graph colouring algorithm
Information Processing Letters
Almost all hypergraphs without Fano planes are bipartite
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
Why almost all k-colorable graphs are easy
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Coloring sparse random k-colorable graphs in polynomial expected time
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A simple message passing algorithm for graph partitioning problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Fundamenta Informaticae
| Hi-index | 0.00 |