Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Algorithms for approximate graph coloring
Algorithms for approximate graph coloring
Chernoff-Hoeffding Bounds for Applications with Limited Independence
SIAM Journal on Discrete Mathematics
Randomized graph products, chromatic numbers, and Lovasz j-function
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Improved Approximation Guarantees for Packing and Covering Integer Programs
SIAM Journal on Computing
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximations of Independent Sets in Graphs
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
CSV: visualizing and mining cohesive subgraphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Better inapproximability results for maxclique, chromatic number and min-3lin-deletion
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
| Hi-index | 0.00 |