Coloring k-colorable graphs using relatively small palettes
Journal of Algorithms
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Journal of Algorithms
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Independent sets in bounded-degree hypergraphs
Discrete Applied Mathematics
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
Independent sets in bounded-degree hypergraphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
SDP-based algorithms for maximum independent set problems on hypergraphs
Theoretical Computer Science
| Hi-index | 0.00 |