"Parameterized Complexity of k-Anonymity: Hardness and Tractability."

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