{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:19Z","timestamp":1725579019944},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_25","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"242-255","source":"Crossref","is-referenced-by-count":4,"title":["Parameterized Complexity of k-Anonymity: Hardness and Tractability"],"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":[]},{"given":"Yuri","family":"Pirola","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","first-page":"153","volume-title":"PODS","author":"G. Aggarwal","year":"2006","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Khuller, S., Panigrahy, R., Thomas, D., Zhu, A.: Achieving anonymity via clustering. In: Vansummeren, S. (ed.) PODS, pp. 153\u2013162. ACM, New York (2006)"},{"key":"25_CR2","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":"2005","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 (2005)"},{"key":"25_CR3","unstructured":"Aggarwal, G., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Approximation algorithms for k-anonymity. J. Privacy Technology (2005)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-642-14162-1_33","volume-title":"Automata, Languages and Programming","author":"J. Blocki","year":"2010","unstructured":"Blocki, J., Williams, R.: Resolving the complexity of some data privacy problems. In: Abramsky, S., Gavoille, C., Kirchner, C., auf der Heide, F.M., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 393\u2013404. Springer, Heidelberg (2010)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-03409-1_4","volume-title":"Fundamentals of Computation Theory","author":"P. Bonizzoni","year":"2009","unstructured":"Bonizzoni, P., Della Vedova, G., Dondi, R.: The k-anonymity problem is hard. In: Kutylowski, M., Gebala, M., Charatonik, W. (eds.) FCT 2009. LNCS, vol.\u00a05699, pp. 26\u201337. Springer, Heidelberg (2009)"},{"issue":"4","key":"25_CR6","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/s10878-009-9253-6","volume":"18","author":"R. Chaytor","year":"2009","unstructured":"Chaytor, R., Evans, P.A., Wareham, T.: Fixed-parameter tractability of anonymizing data by suppressing entries. J. Comb. Optim.\u00a018(4), 362\u2013375 (2009)","journal-title":"J. Comb. Optim."},{"key":"25_CR7","doi-asserted-by":"publisher","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":"25_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness ii: On completeness for W[1]. Theoretical Computer Science\u00a0141, 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-03367-4_22","volume-title":"Algorithms and Data Structures","author":"W. Du","year":"2009","unstructured":"Du, W., Eppstein, D., Goodrich, M.T., Lueker, G.S.: On the approximability of geometric and geographic generalization and the min-max bin covering problem. In: Dehne, F.K.H.A., Gavrilova, M.L., Sack, J.R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 242\u2013253. Springer, Heidelberg (2009)"},{"issue":"2","key":"25_CR10","first-page":"206","volume":"21","author":"A. Gionis","year":"2009","unstructured":"Gionis, A., Tassa, T.: k-anonymization with minimal loss of information. TKDD\u00a021(2), 206\u2013219 (2009)","journal-title":"TKDD"},{"key":"25_CR11","first-page":"223","volume-title":"PODS","author":"A. Meyerson","year":"2004","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: Deutsch, A. (ed.) PODS, pp. 223\u2013228. ACM, New York (2004)"},{"key":"25_CR12","doi-asserted-by":"publisher","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)"},{"key":"25_CR13","first-page":"67","volume-title":"SIGMOD Conference","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.) SIGMOD Conference, pp. 67\u201378. ACM, New York (2007)"},{"key":"25_CR14","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, 1010\u20131027 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"25_CR15","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/275487.275508","volume-title":"PODS","author":"P. Samarati","year":"1998","unstructured":"Samarati, P., Sweeney, L.: Generalizing data to provide anonymity when disclosing information (abstract). In: PODS, p. 188. ACM, New York (1998)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/11427186_41","volume-title":"Experimental and Efficient Algorithms","author":"J. Schwartz","year":"2005","unstructured":"Schwartz, J., Steger, A., Wei\u00dfl, A.: Fast algorithms for weighted bipartite matching. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 476\u2013487. Springer, Heidelberg (2005)"},{"key":"25_CR17","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, 557\u2013570 (2002)","journal-title":"International Journal on Uncertainty, Fuzziness and Knowledge-based Systems"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:28:16Z","timestamp":1558420096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}