{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:04Z","timestamp":1780783144564,"version":"3.54.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_27","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:05Z","timestamp":1780780445000},"page":"385-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Conflict-Free Cuts in\u00a0Planar and\u00a03-Degenerate Graphs with\u00a01-Regular Conflicts"],"prefix":"10.1007","author":[{"given":"Subrahmanyam","family":"Kalyanasundaram","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Subodh","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"27_CR1","unstructured":"Agrawal, A., Jain, P., Kanesh, L., Lokshtanov, D., Saurabh, S.: Conflict free feedback vertex set: a parameterized dichotomy. In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS, Dagstuhl, Germany, pp. 53:1\u201353:15 (2018)"},{"issue":"7","key":"27_CR2","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1007\/s00453-020-00681-y","volume":"82","author":"A Agrawal","year":"2020","unstructured":"Agrawal, A., Jain, P., Kanesh, L., Saurabh, S.: Parameterized complexity of conflict-free matchings and paths. Algorithmica 82(7), 1939\u20131965 (2020)","journal-title":"Algorithmica"},{"key":"27_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2025.115081","volume":"1031","author":"BJS Barros","year":"2025","unstructured":"Barros, B.J.S., Ochi, L.S., Pinheiro, R.G.S., Souza, U.S.: On conflict-free spanning tree: mapping tractable and hard instances through the lenses of graph classes. Theor. Comput. Sci. 1031, 115081 (2025)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1287\/ijoc.2016.0742","volume":"29","author":"A Bettinelli","year":"2017","unstructured":"Bettinelli, A., Cacchiani, V., Malaguti, E.: A branch-and-bound algorithm for the knapsack problem with conflict graph. INFORMS J. Comput. 29(3), 457\u2013473 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/jgt.20390","volume":"62","author":"P Bonsma","year":"2009","unstructured":"Bonsma, P.: The complexity of the matching-cut problem for planar graphs and other graph classes. J. Graph Theory 62(2), 109\u2013126 (2009)","journal-title":"J. Graph Theory"},{"issue":"5","key":"27_CR6","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1007\/s00453-020-00782-8","volume":"83","author":"CY Chen","year":"2021","unstructured":"Chen, C.Y., Hsieh, S.Y., Le, H.O., Le, V.B., Peng, S.L.: Matching cut in graphs with large minimum degree. Algorithmica 83(5), 1238\u20131255 (2021)","journal-title":"Algorithmica"},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jgt.3190080106","volume":"8","author":"V Chv\u00e1tal","year":"1984","unstructured":"Chv\u00e1tal, V.: Recognizing decomposable graphs. J. Graph Theory 8(1), 51\u201353 (1984)","journal-title":"J. Graph Theory"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ic.2017.04.009","volume":"256","author":"M Cygan","year":"2017","unstructured":"Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M.: Hitting forbidden subgraphs in graphs of bounded treewidth. Inf. Comput. 256, 62\u201382 (2017)","journal-title":"Inf. Comput."},{"issue":"16","key":"27_CR9","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.dam.2010.12.016","volume":"159","author":"A Darmann","year":"2011","unstructured":"Darmann, A., Pferschy, U., Schauer, J., Woeginger, G.J.: Paths, trees and matchings under disjunctive constraints. Disc. Appl. Math. 159(16), 1726\u20131735 (2011)","journal-title":"Disc. Appl. Math."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph theory 6th ed. Graduate texts in mathematics, p. 173 (2024)","DOI":"10.1007\/978-3-662-70107-2"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.disopt.2010.11.001","volume":"8","author":"L Epstein","year":"2011","unstructured":"Epstein, L., Favrholdt, L.M., Levin, A.: Online variable-sized bin packing with conflicts. Disc. Optim. 8(2), 333\u2013343 (2011)","journal-title":"Disc. Optim."},{"issue":"8","key":"27_CR12","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s00453-025-01318-8","volume":"87","author":"C Feghali","year":"2025","unstructured":"Feghali, C., Lucke, F., Paulusma, D., Ries, B.: Matching cuts in graphs of high girth and $$H$$-free graphs. Algorithmica 87(8), 1199\u20131221 (2025)","journal-title":"Algorithmica"},{"issue":"5","key":"27_CR13","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12899","volume":"109","author":"S Glock","year":"2024","unstructured":"Glock, S., Joos, F., Kim, J., K\u00fchn, M., Lichev, L.: Conflict-free hypergraph matchings. J. Lond. Math. Soc. 109(5), e12899 (2024)","journal-title":"J. Lond. Math. Soc."},{"issue":"C","key":"27_CR14","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.jcss.2021.07.005","volume":"123","author":"PA Golovach","year":"2022","unstructured":"Golovach, P.A., Komusiewicz, C., Kratsch, D., Le, V.B.: Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. 123(C), 76\u2013102 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Graham, R.L.: Bounds on multiprocessing anomalies and related packing algorithms. In: Proceedings of the 16\u201318 May 1972, Spring Joint Computer Conference, pp. 205\u2013217 (1971)","DOI":"10.1145\/1478873.1478901"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.dam.2019.12.010","volume":"283","author":"C Komusiewicz","year":"2020","unstructured":"Komusiewicz, C., Kratsch, D., Le, V.B.: Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms. Disc. Appl. Math. 283, 44\u201358 (2020)","journal-title":"Disc. Appl. Math."},{"key":"27_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114795","volume":"1017","author":"F Lucke","year":"2024","unstructured":"Lucke, F., Paulusma, D., Ries, B.: Dichotomies for maximum matching cut: $$H$$-freeness, bounded diameter, bounded radius. Theor. Comput. Sci. 1017, 114795 (2024)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"27_CR18","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1007\/s10878-016-0035-7","volume":"33","author":"U Pferschy","year":"2017","unstructured":"Pferschy, U., Schauer, J.: Approximation of knapsack problems with conflict and forcing graphs. J. Comb. Optim. 33(4), 1300\u20131323 (2017)","journal-title":"J. Comb. Optim."},{"key":"27_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2024.106503","volume":"187","author":"J Rauch","year":"2025","unstructured":"Rauch, J., Rautenbach, D., Souza, U.S.: On conflict-free cuts: algorithms and complexity. Inf. Process. Lett. 187, 106503 (2025)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:06Z","timestamp":1780780446000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}