Almost all graphs with average degree 4 are 3-colorable
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Models and thresholds for random constraint satisfaction problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Random graphs, random triangle-free graphs, and random partial orders
Computational Discrete Mathematics
On the critical exponents of random k-SAT
Random Structures & Algorithms
Almost all graphs with average degree 4 are 3-colorable
Journal of Computer and System Sciences - STOC 2002
Approximating the Satisfiability Threshold for Random k-XOR-formulas
Combinatorics, Probability and Computing
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
The two possible values of the chromatic number of a random graph
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Annals of Mathematics and Artificial Intelligence
The resolution complexity of random graphk-colorability
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Threshold properties of random boolean constraint satisfaction problems
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
A novel giant-subgraph phase-transition in sparse random k-partite graphs
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
On the chromatic number of random graphs
Journal of Combinatorial Theory Series B
A spectral approach to analysing belief propagation for 3-colouring
Combinatorics, Probability and Computing
Threshold properties of random boolean constraint satisfaction problems
Discrete Applied Mathematics
A novel giant-subgraph phase-transition in sparse random k-partite graphs
Discrete Applied Mathematics
The resolution complexity of random graph k-colorability
Discrete Applied Mathematics
Max k-cut and approximating the chromatic number of random graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Why almost all k-colorable graphs are easy
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
Discrete Applied Mathematics
Coloring random graphs online without creating monochromatic subgraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The freezing threshold for k-colourings of a random graph
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the chromatic number of random graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |