The Parameterized Complexity of Regular Subgraph Problems and Generalizations