One of the key topics of computational social choice is electoral control, which models certain ways of how an election chair can seek to influence the outcome of elections via structural changes such as adding, deleting, or partitioning either candidates or voters. Faliszewski and Rothe [13] have surveyed the rich literature on control, giving an overview of previous results on the complexity of the associated problems for the most important voting rules. Among those, only a few results were known for two quite prominent voting rules: Borda Count and maximin voting (a.k.a. the Simpson–Kramer rule). Neveling and Rothe [26, 25] recently settled the remaining open cases for Borda. In this paper, we solve all remaining open cases for the complexity of control in maximin elections all of which concern control by partition of either candidates or voters.