Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
Approximating maximum independent sets by excluding subgraphs
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Algorithms for approximate graph coloring
Algorithms for approximate graph coloring
On the complexity of approximating the independent set problem
Information and Computation
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
New approximation algorithms for graph coloring
Journal of the ACM (JACM)
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Testing of the long code and hardness for clique
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
The value of strong inapproximability results for clique
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Clique Is Hard to Approximate within n1-o(1)
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Lovász Number of Certain Circulant Graphs
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Dynamic Global Packet Routing in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Algorithmic and explicit determination of the Lovász number for certain circulant graphs
Discrete Applied Mathematics
The complexity of properly learning simple concept classes
Journal of Computer and System Sciences
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
Efficient computation of the lovász theta function for a class of circulant graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |