{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:40:51Z","timestamp":1762908051258,"version":"3.45.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031929342"},{"type":"electronic","value":"9783031929359"}],"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-92935-9_15","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:07:13Z","timestamp":1747454833000},"page":"233-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Complexity of\u00a0Disconnected Matchings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1255-8266","authenticated-orcid":false,"given":"Sushmita","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8900-9797","authenticated-orcid":false,"given":"Pallavi","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawqueen","family":"Kanesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sounak","family":"Modak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7847-6402","authenticated-orcid":false,"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Baste, J., Rautenbach, D.: Degenerate matchings and edge colorings. Discret. Appl. Math. 239, 38\u201344 (2018). https:\/\/doi.org\/10.1016\/j.dam.2018.01.002. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X18300131","DOI":"10.1016\/j.dam.2018.01.002"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets m\u00f6bius: fast subset convolution. In: Johnson, D.S., Feige, U. (eds.) Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, 11\u201313 June 2007, pp. 67\u201374. ACM (2007). https:\/\/doi.org\/10.1145\/1250790.1250801","DOI":"10.1145\/1250790.1250801"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discret. Math. 28(1), 277\u2013305 (2014)","DOI":"10.1137\/120880240"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Cameron, K.: Induced matchings. Discret. Appl. Math. 24(1), 97\u2013102 (1989). https:\/\/doi.org\/10.1016\/0166-218X(92)90275-F. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0166218X9290275F","DOI":"10.1016\/0166-218X(92)90275-F"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Chaudhary, J., Zehavi, M.: P-matchings parameterized by treewidth. In: Paulusma, D., Ries, B. (eds.) WG 2023. Lecture Notes in Computer Science, vol. 14093, pp. 217\u2013231 (2023)","DOI":"10.1007\/978-3-031-43380-1_16"},{"key":"15_CR6","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":"15_CR7","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. GTM, vol. 173. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Cham (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"15_CR9","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Cham (2006)"},{"key":"15_CR10","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. TTCSAES, Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T., Laskar, R.: Generalized subgraph-restricted matchings in graphs. Discret. Math. 293(1), 129\u2013138 (2005). 19th British Combinatorial Conference. https:\/\/doi.org\/10.1016\/j.disc.2004.08.027. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0012365X05000580","DOI":"10.1016\/j.disc.2004.08.027"},{"issue":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00453-001-0004-z","volume":"31","author":"MC Golumbic","year":"2001","unstructured":"Golumbic, M.C., Hirst, T., Lewenstein, M.: Uniquely restricted matchings. Algorithmica 31(2), 139\u2013154 (2001). https:\/\/doi.org\/10.1007\/s00453-001-0004-z","journal-title":"Algorithmica"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Gomes, G.C.M., Masquio, B.P., Pinto, P.E.D., dos Santos, V.F., Szwarcfiter, J.L.: Disconnected matchings. Theor. Comput. Sci. 956, 113821 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2023.113821","DOI":"10.1016\/j.tcs.2023.113821"},{"key":"15_CR14","unstructured":"Harris, D.G., Narayanaswamy, N.S.: A faster algorithm for vertex cover parameterized by solution size. In: 41st International Symposium on Theoretical Aspects of Computer Science (2024)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An o (v$$|$$ v$$|$$ c$$|$$ e$$|$$) algorithm for finding maximum matching in general graphs. In: 21st Annual Symposium on Foundations of Computer Science (SFCS 1980), pp. 17\u201327. IEEE (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Moser, H., Sikdar, S.: The parameterized complexity of the induced matching problem. Discret. Appl. Math. 157(4), 715\u2013727 (2009). https:\/\/doi.org\/10.1016\/j.dam.2008.07.011","DOI":"10.1016\/j.dam.2008.07.011"},{"key":"15_CR17","doi-asserted-by":"publisher","unstructured":"Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. J. Discret. Algorithms 7(2), 181\u2013190 (2009). https:\/\/doi.org\/10.1016\/j.jda.2008.09.005","DOI":"10.1016\/j.jda.2008.09.005"},{"key":"15_CR18","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92935-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:37:21Z","timestamp":1762907841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92935-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929342","9783031929359"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92935-9_15","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":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}