Parameterized Complexity of k-Anonymity: Hardness and Tractability