{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:13Z","timestamp":1725516613757},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_3","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"23-31","source":"Crossref","is-referenced-by-count":1,"title":["Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries"],"prefix":"10.1007","author":[{"given":"Rhonda","family":"Chaytor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patricia A.","family":"Evans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Todd","family":"Wareham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-540-30570-5_17","volume-title":"Database Theory - ICDT 2005","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Anonymizing tables. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 246\u2013258. Springer, Heidelberg (2004)"},{"key":"3_CR2","unstructured":"Chaytor, R.: Utility Preserving k-Anonymity. Technical Report MUN-CS 2006-01, Dept.Computer Science, Memorial University of Newfoundland (2006)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-540-78478-4_3","volume-title":"PinKDD 2007","author":"R. Chaytor","year":"2008","unstructured":"Chaytor, R.: Allowing Privacy Protection Algorithms to Jump out of Local Optimums: An Ordered Greed Framework. In: Bonchi, F., et al. (eds.) PinKDD 2007. LNCS, vol.\u00a04890, pp. 33\u201355. Springer, Heidelberg (2008)"},{"key":"3_CR4","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.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"3_CR5","unstructured":"MacDonald, D.: Personal Communication (2005)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: Proc. of 23rd ACM Sym. on Principles of Database Systems (PODS 2004), pp. 223\u2013228 (2004)","DOI":"10.1145\/1055558.1055591"},{"key":"3_CR7","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.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"5","key":"3_CR8","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: Achieving k-anonymity privacy protection using generalization and suppression. Int\u2019l J. on Uncertainty, Fuzziness and Knowledge-Based Systems\u00a010(5), 571\u2013588 (2002)","journal-title":"Int\u2019l J. on Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"3_CR9","unstructured":"Wang, K., Yu, P., Chakraborty, S.: Bottom-up generalization: a data mining solution to privacy protection. In: ICDM 2004, pp. 249\u2013256 (2004)"},{"key":"3_CR10","unstructured":"Wareham, T.: Systematic Parameterized Complexity Analysis in Computational Phonology. Ph.D.thesis, Dept.Computer Science, University of Victoria (1999)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:41:03Z","timestamp":1619523663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}