{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T22:32:01Z","timestamp":1717194721647},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,8,18]],"date-time":"2009-08-18T00:00:00Z","timestamp":1250553600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s10878-009-9253-6","type":"journal-article","created":{"date-parts":[[2009,8,17]],"date-time":"2009-08-17T16:55:06Z","timestamp":1250528106000},"page":"362-375","source":"Crossref","is-referenced-by-count":13,"title":["Fixed-parameter tractability of anonymizing data by\u00a0suppressing entries"],"prefix":"10.1007","volume":"18","author":[{"given":"Patricia A.","family":"Evans","sequence":"first","affiliation":[]},{"given":"H. Todd","family":"Wareham","sequence":"additional","affiliation":[]},{"given":"Rhonda","family":"Chaytor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,18]]},"reference":[{"key":"9253_CR1","unstructured":"Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A (2005) Approximation algorithms for k-anonymity. J Priv Technol, paper 20051120001"},{"key":"9253_CR2","unstructured":"Brankovic L, Estivill-Castro V (1999) Privacy issues in knowledge discovery and data mining. In: Proceedings of Australian institute of computer ethics conference (AICEC99), pp\u00a089\u201399"},{"key":"9253_CR3","first-page":"144","volume-title":"Proceedings of the ninth international conference on scientific and statistical database management (SSDBM 1997)","author":"L Brankovic","year":"1997","unstructured":"Brankovic L, Miller M, Horak P, Wrightson G (1997) Usability of compromise-free statistical databases. In: Proceedings of the ninth international conference on scientific and statistical database management (SSDBM 1997). IEEE Press, New York, pp 144\u2013154"},{"key":"9253_CR4","unstructured":"Bonizzoni P, Della Vedova G, Dondi R (2007) Anonymizing binary tables is APX-hard. The Computing Research Repository (CoRR) 0707.0421 . http:\/\/arxiv.org\/abs\/0707.0421"},{"key":"9253_CR5","unstructured":"Chaytor R (2006) Utility preserving k-anonymity. Technical report MUN-CS 2006-01, Dept Computer Science, Memorial University of Newfoundland"},{"key":"9253_CR6","series-title":"LNCS","first-page":"33","volume-title":"Proceedings of the 1st SIGKDD international workshop on privacy, security, and trust in KDD (PinKDD\u201907)","author":"R Chaytor","year":"2007","unstructured":"Chaytor R (2007) Allowing privacy protection algorithms to jump out of local optimums: an ordered greed framework. In: Bonchi F et al. (eds) Proceedings of the 1st SIGKDD international workshop on privacy, security, and trust in KDD (PinKDD\u201907). LNCS, vol 4890. Springer, Berlin, pp 33\u201355"},{"key":"9253_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R Downey","year":"1999","unstructured":"Downey R, Fellows M (1999) Parameterized complexity. Springer, Berlin"},{"key":"9253_CR8","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1093\/comjnl\/31.3.283","volume":"31","author":"MC Er","year":"1988","unstructured":"Er MC (1988) A fast algorithm for generating set partitions. Comput J 31:283\u2013284","journal-title":"Comput J"},{"key":"9253_CR9","first-page":"273","volume":"29","author":"H Fernau","year":"2004","unstructured":"Fernau H (2004) Complexity of a {0,1}-matrix problem. Australasian J Comb 29:273\u2013300","journal-title":"Australasian J Comb"},{"key":"9253_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0166-218X(98)00122-X","volume":"91","author":"P Horak","year":"1999","unstructured":"Horak P, Brankovic L, Miller M (1999) A combinatorial problem in database security. Discrete Appl Math 91:119\u2013126","journal-title":"Discrete Appl Math"},{"key":"9253_CR11","unstructured":"Islam MZ, Brankovic L (2004) A framework for privacy preserving classification in data mining. In: Proceedings of the second workshop on Australasian information security, data mining and web intelligence, and software internationalisation (ACSW Frontiers 2004), pp\u00a0163\u2013168"},{"key":"9253_CR12","unstructured":"MacDonald (2005) personal communication"},{"key":"9253_CR13","doi-asserted-by":"crossref","unstructured":"Meyerson A, Williams R (2004) On the complexity of optimal k-anonymity. In: Proceedings of 23rd ACM symposium on principles of database systems (PODS\u201904), pp\u00a0223\u2013228","DOI":"10.1145\/1055558.1055591"},{"key":"9253_CR14","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier R (2006) Invitation to fixed-parameter algorithms. Oxford University Press, Oxford"},{"key":"9253_CR15","unstructured":"Samarati P, Sweeney L (1998) Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical report SRI-CSL-98-04, SRI International, Computer Science Laboratory"},{"issue":"5","key":"9253_CR16","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) Achieving k-anonymity privacy protection using generalization and suppression. Int J Uncertain Fuzziness Knowl-Based Syst 10(5):571\u2013588","journal-title":"Int J Uncertain Fuzziness Knowl-Based Syst"},{"key":"9253_CR17","doi-asserted-by":"crossref","unstructured":"Wang K, Yu P, Chakraborty S (2004) Bottom-up generalization: a data mining solution to privacy protection. In: Proceedings of 4th IEEE international conference on data mining (ICDM\u201904), pp\u00a0249\u2013256","DOI":"10.1109\/ICDM.2004.10110"},{"key":"9253_CR18","unstructured":"Wareham T (1999) Systematic parameterized complexity analysis in computational phonology. PhD thesis, Dept Computer Science, University of Victoria"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9253-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9253-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9253-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:14Z","timestamp":1559261894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9253-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,18]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9253"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9253-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,18]]}}}