{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:52Z","timestamp":1770994132697,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","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-11835-6_24","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:56:29Z","timestamp":1767315389000},"page":"331-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial-Size Enumeration Kernelizations for\u00a0Long Path Enumeration"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0829-7032","authenticated-orcid":false,"given":"Christian","family":"Komusiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2677-4648","authenticated-orcid":false,"given":"Diptapriyo","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4034-525X","authenticated-orcid":false,"given":"Frank","family":"Sommer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jcss.2017.03.003","volume":"87","author":"A Bj\u00f6rklund","year":"2017","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Narrow sieves for parameterized paths and packings. J. Comput. Syst. Sci. 87, 119\u2013139 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"8","key":"24_CR2","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2012.09.006","volume":"511","author":"HL Bodlaender","year":"2013","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernel bounds for path and cycle problems. Theor. Comput. Sci. 511, 117\u2013136 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"24_CR4","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. Theory Comput. Syst. 60(4), 737\u2013758 (2017)","journal-title":"Theory Comput. Syst."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"3","key":"24_CR6","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":"24_CR7","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Graduate texts in mathematics, 4th edn., vol.\u00a0173. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Heidelberg (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/s00224-009-9167-9","volume":"45","author":"MR Fellows","year":"2009","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Mnich, M., Rosamond, F.A., Saurabh, S.: The complexity ecology of parameters: an illustration using bounded max leaf number. Theory Comput. Syst. 45(4), 822\u2013848 (2009)","journal-title":"Theory Comput. Syst."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Le, T., Lokshtanov, D., Saurabh, S., Thomass\u00e9, S., Zehavi, M.: Subquadratic kernels for implicit 3-hitting set and 3-set packing problems. ACM Trans. Algorithms 15(1), 13:1\u201313:44 (2019)","DOI":"10.1145\/3293466"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM 63(4), 29:1\u201329:60 (2016)","DOI":"10.1145\/2886094"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Representative families of product families. ACM Trans. Algorithms 13(3), 36:1\u201336:29 (2017)","DOI":"10.1145\/3039243"},{"key":"24_CR13","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":"24_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, 76\u2013102 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR15","unstructured":"Gomes, G.C.M., Juliano, E., Martins, G., dos Santos, V.F.: Matching (multi)cut: algorithms, complexity, and enumeration. In: Proceedings of the 19th International Symposium on Parameterized and Exact Computation (IPEC\u00a02024). LIPIcs, vol.\u00a0321, pp. 25:1\u201325:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"issue":"4","key":"24_CR16","doi-asserted-by":"publisher","first-page":"1815","DOI":"10.1137\/140981290","volume":"29","author":"P Goyal","year":"2015","unstructured":"Goyal, P., Misra, N., Panolan, F., Zehavi, M.: Deterministic algorithms for matching and packing problems based on representative sets. SIAM J. Discret. Math. 29(4), 1815\u20131836 (2015)","journal-title":"SIAM J. Discret. Math."},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.jcss.2016.10.008","volume":"85","author":"BMP Jansen","year":"2017","unstructured":"Jansen, B.M.P.: Turing kernelization for finding long paths and cycles in restricted graph classes. J. Comput. Syst. Sci. 85, 18\u201337 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"10","key":"24_CR18","doi-asserted-by":"publisher","first-page":"3936","DOI":"10.1007\/s00453-019-00614-4","volume":"81","author":"BMP Jansen","year":"2019","unstructured":"Jansen, B.M.P., Pilipczuk, M., Wrochna, M.: Turing kernelization for finding long paths in graph classes excluding a topological minor. Algorithmica 81(10), 3936\u20133967 (2019)","journal-title":"Algorithmica"},{"key":"24_CR19","unstructured":"Jansen, B.M.P., van\u00a0der Steenhoven, B.: Kernelization for counting problems on graphs: preserving the number of minimum solutions. In: Proceedings of the 18th International Symposium on Parameterized and Exact Computation (IPEC\u00a02023). LIPIcs, vol.\u00a0285, pp. 27:1\u201327:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"24_CR20","unstructured":"Kobayashi, Y., Kurita, K., Wasa, K.: Polynomial-delay enumeration of large maximal matchings. CoRR abs\/2105.04146 (2021). https:\/\/arxiv.org\/abs\/2105.04146"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Kobayashi, Y., Kurita, K., Wasa, K.: Polynomial-delay and polynomial-space enumeration of large maximal matchings. In: Proceedings of the 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2022). Lecture Notes in Computer Science, vol. 13453, pp. 342\u2013355. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15914-5_25"},{"key":"24_CR22","unstructured":"Komusiewicz, C., Majumdar, D.: Enumeration kernels of polynomial size for cuts of bounded degree. CoRR abs\/2308.01286 (2023). https:\/\/doi.org\/10.48550\/arXiv.2308.01286"},{"key":"24_CR23","unstructured":"Lokshtanov, D., Misra, P., Saurabh, S., Zehavi, M.: Kernelization of counting problems. In: Proceedings of the 15th Innovations in Theoretical Computer Science Conference (ITCS\u00a02024). LIPIcs, vol.\u00a0287, pp. 77:1\u201377:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Panolan, F., Ramanujan, M.S., Saurabh, S.: Lossy kernelization. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC\u00a02017), pp. 224\u2013237. ACM (2017)","DOI":"10.1145\/3055399.3055456"},{"key":"24_CR25","doi-asserted-by":"publisher","unstructured":"Meier, A.: Parametrised enumeration (2020). https:\/\/doi.org\/10.15488\/9427. Habilitation thesis, Leibniz Universit\u00e4t Hannover","DOI":"10.15488\/9427"},{"issue":"5","key":"24_CR26","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":"24_CR27","doi-asserted-by":"crossref","unstructured":"Thomass\u00e9, S.: A $$4 k^2$$ kernel for feedback vertex set. ACM Trans. Algorithms 6(2), 32:1\u201332:8 (2010)","DOI":"10.1145\/1721837.1721848"}],"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-032-11835-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:56:30Z","timestamp":1767315390000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_24","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":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","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":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}