{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:41:17Z","timestamp":1742992877605,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319202969"},{"type":"electronic","value":"9783319202976"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-20297-6_10","type":"book-chapter","created":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T01:55:05Z","timestamp":1434938105000},"page":"143-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Editing to a Planar Graph of Given Degrees"],"prefix":"10.1007","author":[{"given":"Konrad K.","family":"Dabrowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pim","family":"van \u2019t Hof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,23]]},"reference":[{"issue":"7","key":"10_CR1","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00236-014-0204-z","volume":"51","author":"R Belmonte","year":"2014","unstructured":"Belmonte, R., Golovach, P.A., van \u2019t Hof, P., Paulusma, D.: Parameterized complexity of three edge contraction problems with degree constraints. Acta Informatica 51(7), 473\u2013497 (2014)","journal-title":"Acta Informatica"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (meta) kernelization. In: FOCS 2009, pp. 629\u2013638. IEEE Computer Society (2009)","DOI":"10.1109\/FOCS.2009.46"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (meta) kernelization. In: CoRR abs\/0904.0727 (2009)","DOI":"10.1109\/FOCS.2009.46"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/jgt.3190010115","volume":"1","author":"FT Boesch","year":"1977","unstructured":"Boesch, F.T., Suffel, C.L., Tindell, R.: The spanning subgraphs of Eulerian graphs. J. Graph Theory 1(1), 79\u201384 (1977)","journal-title":"J. Graph Theory"},{"issue":"13","key":"10_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":"10_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."},{"issue":"3","key":"10_CR7","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"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00453-012-9667-x","volume":"68","author":"M Cygan","year":"2014","unstructured":"Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M., Schlotter, I.: Parameterized complexity of Eulerian deletion problems. Algorithmica 68(1), 41\u201361 (2014)","journal-title":"Algorithmica"},{"key":"10_CR9","unstructured":"Dabrowski, K.K., Golovach, P.A., van \u2019t Hof, P., Paulusma, D.: Editing to Eulerian graphs. In: FSTTCS 2014. LIPIcs, vol. 29, pp. 97\u2013108. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)"},{"key":"10_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, Texts in Computer Science (2013)"},{"key":"10_CR11","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-Verlag, Berlin (2006)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Linear kernels for (connected) dominating set on H-minor-free graphs. In: SODA 2012, pp. 82\u201393. SIAM (2012)","DOI":"10.1137\/1.9781611973099.7"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-08404-6_17","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"V Froese","year":"2014","unstructured":"Froese, V., Nichterlein, A., Niedermeier, R.: Win-win kernelization for degree sequence completion problems. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 194\u2013205. Springer, Heidelberg (2014)"},{"issue":"4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"10_CR15","unstructured":"Garnero, V., Paul, C., Sau, I., Thilikos, D.M.: Explicit linear kernels via dynamic programming. In: STACS 2014. LIPIcs, vol. 25, pp. 312\u2013324. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)"},{"key":"10_CR16","unstructured":"Garnero, V., Sau, I., Thilikos, D.M.: A linear kernel for planar red-blue dominating set. In: CoRR abs\/1408.6388 (2014)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-662-44465-8_28","volume-title":"Mathematical Foundations of Computer Science 2014","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A.: Editing to a connected graph of given degrees. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 324\u2013335. Springer, Heidelberg (2014)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/978-3-319-13524-3_17","volume-title":"Parameterized and Exact Computation","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A.: Editing to a graph of given degrees. In: Cygan, M., Heggernes, P. (eds.) IPEC 2014. LNCS, vol. 8894, pp. 196\u2013207. Springer, Heidelberg (2014)"},{"issue":"2","key":"10_CR19","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. Theory Comput. Sci. 289(2), 997\u20131008 (2002)","journal-title":"Theory Comput. Sci."},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-39206-1_52","volume-title":"Automata, Languages, and Programming","author":"EJ Kim","year":"2013","unstructured":"Kim, E.J., Langer, A., Paul, C., Reidl, F., Rossmanith, P., Sau, I., Sikdar, S.: Linear kernels and single-exponential algorithms via protrusion decompositions. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 613\u2013624. Springer, Heidelberg (2013)"},{"issue":"2","key":"10_CR21","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":"10_CR22","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":"10_CR23","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"},{"issue":"1","key":"10_CR24","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":"10_CR25","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms, Oxford Lecture Series in Mathematics and its Applications","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms, Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)"},{"issue":"1\u20133","key":"10_CR26","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0012-365X(94)90277-1","volume":"126","author":"IA Stewart","year":"1994","unstructured":"Stewart, I.A.: Deciding whether a planar graph has a cubic subgraph is NP-complete. Discrete Math. 126(1\u20133), 349\u2013357 (1994)","journal-title":"Discrete Math."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: STOC 1978, pp. 253\u2013264. ACM (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Computer Science -- Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20297-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T12:52:48Z","timestamp":1675860768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20297-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319202969","9783319202976"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20297-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"23 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}