Approximating coloring and maximum independent sets in 3-uniform hypergraphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A spectral technique for random satisfiable 3CNF formulas
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Approximate Coloring of Uniform Hypergraphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Coloring 2-colorable hypergraphs with a sublinear number of colors
Nordic Journal of Computing
Approximate coloring of uniform hypergraphs
Journal of Algorithms
Testing hypergraph colorability
Theoretical Computer Science - Automata, languages and programming
A spectral heuristic for bisecting random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Strong Refutation Heuristics for Random k-SAT
Combinatorics, Probability and Computing
On the Expansion of the Giant Component in Percolated (n, d,λ) Graphs
Combinatorics, Probability and Computing
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
Artificial Intelligence
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
The complexity of vertex coloring problems in uniform hypergraphs with high degree
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
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 complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An adaptive spectral heuristic for partitioning random graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the hardness and easiness of random 4-SAT formulas
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Complete convergence of message passing algorithms for some satisfiability problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
| Hi-index | 0.00 |