{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:49:15Z","timestamp":1725738555946},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_52","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T09:09:19Z","timestamp":1372756159000},"page":"594-606","source":"Crossref","is-referenced-by-count":7,"title":["A Refined Complexity Analysis of Degree Anonymization in Graphs"],"prefix":"10.1007","author":[{"given":"Sepp","family":"Hartung","sequence":"first","affiliation":[]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]},{"given":"Ond\u0159ej","family":"Such\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Li, Y., Yu, P.S.: On the hardness of graph anonymization. In: Proc. 11th IEEE ICDM, pp. 1002\u20131007. IEEE (2011)","DOI":"10.1109\/ICDM.2011.112"},{"issue":"3","key":"52_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1798596.1798602","volume":"6","author":"G. Aggarwal","year":"2010","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Khuller, S., Panigrahy, R., Thomas, D., Zhu, A.: Achieving anonymity via clustering. ACM Transactions on Algorithms\u00a06(3), 1\u201319 (2010)","journal-title":"ACM Transactions on Algorithms"},{"key":"52_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-11269-0_2","volume-title":"Parameterized and Exact Computation","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L.: Kernelization: New upper and lower bound techniques. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 17\u201337. Springer, Heidelberg (2009)"},{"key":"52_CR4","unstructured":"Chester, S., Kapron, B.M., Ramesh, G., Srivastava, G., Thomo, A., Venkatesh, S.: k-Anonymization of social networks by vertex addition. In: Proc. 15th ADBIS (2). CEUR Workshop Proceedings, vol.\u00a0789, pp. 107\u2013116 (2011), \n                    \n                      CEUS-WS.org"},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"Chester, S., Gaertner, J., Stege, U., Venkatesh, S.: Anonymizing subsets of social networks with degree constrained subgraphs. In: Proc. ASONAM, pp. 418\u2013422. IEEE Computer Society (2012)","DOI":"10.1109\/ASONAM.2012.74"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"Chester, S., Kapron, B., Srivastava, G., Venkatesh, S.: Complexity of social network anonymization. Social Network Analysis and Mining (2012) (online available)","DOI":"10.1109\/ASONAM.2011.108"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"52_CR8","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"issue":"4","key":"52_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1749603.1749605","volume":"42","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\u00a042(4), 14:1\u201314:53 (2010)","journal-title":"ACM Computing Surveys"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proc. 15th STOC, pp. 448\u2013456. ACM (1983)","DOI":"10.1145\/800061.808776"},{"key":"52_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)"},{"issue":"1","key":"52_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"issue":"1","key":"52_CR13","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jcss.2010.06.009","volume":"77","author":"R.M. Karp","year":"2011","unstructured":"Karp, R.M.: Heuristic algorithms in computational molecular biology. J. Comput. Syst. Sci.\u00a077(1), 122\u2013128 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"52_CR14","first-page":"33","volume":"29","author":"P. Katerinis","year":"2000","unstructured":"Katerinis, P., Tsikopoulos, N.: Minimum degree and f-factors in graphs. New Zealand J. Math.\u00a029(1), 33\u201340 (2000)","journal-title":"New Zealand J. Math."},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Horvitz, E.: Planetary-scale views on a large instant-messaging network. In: Proc. 17th WWW, pp. 915\u2013924. ACM (2008)","DOI":"10.1145\/1367497.1367620"},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: Proc. ACM SIGMOD 2008, pp. 93\u2013106. ACM (2008)","DOI":"10.1145\/1376616.1376629"},{"key":"52_CR17","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Annals of Discrete Mathematics, vol.\u00a029. North-Holland (1986)"},{"key":"52_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-642-32600-4_21","volume-title":"Database and Expert Systems Applications","author":"X. Lu","year":"2012","unstructured":"Lu, X., Song, Y., Bressan, S.: Fast identity anonymization on graphs. In: Liddle, S.W., Schewe, K.-D., Tjoa, A.M., Zhou, X. (eds.) DEXA 2012, Part I. LNCS, vol.\u00a07446, pp. 281\u2013295. Springer, Heidelberg (2012)"},{"issue":"1","key":"52_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.jcss.2011.02.001","volume":"78","author":"L. Mathieson","year":"2012","unstructured":"Mathieson, L., Szeider, S.: Editing graphs to satisfy degree constraints: A parameterized approach. J. Comput. Syst. Sci.\u00a078(1), 179\u2013191 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"52_CR20","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: Proc. 30th IEEE SP, pp. 173\u2013187. IEEE (2009)","DOI":"10.1109\/SP.2009.22"},{"key":"52_CR21","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"52_CR22","unstructured":"Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc.\u00a027th\u00a0STACS. LIPIcs, vol.\u00a05, pp. 17\u201332. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"issue":"1-3","key":"52_CR23","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0166-218X(96)00071-6","volume":"71","author":"C. Phillips","year":"1996","unstructured":"Phillips, C., Warnow, T.J.: The asymmetric median tree\u2014a new model for building consensus trees. Discrete Appl. Math.\u00a071(1-3), 311\u2013335 (1996)","journal-title":"Discrete Appl. Math."},{"key":"52_CR24","doi-asserted-by":"crossref","unstructured":"Sala, A., Zhao, X., Wilson, C., Zheng, H., Zhao, B.Y.: Sharing graphs using differentially private graph models. In: Proc. 11th ACM SIGCOMM, pp. 81\u201398. ACM (2011)","DOI":"10.1145\/2068816.2068825"},{"issue":"1","key":"52_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10115-010-0311-2","volume":"28","author":"B. Zhou","year":"2011","unstructured":"Zhou, B., Pei, J.: The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks. Knowl. Inf. Syst.\u00a028(1), 47\u201377 (2011)","journal-title":"Knowl. Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:21:04Z","timestamp":1557897664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}