Author:
Hartung Sepp,Nichterlein André,Niedermeier Rolf,Suchý Ondřej
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference44 articles.
1. On the hardness of graph anonymization;Aggarwal,2011
2. Achieving anonymity via clustering;Aggarwal;ACM Trans. Algorithms,2010
3. Parameterized inapproximability of degree anonymization;Bazgan,2014
4. New upper and lower bound techniques;Kernelization,2009
5. Anonymizing binary and small tables is hard to approximate;Bonizzoni;J. Comb. Optim.,2011
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献