Parameterized Complexity of k-Anonymity: Hardness and Tractability

Conference Paper
Publication Date:
2011
Short description:
(2011). Parameterized Complexity of k-Anonymity: Hardness and Tractability [conference presentation - intervento a convegno]. Retrieved from http://hdl.handle.net/10446/25745
Iris type:
1.4.01 Contributi in atti di convegno - Conference presentations
List of contributors:
Authors of the University:
Handle:
https://aisberg.unibg.it/handle/10446/25745
Book title:
Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010. Revised Selected Papers
Published in:
LECTURE NOTES IN COMPUTER SCIENCE
Series