{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:07:47Z","timestamp":1725538067110},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_4","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:05:18Z","timestamp":1252937118000},"page":"26-37","source":"Crossref","is-referenced-by-count":9,"title":["The k-Anonymity Problem Is Hard"],"prefix":"10.1007","author":[{"given":"Paola","family":"Bonizzoni","sequence":"first","affiliation":[]},{"given":"Gianluca","family":"Della Vedova","sequence":"additional","affiliation":[]},{"given":"Riccardo","family":"Dondi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"issue":"1-2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-Completeness Results for Cubic Graphs. Theoretical Computer Science\u00a0237(1-2), 123\u2013134 (2000)","journal-title":"Theoretical Computer Science"},{"key":"4_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/TKDE.2008.129","volume":"21","author":"A. Gionis","year":"2009","unstructured":"Gionis, A., Tassa, T.: k-Anonymization with Minimal Loss of Information. IEEE Trans. Knowl. Data Eng.\u00a021(2), 206\u2013219 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR5","first-page":"67","volume-title":"ACM SIGMOD International Conference on Management of Data","author":"H. Park","year":"2007","unstructured":"Park, H., Shim, K.: Approximate algorithms for k-Anonymity. In: Chan, C.Y., Ooi, B.C., Zhou, A. (eds.) ACM SIGMOD International Conference on Management of Data, pp. 67\u201378. ACM Press, New York (2007)"},{"issue":"6","key":"4_CR6","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P. Samarati","year":"2001","unstructured":"Samarati, P.: Protecting Respondents\u2019 Identities in Microdata Release. IEEE Trans. Knowl. Data Eng.\u00a013(6), 1010\u20131027 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1145\/275487.275508","volume-title":"Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"P. Samarati","year":"1998","unstructured":"Samarati, P., Sweeney, L.: Generalizing Data to Provide Anonymity When Disclosing Information (Abstract). In: Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, p. 188. ACM Press, New York (1998)"},{"issue":"5","key":"4_CR8","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: k-Anonymity: a Model for Protecting Privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems\u00a010(5), 557\u2013570 (2002)","journal-title":"International Journal on Uncertainty, Fuzziness and Knowledge-based Systems"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T19:21:43Z","timestamp":1552159303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}