Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Approximating the independence number via the j -function
Mathematical Programming: Series A and B
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Coloring Bipartite Hypergraphs
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximating Maximum Independent Sets in Uniform Hypergraphs
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Coloring 2-colorable hypergraphs with a sublinear number of colors
Nordic Journal of Computing
Hardness of approximate hypergraph coloring
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Coloring k-colorable graphs using smaller palettes
SODA '01 Proceedings of the twelfth 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
Journal of Algorithms
Testing hypergraph colorability
Theoretical Computer Science - Automata, languages and programming
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
Random Structures & Algorithms
Path coupling using stopping times
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Wireless capacity with arbitrary gain matrix
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
| Hi-index | 0.00 |