{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:53:07Z","timestamp":1725583987118},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_35","type":"book-chapter","created":{"date-parts":[[2013,5,20]],"date-time":"2013-05-20T20:43:48Z","timestamp":1369082628000},"page":"350-361","source":"Crossref","is-referenced-by-count":2,"title":["Pattern-Guided k-Anonymity"],"prefix":"10.1007","author":[{"given":"Robert","family":"Bredereck","sequence":"first","affiliation":[]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","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., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 393\u2013404. Springer, Heidelberg (2010)"},{"issue":"1","key":"35_CR2","doi-asserted-by":"publisher","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.: Anonymizing binary and small tables is hard to approximate. Journal of Combinatorial Optimization\u00a022(1), 97\u2013119 (2011)","journal-title":"Journal of Combinatorial Optimization"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Bonizzoni, P., Della Vedova, G., Dondi, R., Pirola, Y.: Parameterized complexity of k-anonymity: hardness and tractability. Journal of Combinatorial Optimization (2011)","DOI":"10.1007\/978-3-642-19222-7_25"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-22993-0_19","volume-title":"Mathematical Foundations of Computer Science 2011","author":"R. Bredereck","year":"2011","unstructured":"Bredereck, R., Nichterlein, A., Niedermeier, R., Philip, G.: Pattern-guided data anonymization and clustering. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 182\u2013193. Springer, Heidelberg (2011)"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Nichterlein, A., Niedermeier, R., Philip, G.: The effect of homogeneity on the computational complexity of combinatorial data anonymization. In: Data Mining and Knowledge Discovery (2012)","DOI":"10.1007\/s10618-012-0293-7"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-01718-6_4","volume-title":"Privacy, Security, and Trust in KDD","author":"A. Campan","year":"2009","unstructured":"Campan, A., Truta, T.M.: Data and structural k-anonymity in social networks. In: Bonchi, F., Ferrari, E., Jiang, W., Malin, B. (eds.) PinKDD 2008. LNCS, vol.\u00a05456, pp. 33\u201354. Springer, Heidelberg (2009)"},{"key":"35_CR7","unstructured":"Chakaravarthy, V.T., Pandit, V., Sabharwal, Y.: On the complexity of the k-anonymization problem. CoRR, abs\/1004.4729 (2010)"},{"issue":"1","key":"35_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1866739.1866758","volume":"54","author":"C. Dwork","year":"2011","unstructured":"Dwork, C.: A firm foundation for private data analysis. Communications of the ACM\u00a054(1), 86\u201395 (2011)","journal-title":"Communications of the ACM"},{"issue":"4","key":"35_CR9","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/s10878-009-9253-6","volume":"18","author":"P.A. Evans","year":"2009","unstructured":"Evans, P.A., Wareham, T., Chaytor, R.: Fixed-parameter tractability of anonymizing data by suppressing entries. Journal of Combinatorial Optimization\u00a018(4), 362\u2013375 (2009)","journal-title":"Journal of Combinatorial Optimization"},{"key":"35_CR10","unstructured":"Frank, A., Asuncion, A.: UCI machine learning repository(2010), \n                    \n                      http:\/\/archive.ics.uci.edu\/ml"},{"issue":"9","key":"35_CR11","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie memory. Communications of the ACM\u00a03(9), 490\u2013499 (1960)","journal-title":"Communications of the ACM"},{"issue":"2","key":"35_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1749603.1749605","volume":"14","author":"B.C.M. Fung","year":"2010","unstructured":"Fung, B.C.M., Wang, K., Chen, R., Yu, P.S.: Privacy-preserving data publishing: A survey of recent developments. ACM Computing Surveys\u00a014(2) 14:1\u201314:53 (2010)","journal-title":"ACM Computing Surveys"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1882471.1882473","volume":"12","author":"A. Gkoulalas-Divanis","year":"2010","unstructured":"Gkoulalas-Divanis, A., Kalnis, P., Verykios, V.S.: Providing k-anonymity in location based services. ACM SIGKDD Explorations Newsletter\u00a012, 3\u201310 (2010)","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D., Ramakrishnan, R.: Mondrian multidimensional k-anonymity. In: Proceedings of the 22nd International Conference on Data Engineering (ICDE 2006), pp. 25\u201325. IEEE (2006)","DOI":"10.1109\/ICDE.2006.101"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research\u00a08, 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., Venkatasubramanian, S.: t-closeness: Privacy beyond k-anonymity and l-diversity. In: Proceedings of the 23rd International Conference on Data Engineering (ICDE 2007), pp. 106\u2013115. IEEE (2007)","DOI":"10.1109\/ICDE.2007.367856"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Loukides, G., Shao, J.: Capturing data usefulness and privacy protection in k-anonymisation. In: Proceedings of the 2007 ACM Symposium on Applied Computing, pp. 370\u2013374. ACM (2007)","DOI":"10.1145\/1244002.1244091"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Kifer, D., Gehrke, J., Venkitasubramaniam, M.: \u2113-diversity: Privacy beyond k-anonymity. ACM Transactions on Knowledge Discovery from Data\u00a01(1) (2007)","DOI":"10.1145\/1217299.1217302"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2004), pp. 223\u2013228. ACM (2004)","DOI":"10.1145\/1055558.1055591"},{"issue":"3","key":"35_CR21","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.ipm.2011.01.004","volume":"48","author":"G. Navarro-Arribas","year":"2012","unstructured":"Navarro-Arribas, G., Torra, V., Erola, A., Castell\u00e0-Roca, J.: User k-anonymity for privacy preserving data mining of query logs. Information Processing & Management\u00a048(3), 476\u2013487 (2012)","journal-title":"Information Processing & Management"},{"key":"35_CR22","unstructured":"Rastogi, V., Suciu, D., Hong, S.: The boundary between privacy and utility in data publishing. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 531\u2013542. VLDB Endowment (2007)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:48:35Z","timestamp":1557704915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}