{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:46:14Z","timestamp":1742960774834,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319947754"},{"type":"electronic","value":"9783319947761"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94776-1_29","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"341-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An FPT Algorithm for Contraction to Cactus"],"prefix":"10.1007","author":[{"given":"R.","family":"Krithika","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pranabendu","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prafullkumar","family":"Tale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"29_CR1","unstructured":"Agrawal, A., Lokshtanov, D., Saurabh, S., Zehavi, M.: Split contraction: the untold story. In: Symposium on Theoretical Aspects of Computer Science, STACS (2017)"},{"issue":"2","key":"29_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0022-0000(83)90012-0","volume":"26","author":"T Asano","year":"1983","unstructured":"Asano, T., Hirata, T.: Edge-contraction problems. J. Comput. Syst. Sci. 26(2), 197\u2013208 (1983)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/jgt.3190110111","volume":"11","author":"AE Brouwer","year":"1987","unstructured":"Brouwer, A.E., Veldman, H.J.: Contractibility and NP-completeness. J. Graph Theory 11(1), 71\u201379 (1987)","journal-title":"J. Graph Theory"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-03898-8_10","volume-title":"Parameterized and Exact Computation","author":"L Cai","year":"2013","unstructured":"Cai, L., Guo, C.: Contracting few edges to remove forbidden induced subgraphs. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 97\u2013109. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_10"},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"29_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2006","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/978-3-662-53622-3"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2012.12.041","volume":"476","author":"PA Golovach","year":"2013","unstructured":"Golovach, P.A., van \u2019t Hof, P., Paulusma, D.: Obtaining planarity by contracting few edges. Theoret. Comput. Sci. 476, 38\u201346 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2013.02.030","volume":"481","author":"PA Golovach","year":"2013","unstructured":"Golovach, P.A., Kami\u0144ski, M., Paulusma, D., Thilikos, D.M.: Increasing the minimum degree of a graph by contractions. Theoret. Comput. Sci. 481, 74\u201384 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"22\u201324","key":"29_CR9","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1016\/j.ipl.2013.09.004","volume":"113","author":"S Guillemot","year":"2013","unstructured":"Guillemot, S., Marx, D.: A faster FPT algorithm for Bipartite contraction. Inf. Process. Lett. 113(22\u201324), 906\u2013912 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00453-012-9670-2","volume":"68","author":"P Heggernes","year":"2014","unstructured":"Heggernes, P., van \u2019t Hof, P., L\u00e9v\u00eaque, B., Lokshtanov, D., Paul, C.: Contracting graphs to paths and trees. Algorithmica 68(1), 109\u2013132 (2014)","journal-title":"Algorithmica"},{"issue":"4","key":"29_CR11","doi-asserted-by":"publisher","first-page":"2143","DOI":"10.1137\/130907392","volume":"27","author":"P Heggernes","year":"2013","unstructured":"Heggernes, P., van \u2019t Hof, P., Lokshtanov, D., Paul, C.: Obtaining a bipartite graph by contracting few edges. SIAM J. Discret. Math. 27(4), 2143\u20132156 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"29_CR12","unstructured":"Krithika, R., Misra, P., Rai, A., Tale, P.: Lossy kernels for graph contraction problems. In: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, pp. 23:1\u201323:14 (2016)"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-03898-8_21","volume-title":"Parameterized and Exact Computation","author":"D Lokshtanov","year":"2013","unstructured":"Lokshtanov, D., Misra, N., Saurabh, S.: On the hardness of eliminating small induced subgraphs by contracting edges. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 243\u2013254. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_21"},{"issue":"2","key":"29_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0166-218X(81)90039-1","volume":"3","author":"T Watanabe","year":"1981","unstructured":"Watanabe, T., Ae, T., Nakamura, A.: On the removal of forbidden graphs by edge-deletion or by edge-contraction. Discret. Appl. Math. 3(2), 151\u2013153 (1981)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"29_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0166-218X(83)90101-4","volume":"6","author":"T Watanabe","year":"1983","unstructured":"Watanabe, T., Ae, T., Nakamura, A.: On the NP-hardness of edge-deletion and contraction problems. Discret. Appl. Math. 6(1), 63\u201378 (1983)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94776-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:35:38Z","timestamp":1710347738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qing Dao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}