Almost all k-colorable graphs are easy to color
Journal of Algorithms
A randomised 3-colouring algorithm
Discrete Mathematics - Graph colouring and variations
The solution of some random NP-hard problems in polynomial expected time
Journal of Algorithms
On the second eigenvalue of random regular graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A near optimal algorithm for edge separators (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Finding a large hidden clique in a random graph
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods
STACS '01 Proceedings of the 18th 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
List Set Colouring: Bounds and Algorithms
Combinatorics, Probability and Computing
Sorting noisy data with partial information
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |