Parameterized complexity of k-anonymity: hardness and tractability