We analyze the complexity of several NP-hard election-related problems under the assumptions that the voters have group-separable preferences. We show that under this assumption our problems typically remain NP-hard, but we provide more efcient algorithms if additionally the clone decomposition tree is of moderate height. We also show a polynomial time algorithm for sampling group-separable elections uniformly at random.