{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:58Z","timestamp":1770921418075,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","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-17801-5_13","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:28Z","timestamp":1770918808000},"page":"172-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enumeration Kernels of\u00a0Polynomial Size for\u00a0Cuts of\u00a0Bounded Degree"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0829-7032","authenticated-orcid":false,"given":"Christian","family":"Komusiewicz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2677-4648","authenticated-orcid":false,"given":"Diptapriyo","family":"Majumdar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-319-71147-8_34","volume-title":"Combinatorial Optimization and Applications","author":"NR Aravind","year":"2017","unstructured":"Aravind, N.R., Kalyanasundaram, S., Kare, A.S.: On structural parameterizations of the matching cut problem. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 475\u2013482. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71147-8_34"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.dam.2021.05.016","volume":"319","author":"NR Aravind","year":"2022","unstructured":"Aravind, N.R., Kalyanasundaram, S., Kare, A.S.: Vertex partitioning problems on graphs with bounded tree width. Discret. Appl. Math. 319, 254\u2013270 (2022)","journal-title":"Discret. Appl. Math."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-030-79987-8_37","volume-title":"Combinatorial Algorithms","author":"NR Aravind","year":"2021","unstructured":"Aravind, N.R., Saxena, R.: An FPT algorithm for matching cut and d-cut. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 531\u2013543. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_37"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.jcss.2019.02.004","volume":"103","author":"M Bentert","year":"2019","unstructured":"Bentert, M., Fluschnik, T., Nichterlein, A., Niedermeier, R.: Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. 103, 61\u201377 (2019)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/jgt.20390","volume":"62","author":"PS Bonsma","year":"2009","unstructured":"Bonsma, P.S.: 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"},{"key":"13_CR6","unstructured":"Bougeret, M., Gomes, G.C.M., dos Santos, V.F., Sau, I.: Enumeration kernels for vertex cover and feedback vertex set. In: IPEC (2025). https:\/\/arxiv.org\/abs\/2509.08475"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"de\u00a0C.\u00a0M.\u00a0Gomes, G., Sau, I.: Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. Algorithmica 83(6), 1677\u20131706 (2021)","DOI":"10.1007\/s00453-021-00798-8"},{"issue":"5","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1007\/s00453-020-00782-8","volume":"83","author":"C Chen","year":"2021","unstructured":"Chen, C., Hsieh, S., Le, H., Le, V.B., Peng, S.: Matching cut in graphs with large minimum degree. Algorithmica 83(5), 1238\u20131255 (2021)","journal-title":"Algorithmica"},{"issue":"1","key":"13_CR9","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. Theor. 8(1), 51\u201353 (1984)","journal-title":"J. Graph. Theor."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.dam.2019.02.025","volume":"268","author":"N Creignou","year":"2019","unstructured":"Creignou, N., Kr\u00f6ll, M., Pichler, R., Skritek, S., Vollmer, H.: A complexity theory for hard enumeration problems. Discret. Appl. Math. 268, 191\u2013209 (2019)","journal-title":"Discret. Appl. Math."},{"issue":"9","key":"13_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.3390\/a12090189","volume":"12","author":"N Creignou","year":"2019","unstructured":"Creignou, N., Ktari, R., Meier, A., M\u00fcller, J., Olive, F., Vollmer, H.: Parameterised enumeration for modification problems. Algorithms 12(9), 189 (2019)","journal-title":"Algorithms"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s00224-016-9702-4","volume":"60","author":"N Creignou","year":"2017","unstructured":"Creignou, N., Meier, A., M\u00fcller, J., Schmidt, J., Vollmer, H.: Paradigms for parameterized enumeration. Theor. Comput. Syst. 60(4), 737\u2013758 (2017)","journal-title":"Theor. Comput. Syst."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2005.10.004","volume":"351","author":"P Damaschke","year":"2006","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theor. Comput. Sci. 351(3), 337\u2013350 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science, Springer (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press (2019)","DOI":"10.1017\/9781107415157"},{"key":"13_CR17","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, 76\u2013102 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR18","unstructured":"Gomes, G.C.M., Juliano, E., Martins, G., dos Santos, V.F.: Matching (multi)cut: algorithms, complexity, and enumeration. In: Bonnet, \u00c9., Rzazewski, P. (eds.) 19th International Symposium on Parameterized and Exact Computation, IPEC 2024, September 4-6, 2024, Royal Holloway, University of London, Egham, United Kingdom. LIPIcs, vol.\u00a0321, pp. 25:1\u201325:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"13_CR19","unstructured":"Jansen, B.M.P., van\u00a0der Steenhoven, B.: Kernelization for counting problems on graphs: preserving the number of minimum solutions. In: Misra, N., Wahlstr\u00f6m, M. (eds.) 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands. LIPIcs, vol.\u00a0285, pp. 27:1\u201327:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"13_CR20","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. Discret. Appl. Math. 283, 44\u201358 (2020)","journal-title":"Discret. Appl. Math."},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Komusiewicz, C., Majumdar, D., Sommer, F.: Polynomial-size enumeration kernelizations for long path enumeration. In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2025, Otzenhausen, Germany, 2025, Proceedings (2025). https:\/\/doi.org\/10.1007\/978-3-032-11835-6_24","DOI":"10.1007\/978-3-032-11835-6_24"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.tcs.2015.10.016","volume":"609","author":"D Kratsch","year":"2016","unstructured":"Kratsch, D., Le, V.B.: Algorithms solving the matching cut problem. Theor. Comput. Sci. 609, 328\u2013335 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19\u201337 (2012)","journal-title":"Algorithmica"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2018.10.029","volume":"770","author":"H Le","year":"2019","unstructured":"Le, H., Le, V.B.: A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. Theor. Comput. Sci. 770, 69\u201378 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2022.07.035","volume":"931","author":"VB Le","year":"2022","unstructured":"Le, V.B., Telle, J.A.: The perfect matching cut problem revisited. Theor. Comput. Sci. 931, 117\u2013130 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR26","unstructured":"Lokshtanov, D., Misra, P., Saurabh, S., Zehavi, M.: Kernelization of counting problems. In: Guruswami, V. (ed.) 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA. LIPIcs, vol.\u00a0287, pp. 77:1\u201377:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Panolan, F., Ramanujan, M.S., Saurabh, S.: Lossy kernelization. In: Hatami, H., McKenzie, P., King, V. (eds.) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. pp. 224\u2013237. ACM (2017)","DOI":"10.1145\/3055399.3055456"},{"key":"13_CR28","unstructured":"Lucke, F., Paulusma, D., Ries, B.: Finding matching cuts in H-free graphs. In: Bae, S.W., Park, H. (eds.) 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea. LIPIcs, vol.\u00a0248, pp. 22:1\u201322:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Patrignani, M., Pizzonia, M.: The complexity of the matching-cut problem. In: Brandst\u00e4dt, A., Le, V.B. (eds.) Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings. LNCS, vol.\u00a02204, pp. 284\u2013295. Springer (2001)","DOI":"10.1007\/3-540-45477-2_26"},{"issue":"5","key":"13_CR30","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0020-0190(82)90022-9","volume":"14","author":"CD Savage","year":"1982","unstructured":"Savage, C.D.: Depth-first search and the vertex cover problem. Inf. Process. Lett. 14(5), 233\u2013237 (1982)","journal-title":"Inf. Process. Lett."},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Wasa, K.: Enumeration of enumeration algorithms (2016). https:\/\/doi.org\/10.48550\/arXiv.1605.05102","DOI":"10.48550\/arXiv.1605.05102"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:31Z","timestamp":1770918811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_13","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":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}