We look at two different NP-Hard variants of the classical stable marriage problem in the realm of Parameterized Complexity. The first, Stable Marriage with ties and incomplete lists, we give parameterized algorithms with solution size as the parameter. The second, Hospital Residents Problem with lower quotas, we give an XP-algorithm and show some W[1] hardness results.