Efficient proper 2-coloring of almost disjoint hypergraphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Two-coloring random hypergraphs
Random Structures & Algorithms
On 2-coloring certain k-uniform hypergraphs
Journal of Combinatorial Theory Series A
Coloring uniform hypergraphs with few colors
Random Structures & Algorithms
Improved algorithmic versions of the Lovász Local Lemma
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
How many random edges make a dense hypergraph non-2-colorable?
Random Structures & Algorithms
Properly 2-Colouring Linear Hypergraphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Streaming algorithms for 2-coloring uniform hypergraphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A new lower bound of critical function for (k,s)-SAT
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
The local lemma is tight for SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Some new bounds on partition critical hypergraphs
European Journal of Combinatorics
Random coloring method in the combinatorial problem of Erdős and Lovász
Random Structures & Algorithms
| Hi-index | 0.00 |