The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming

A PCP characterization of NP with optimal amortized query complexity

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems

Information and Computation

The Non-approximability of Non-Boolean Predicates

APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization

A combinatorial algorithm for MAX CSP

Information Processing Letters

Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution

IEEE Transactions on Knowledge and Data Engineering

Supermodular functions and the complexity of MAX CSP

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions

Supermodular functions and the complexity of MAX CSP

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions