{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T23:10:07Z","timestamp":1747177807649,"version":"3.40.5"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135236"},{"type":"electronic","value":"9783319135243"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13524-3_17","type":"book-chapter","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T17:51:38Z","timestamp":1417542698000},"page":"196-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Editing to a Graph of Given Degrees"],"prefix":"10.1007","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Shapira, A., Sudakov, B.: Additive approximation for edge-deletion problems. In: FOCS, pp. 419\u2013428. IEEE Computer Society (2005)","DOI":"10.1007\/11786986_1"},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"key":"17_CR3","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: a new technique for kernelization lower bounds. In: STACS. LIPIcs, vol. 9, pp. 165\u2013176. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"17_CR4","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. CoRR abs\/1206.5941 (2012)"},{"issue":"13","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1016\/j.dam.2006.03.031","volume":"154","author":"P Burzyn","year":"2006","unstructured":"Burzyn, P., Bonomo, F., Dur\u00e1n, G.: NP-completeness results for edge modification problems. Discrete Appl. Math. 154(13), 1824\u20131844 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/11847250_22","volume-title":"Parameterized and Exact Computation","author":"L Cai","year":"2006","unstructured":"Cai, L., Chan, S.M., Chan, S.O.: Random separation: a new method for solving fixed-cardinality optimization problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 239\u2013250. Springer, Heidelberg (2006)"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.jda.2011.03.004","volume":"9","author":"L Cai","year":"2011","unstructured":"Cai, L., Yang, B.: Parameterized complexity of even\/odd subgraph problems. J. Discrete Algorithms 9(3), 231\u2013240 (2011)","journal-title":"J. Discrete Algorithms"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-25870-1_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Cygan","year":"2011","unstructured":"Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M., Schlotter, I.: Parameterized complexity of Eulerian deletion problems. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 131\u2013142. Springer, Heidelberg (2011)"},{"key":"17_CR10","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Froese, V., Nichterlein, A., Niedermeier, R.: Win-win kernelization for degree sequence completion problems. CoRR abs\/1404.5432 (2014)","DOI":"10.1007\/978-3-319-08404-6_17"},{"key":"17_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"17_CR13","unstructured":"Golovach, P.A.: Editing to a connected graph of given degrees. CoRR abs\/1308.1802 (2013)"},{"key":"17_CR14","unstructured":"Golovach, P.A.: Editing to a graph of given degrees. CoRR abs\/1311.4768 (2013)"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1016\/S0304-3975(01)00414-5","volume":"289","author":"S Khot","year":"2002","unstructured":"Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. 289(2), 997\u20131008 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is np-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"17_CR17","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. 78(1), 179\u2013191 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jda.2008.09.005","volume":"7","author":"H Moser","year":"2009","unstructured":"Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. J. Discrete Algorithms 7(2), 181\u2013190 (2009)","journal-title":"J. Discrete Algorithms"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L., Srinivasan, A.: Splitters and near-optimal derandomization. In: 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 182\u2013191. IEEE (1995)","DOI":"10.1109\/SFCS.1995.492475"},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math. 113(1), 109\u2013128 (2001)","journal-title":"Discrete Appl. Math."},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms, Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press, Oxford (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.003.0001"},{"issue":"6","key":"17_CR22","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1017\/S0960129500070079","volume":"6","author":"D Seese","year":"1996","unstructured":"Seese, D.: Linear time computable problems and first-order descriptions. Math. Struct. Comput. Sci. 6(6), 505\u2013526 (1996)","journal-title":"Math. Struct. Comput. Sci."},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A.V. (eds.) STOC, pp. 253\u2013264. ACM (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13524-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:34:32Z","timestamp":1747175672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13524-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135236","9783319135243"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13524-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"3 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}