{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:47:21Z","timestamp":1743065241789,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031754081"},{"type":"electronic","value":"9783031754098"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-75409-8_26","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:39Z","timestamp":1737497439000},"page":"374-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting Path Contraction and\u00a0Cycle Contraction"],"prefix":"10.1007","author":[{"given":"R.","family":"Krithika","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. K. Kutty","family":"Malu","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":[[2025,1,22]]},"reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/19M1259638","volume":"34","author":"A Agrawal","year":"2020","unstructured":"Agrawal, A., Fomin, F.V., Lokshtanov, D., Saurabh, S., Tale, P.: Path contraction faster than 2$$ ^{\\text{ n }}$$. SIAM J. Discret. Math. 34(2), 1302\u20131325 (2020). https:\/\/doi.org\/10.1137\/19M1259638","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"26_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). https:\/\/doi.org\/10.1016\/0022-0000(83)90012-0","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR3","doi-asserted-by":"publisher","unstructured":"Belmonte, R., Golovach, P.A., van\u00a0\u2019t Hof, P., Paulusma, D.: Parameterized complexity of three edge contraction problems with degree constraints. Acta Informatica 51(7), 473\u2013497 (2014). https:\/\/doi.org\/10.1007\/s00236-014-0204-z","DOI":"10.1007\/s00236-014-0204-z"},{"issue":"1","key":"26_CR4","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). https:\/\/doi.org\/10.1002\/jgt.3190110111","journal-title":"J. Graph Theory"},{"key":"26_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"26_CR6","series-title":"Graduate texts in mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate texts in mathematics, vol. 173, 4th edn. Springer, Berlin (2012)","edition":"4"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/S00493-012-2536-Z","volume":"32","author":"FV Fomin","year":"2012","unstructured":"Fomin, F.V., Villanger, Y.: Treewidth computation and extremal combinatorics. Combinatorica 32(3), 289\u2013308 (2012). https:\/\/doi.org\/10.1007\/S00493-012-2536-Z","journal-title":"Combinatorica"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1002\/(SICI)1097-0118(199910)32:2<160::AID-JGT6>3.0.CO;2-U","volume":"32","author":"RH Hammack","year":"1999","unstructured":"Hammack, R.H.: Cyclicity of graphs. J. Graph Theory 32(2), 160\u2013170 (1999). https:\/\/doi.org\/10.1002\/(SICI)1097-0118(199910)32:2<160::AID-JGT6>3.0.CO;2-U","journal-title":"J. Graph Theory"},{"key":"26_CR9","unstructured":"Hammack, R.H.: A note on the complexity of computing cyclicity. Ars Comb. 63 (2002)"},{"key":"26_CR10","doi-asserted-by":"publisher","unstructured":"Heggernes, P., van\u00a0\u2019t Hof, P., L\u00e9v\u00eaque, B., Lokshtanov, D., Paul, C.: Contracting graphs to paths and trees. Algorithmica 68(1), 109\u2013132 (2014). https:\/\/doi.org\/10.1007\/s00453-012-9670-2","DOI":"10.1007\/s00453-012-9670-2"},{"key":"26_CR11","doi-asserted-by":"publisher","unstructured":"Heggernes, P., van\u00a0\u2019t Hof, P., L\u00e9v\u00eaque, B., Paul, C.: Contracting chordal graphs and bipartite graphs to paths and trees. Discret. Appl. Math. 164, 444\u2013449 (2014). https:\/\/doi.org\/10.1016\/j.dam.2013.02.025","DOI":"10.1016\/j.dam.2013.02.025"},{"key":"26_CR12","doi-asserted-by":"publisher","unstructured":"van\u00a0\u2019t Hof, P., Paulusma, D., Woeginger, G.J.: Partitioning graphs into connected parts. Theor. Comput. Sci. 410(47-49), 4834\u20134843 (2009). https:\/\/doi.org\/10.1016\/J.TCS.2009.06.028","DOI":"10.1016\/J.TCS.2009.06.028"},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Li, W., Feng, Q., Chen, J., Hu, S.: Improved kernel results for some fpt problems based on simple observations. Theor. Comput. Sci. 657, 20\u201327 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2016.06.012, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397516302481. frontiers of Algorithmics","DOI":"10.1016\/j.tcs.2016.06.012"},{"key":"26_CR14","doi-asserted-by":"publisher","unstructured":"Saurabh, S., dos Santos\u00a0Souza, U., Tale, P.: On the parameterized complexity of grid contraction. In: 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT. LIPIcs, vol.\u00a0162, pp. 1\u201317 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2020.34","DOI":"10.4230\/LIPIcs.SWAT.2020.34"},{"key":"26_CR15","doi-asserted-by":"publisher","unstructured":"Sheng, B., Sun, Y.: An improved linear kernel for the cycle contraction problem. Inf. Process. Lett. 149, 14\u201318 (2019). https:\/\/doi.org\/10.1016\/j.ipl.2019.05.003, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019019300912","DOI":"10.1016\/j.ipl.2019.05.003"},{"key":"26_CR16","doi-asserted-by":"publisher","unstructured":"Williams, R., Yu, H.: Finding orthogonal vectors in discrete structures. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5-7 January 2014, pp. 1867\u20131877. SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.135","DOI":"10.1137\/1.9781611973402.135"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75409-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:41Z","timestamp":1737497441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}