Articles under category:
Constraint Satisfaction
 Vol 9, Article 27 (pp 845-862) [Boolean Spec Issue] Satisfying Degree-$d$ Equations over $GF[2]^n$
 Vol 9, Article 23 (pp 703-757) [APRX-RND12 Spec Issue] Circumventing $d$-to-$1$ for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four
 Vol 9, Article 19 (pp 617-651) Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems by Uriel Feige, Elchanan Mossel, and Dan Vilenchik
 Vol 9, Article 11 (pp 413-435) Improved Inapproximability Results for Maximum $k$-Colorable Subgraph
 Vol 8, Article 12 (pp 269-289) SDP Gaps from Pairwise Independence
 Vol 6, Article 5 (pp 85-112) Can You Beat Treewidth?
 Vol 4, Article 5 (pp 111-128) Approximation Algorithms for Unique Games