"Parameterized complexity of k-anonymity: hardness and tractability."

Paola Bonizzoni et al. (2013)
a service of Schloss Dagstuhl - Leibniz Center for Informatics