{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:07Z","timestamp":1759638307407},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079554"},{"type":"electronic","value":"9783319079561"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07956-1_5","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:47:17Z","timestamp":1402418837000},"page":"44-55","source":"Crossref","is-referenced-by-count":6,"title":["The Complexity of Degree Anonymization by Vertex Addition"],"prefix":"10.1007","author":[{"given":"Robert","family":"Bredereck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Froese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sepp","family":"Hartung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-45030-3_15","volume-title":"Algorithms and Computation","author":"R. Bredereck","year":"2013","unstructured":"Bredereck, R., Hartung, S., Nichterlein, A., Woeginger, G.J.: The complexity of finding a large subgraph under anonymity constraints. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol.\u00a08283, pp. 152\u2013162. Springer, Heidelberg (2013)"},{"doi-asserted-by":"crossref","unstructured":"Casas-Roma, J., Herrera-Joancomart\u00ed, J., Torra, V.: An algorithm for k-degree anonymity on large networks. In: Proc. ASONAM 2013, pp. 671\u2013675. ACM Press (2013)","key":"5_CR2","DOI":"10.1145\/2492517.2492643"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s13278-012-0084-6","volume":"3","author":"S. Chester","year":"2013","unstructured":"Chester, S., Kapron, B.M., Ramesh, G., Srivastava, G., Thomo, A., Venkatesh, S.: Why Waldo befriended the dummy? k-anonymization of social networks with pseudo-nodes. Social Netw. Analys. Mining\u00a03(3), 381\u2013399 (2013)","journal-title":"Social Netw. Analys. Mining"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s13278-012-0059-7","volume":"3","author":"S. Chester","year":"2013","unstructured":"Chester, S., Kapron, B.M., Srivastava, G., Venkatesh, S.: Complexity of social network anonymization. Social Netw. Analys. Mining\u00a03(2), 151\u2013166 (2013)","journal-title":"Social Netw. Analys. Mining"},{"doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Liu, K., Terzi, E.: Towards identity anonymization in social networks. In: Link Mining: Models, Algorithms, and Applications, pp. 359\u2013385. Springer (2010)","key":"5_CR5","DOI":"10.1007\/978-1-4419-6515-8_14"},{"doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer (2013)","key":"5_CR6","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.2307\/2312837","volume":"70","author":"P. Erd\u0151s","year":"1963","unstructured":"Erd\u0151s, P., Kelly, P.: The minimal regular graph containing a given graph. Amer. Math. Monthly\u00a070, 1074\u20131075 (1963)","journal-title":"Amer. Math. Monthly"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.ejc.2012.04.008","volume":"34","author":"M.R. Fellows","year":"2013","unstructured":"Fellows, M.R., Jansen, B.M.P., Rosamond, F.A.: Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. Eur. J. Combin.\u00a034(3), 541\u2013566 (2013)","journal-title":"Eur. J. Combin."},{"unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)","key":"5_CR9"},{"doi-asserted-by":"crossref","unstructured":"Hartung, S., Nichterlein, A., Niedermeier, R., Such\u00fd, O.: A refined complexity analysis of degree anonymization in graphs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 594\u2013606. Springer, Heidelberg (2013); To appear in Information and Computation","key":"5_CR10","DOI":"10.1007\/978-3-642-39212-2_52"},{"key":"5_CR11","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. Math. Oper. Res.\u00a08, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: ACM SIGMOD Conference, SIGMOD 2008, pp. 93\u2013106. ACM (2008)","key":"5_CR12","DOI":"10.1145\/1376616.1376629"},{"unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Annals of Discrete Mathematics, vol.\u00a029. North-Holland (1986)","key":"5_CR13"},{"key":"5_CR14","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)"},{"unstructured":"Lueker, G.S.: Two NP-complete problems in nonnegative integer programming. Technical report. Computer Science Laboratory, Princeton University (1975)","key":"5_CR15"},{"doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","key":"5_CR16","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"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)","key":"5_CR17"},{"issue":"1","key":"5_CR18","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","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07956-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T01:50:10Z","timestamp":1558921810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07956-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079554","9783319079561"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07956-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}