Parameterized Complexity of k-Anonymity: Hardness and Tractability (Q3000512): Difference between revisions

@@ Property / cites work @@
+Achieving anonymity via clustering
@@ Property / cites work: Achieving anonymity via clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Database Theory - ICDT 2005
@@ Property / cites work: Database Theory - ICDT 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Resolving the Complexity of Some Data Privacy Problems
+Normal rank
@@ Property / cites work @@
+The k-Anonymity Problem Is Hard
@@ Property / cites work: The k-Anonymity Problem Is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of anonymizing data by suppressing entries
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
+Normal rank
@@ Property / cites work @@
+k-Anonymization with Minimal Loss of Information
@@ Property / cites work: k-Anonymization with Minimal Loss of Information / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
@@ Property / cites work: k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY / rank @@
+Normal rank