@dblp

Parameterized Complexity of k-Anonymity: Hardness and Tractability.

, , , and . IWOCA, volume 6460 of Lecture Notes in Computer Science, page 242-255. Springer, (2010)

Links and resources

Tags