Parameterized Complexity of k-Anonymity: Hardness and Tractability-Reference-Cited by-同舟云学术

Parameterized Complexity of k-Anonymity: Hardness and Tractability

Published:2011 Issue: Volume: Page:242-255
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bonizzoni Paola,Della Vedova Gianluca,Dondi Riccardo,Pirola Yuri

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-19222-7_25

Reference17 articles.

1. Aggarwal, G., Feder, T., Kenthapadi, K., Khuller, S., Panigrahy, R., Thomas, D., Zhu, A.: Achieving anonymity via clustering. In: Vansummeren, S. (ed.) PODS, pp. 153–162. ACM, New York (2006)

2. Lecture Notes in Computer Science;G. Aggarwal,2005

3. Aggarwal, G., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Approximation algorithms for k-anonymity. J. Privacy Technology (2005)

4. Lecture Notes in Computer Science;J. Blocki,2010

5. Lecture Notes in Computer Science;P. Bonizzoni,2009

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Thel-Diversity problem: Tractability and approximability;Theoretical Computer Science;2013-11

2. Pattern-Guided k-Anonymity;Frontiers in Algorithmics and Algorithmic Aspects in Information and Management;2013

3. The effect of homogeneity on the computational complexity of combinatorial data anonymization;Data Mining and Knowledge Discovery;2012-10-13

4. The Effect of Homogeneity on the Complexity of k-Anonymity;Fundamentals of Computation Theory;2011

5. On the Complexity of the l-diversity Problem;Mathematical Foundations of Computer Science 2011;2011