The following pages link to Database Theory - ICDT 2005 (Q5316598):
Displayed 11 items.
- Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- Finding all maximally-matchable edges in a bipartite graph (Q418005) (← links)
- \(k\)-attribute-anonymity is hard even for \(k=2\) (Q477690) (← links)
- Anonymizing binary and small tables is hard to approximate (Q543515) (← links)
- A practical approximation algorithm for optimal \(k\)-anonymity (Q1944983) (← 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)
- On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem (Q3183459) (← links)
- Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries (Q5505640) (← links)