For what k is MAX-2-SAT-k NP-complete?
3-OCC-MAX 2SAT: given a CNF formula $\varphi$ in which each clause contains at most 2 literals and each variable appears in at most three clauses (counting together both positive and negative literals); does there exist an assignment that satisfies at least $k$ clauses?

In P. Berman, M. Karpinski, On some tighter inapproximability results (1998). Lecture
Notes In Computer Science, vol. 1644 (1999), pp. 200-209 :

... for any $\epsilon &gt; 0$ it is NP hard to decide whether an
instance of 3-OCC-MAX 2SAT
with $2016 n$ clauses has a truth assignment that satisfies
at least $(2012 - \epsilon)n$ clauses.

As noted in the domotorp's comment, if a variable appers only positive or negative we can fix its value (satisfying and deleting all the clauses in which it appears); so we can assume that the 3 occurrences are not-all-equal ending up in a "3-NAE-OCC-MAX 2SAT" instance :-)