On bounded occurrence constraint satisfaction

Non-approximability results for optimization problems on bounded degree instances

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

MAX CUT in cubic graphs

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science

Approximating Bounded Degree Instances of NP-Hard Problems

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory

MAX CUT in cubic graphs

Journal of Algorithms

Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights

Journal of Computer and System Sciences

The approximability of MAX CSP with fixed-value constraints

Journal of the ACM (JACM)

Guest column: the elusive inapproximability of the TSP

ACM SIGACT News