{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T22:37:59Z","timestamp":1717195079785},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T00:00:00Z","timestamp":1321401600000},"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":[[2013,7]]},"DOI":"10.1007\/s10878-011-9428-9","type":"journal-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T14:03:48Z","timestamp":1321452228000},"page":"19-43","source":"Crossref","is-referenced-by-count":3,"title":["Parameterized complexity of k-anonymity: hardness and tractability"],"prefix":"10.1007","volume":"26","author":[{"given":"Paola","family":"Bonizzoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Della\u00a0Vedova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Dondi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Pirola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,16]]},"reference":[{"key":"9428_CR1","series-title":"Lecture Notes in Computer Science","first-page":"246","volume-title":"ICDT","author":"G Aggarwal","year":"2005","unstructured":"Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A (2005) Anonymizing tables. In: Eiter T, Libkin L (eds) ICDT. Lecture Notes in Computer Science, vol 3363. Springer, Berlin, pp 246\u2013258"},{"key":"9428_CR2","unstructured":"Aggarwal G, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A (2005) Approximation algorithms for k-anonymity. J Priv Technol"},{"key":"9428_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal G, Panigrahy R, Feder T, Thomas D, Kenthapadi K, Khuller S, Zhu A (2010) Achieving anonymity via clustering. ACM Trans Algorithms 6(3)","DOI":"10.1145\/1798596.1798602"},{"issue":"1\u20132","key":"9428_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti P, Kann V (2000) Some APX-completeness results for cubic graphs. Theor Comput Sci 237(1\u20132):123\u2013134","journal-title":"Theor Comput Sci"},{"issue":"4","key":"9428_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(91)90195-N","volume":"37","author":"H Alt","year":"1991","unstructured":"Alt H, Blum N, Mehlhorn K, Paul M (1991) Computing a maximum cardinality matching in a bipartite graph in time $o(n^{1}0.5 \\sqrt{m}\/\\log n)$ . Inf Process Lett 37(4):237\u2013240","journal-title":"Inf Process Lett"},{"key":"9428_CR6","doi-asserted-by":"crossref","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 (1999) Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer, Berlin"},{"key":"9428_CR7","series-title":"LNCS","first-page":"393","volume-title":"Automata, languages and programming. 37th international colloquium, ICALP 2010, Proceedings of Part II","author":"J Blocki","year":"2010","unstructured":"Blocki J, Williams R (2010) Resolving the complexity of some data privacy problems. In: Abramsky S, Gavoille C, Kirchner C, auf\u00a0der Heide FM, Spirakis PG (eds) Automata, languages and programming. 37th international colloquium, ICALP 2010, Proceedings of Part II, Bordeaux, France, July 6\u201310, 2010, LNCS, vol 6199. Springer, Berlin, pp 393\u2013404"},{"issue":"1","key":"9428_CR8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10878-009-9277-y","volume":"22","author":"P Bonizzoni","year":"2011","unstructured":"Bonizzoni P, Della Vedova G, Dondi R (2011) Anonymizing binary and small tables is hard to approximate. J Comb Optim 22(1):97\u2013119","journal-title":"J Comb Optim"},{"key":"9428_CR9","series-title":"Graduate texts in mathematics","volume-title":"Graph theory","author":"R Diestel","year":"2005","unstructured":"Diestel R (2005) Graph theory. Graduate texts in mathematics, vol 173, 3rd edn. Springer, Heidelberg","edition":"3"},{"issue":"1&2","key":"9428_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey RG, Fellows MR (1995) Fixed-parameter tractability and completeness ii: on completeness for W[1]. Theor Comput Sci 141(1&2):109\u2013131","journal-title":"Theor Comput Sci"},{"key":"9428_CR11","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":"9428_CR12","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/978-3-642-03367-4_22","volume-title":"WADS","author":"W Du","year":"2009","unstructured":"Du W, Eppstein D, Goodrich MT, Lueker GS (2009) On the approximability of geometric and geographic generalization and the min-max bin covering problem. In: Dehne FKHA, Gavrilova ML, Sack JR, T\u00f3th CD (eds) WADS. Lecture notes in computer science, vol 5664. Springer, Berlin, pp 242\u2013253"},{"issue":"4","key":"9428_CR13","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/s10878-009-9253-6","volume":"18","author":"PA Evans","year":"2009","unstructured":"Evans PA, Wareham T, Chaytor R (2009) Fixed-parameter tractability of anonymizing data by suppressing entries. J Comb Optim 18(4):362\u2013375","journal-title":"J Comb Optim"},{"key":"9428_CR14","unstructured":"Frank A, Asuncion A (2010) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"issue":"2","key":"9428_CR15","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1109\/TKDE.2008.129","volume":"21","author":"A Gionis","year":"2009","unstructured":"Gionis A, Tassa T (2009) k-anonymization with minimal loss of information. IEEE Trans Knowl Data Eng 21(2):206\u2013219","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9428_CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/1055558.1055591","volume-title":"PODS","author":"A Meyerson","year":"2004","unstructured":"Meyerson A, Williams R (2004) On the complexity of optimal k-anonymity. In: Deutsch A (ed) PODS. ACM, New York, pp 223\u2013228"},{"key":"9428_CR17","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, London"},{"issue":"8","key":"9428_CR18","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1016\/j.is.2010.06.002","volume":"35","author":"H Park","year":"2010","unstructured":"Park H, Shim K (2010) Approximate algorithms with generalizing attribute values for k-anonymity. Inf Syst 35(8):933\u2013955","journal-title":"Inf Syst"},{"issue":"6","key":"9428_CR19","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P Samarati","year":"2001","unstructured":"Samarati P (2001) Protecting respondents\u2019 identities in microdata release. IEEE Trans Knowl Data Eng 13(6):1010\u20131027","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9428_CR20","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 (1998) Generalizing data to provide anonymity when disclosing information (abstract). In: PODS. ACM, New York, p 188"},{"issue":"5","key":"9428_CR21","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) k-anonymity: a model for protecting privacy. Int J Uncertain Fuzziness Knowl-Based Syst 10(5):557\u2013570","journal-title":"Int J Uncertain Fuzziness Knowl-Based Syst"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9428-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9428-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9428-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T16:36:52Z","timestamp":1560962212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9428-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,16]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9428"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9428-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,16]]}}}