The complexity of the list homomorphism problem for separable signed graphs is classified, showing that it is polynomial-time solvable for segmented signed graphs and NP-complete otherwise.
