Stable Marriage with incomplete lists and ties - NP-hardness
The stable marriage instance with ties is solvable in polynomial time, whereas the stable marriage instance with incomplete lists and ties is NP-hard.

The same holds for the Hospitals/Residents problem.  So there is no conflict between [1] and [2].