Two prover protocols: low error at affordable rates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient probabilistic checkable proofs and applications to approximation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
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)
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Finding maximum independent sets in sparse and general graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Hardness and methods to solve CLIQUE
Journal of Computer Science and Technology
Polynomially bounded minimization problems that are hard to approximate
Nordic Journal of Computing
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Simultaneous escape routing and layer assignment for dense PCBs
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
On the hardness of approximating Max-Satisfy
Information Processing Letters
Buying cheap is expensive: hardness of non-parametric multi-product pricing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On constructing an optimal consensus clustering from multiple clusterings
Information Processing Letters
Taximeter verification using imprecise data from GPS
Engineering Applications of Artificial Intelligence
On approximating four covering and packing problems
Journal of Computer and System Sciences
On the hardness of approximating Max-Satisfy
Information Processing Letters
Network coding is highly non-approximable
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing
Inapproximability results for the lateral gene transfer problem
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Genetic algorithms for estimating longest path from inherently fuzzy data acquired with GPS
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Survey: A survey on the structure of approximation classes
Computer Science Review
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
SIAM Journal on Computing
Hardness of longest common subsequence for sequences with bounded run-lengths
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
On approximating the d-girth of a graph
Discrete Applied Mathematics
Kernel bounds for path and cycle problems
Theoretical Computer Science
Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |