Pages that link to "Item:Q849143"

The following pages link to Fixed-parameter tractability of anonymizing data by suppressing entries (Q849143):

Displaying 8 items.

• Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
• The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
• \(k\)-attribute-anonymity is hard even for \(k=2\) (Q477690) (← links)
• Pattern-guided \(k\)-anonymity (Q1736590) (← links)
• A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
• The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
• Parameterized Complexity of k-Anonymity: Hardness and Tractability (Q3000512) (← links)
• The Effect of Homogeneity on the Complexity of k-Anonymity (Q3088269) (← links)