Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
On the Complexity of Approximating the Independent Set Problem
STACS '89 Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science
LOGICAL DEFINABILITY OF NP OPTIMIZATION PROBLEMS
LOGICAL DEFINABILITY OF NP OPTIMIZATION PROBLEMS
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
| Hi-index | 0.89 |