{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T11:37:16Z","timestamp":1773920236403,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032215390","type":"print"},{"value":"9783032215406","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-21540-6_13","type":"book-chapter","created":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T06:49:36Z","timestamp":1773902976000},"page":"213-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["From FPT Decision to\u00a0FPT Enumeration"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo Camillo","family":"Merkl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Unterberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,20]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"issue":"1\u20133","key":"13_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discret. Appl. Math. 65(1\u20133), 21\u201346 (1996)","journal-title":"Discret. Appl. Math."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Berlowitz, D., Cohen, S., Kimelfeld, B.: Efficient enumeration of maximal k-plexes. In: Proc. SIGMOD 2015. pp. 431\u2013444. ACM (2015)","DOI":"10.1145\/2723372.2746478"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Bougeret, M., Gomes, G.C.M., dos Santos, V.F., Sau, I.: Enumeration kernels for vertex cover and feedback vertex set. In: Agrawal, A., van Leeuwen, E.J. (eds.) 20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17\u201319, 2025. LIPIcs, vol. 358, pp. 23:1\u201323:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPICS.IPEC.2025.23, https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2025.23","DOI":"10.4230\/LIPICS.IPEC.2025.23"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.dam.2017.08.002","volume":"246","author":"A Conte","year":"2018","unstructured":"Conte, A., Grossi, R., Marino, A., Rizzi, R.: Efficient enumeration of graph orientations with sources. Discret. Appl. Math. 246, 22\u201337 (2018)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1580","DOI":"10.1137\/20M1375048","volume":"51","author":"A Conte","year":"2022","unstructured":"Conte, A., Grossi, R., Marino, A., Uno, T., Versari, L.: Proximity search for maximal subgraph enumeration. SIAM J. Comput. 51(5), 1580\u20131625 (2022)","journal-title":"SIAM J. Comput."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Conte, A., Uno, T.: New polynomial delay bounds for maximal subgraph enumeration by proximity search. In: Proc. STOC 2019. pp. 1179\u20131190. ACM (2019)","DOI":"10.1145\/3313276.3316402"},{"issue":"1&2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","volume":"109","author":"B Courcelle","year":"1993","unstructured":"Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theor. Comput. Sci. 109(1&2), 49\u201382 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"13_CR9","first-page":"189","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":"Parameterised enumeration for modification problems. Algorithms"},{"issue":"4","key":"13_CR10","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":"13_CR11","unstructured":"Creignou, N., Merkl, T.C., Pichler, R., Unterberger, D.: From fpt decision to fpt enumeration. CoRR abs\/2512.24137 (2025), https:\/\/doi.org\/10.48550\/arXiv.2512.24137"},{"key":"13_CR12","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_CR13","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_CR14","doi-asserted-by":"publisher","unstructured":"Dreier, J., Ordyniak, S., Szeider, S.: SAT backdoors: Depth beats size. J. Comput. Syst. Sci. 142, 103520 (2024). https:\/\/doi.org\/10.1016\/J.JCSS.2024.103520, https:\/\/doi.org\/10.1016\/j.jcss.2024.103520","DOI":"10.1016\/J.JCSS.2024.103520"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Fernau, H.: On parameterized enumeration. Computing and Combinatorics (2002)","DOI":"10.1007\/3-540-45655-4_60"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Gaspers, S., Szeider, S.: Strong backdoors to bounded treewidth SAT. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, Berkeley, CA, USA, October, 26\u201329, 2013. pp. 489\u2013498. IEEE Computer Society (2013) https:\/\/doi.org\/10.1109\/FOCS.2013.59, https:\/\/doi.org\/10.1109\/FOCS.2013.59","DOI":"10.1109\/FOCS.2013.59"},{"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."},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"13_CR19","doi-asserted-by":"publisher","first-page":"1916","DOI":"10.1137\/120862612","volume":"28","author":"MM Kant\u00e9","year":"2014","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L.: On the enumeration of minimal dominating sets and related notions. SIAM J. Discret. Math. 28(4), 1916\u20131929 (2014)","journal-title":"SIAM J. Discret. Math."},{"issue":"7","key":"13_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"EL Lawler","year":"1972","unstructured":"Lawler, E.L.: A solution to computing the $$k$$ best solutions to discrete optimization problems and its application to the shortest path. Manage. Sci. 18(7), 401\u2013405 (1972)","journal-title":"Manage. Sci."},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Livshits, E., Kimelfeld, B.: Counting and enumerating (preferred) database repairs. In: Proc. PODS 2017, pp. 289\u2013301. ACM (2017)","DOI":"10.1145\/3034786.3056107"},{"key":"13_CR22","unstructured":"Marino, A.: Algorithms for biological graphs. Ph.D. thesis, University of Florence, Italy (2012)"},{"key":"13_CR23","volume-title":"Parametrised enumeration","author":"A Meier","year":"2020","unstructured":"Meier, A.: Parametrised enumeration. Leibniz Universit\u00e4t Hannover, Habilitationsschrift (2020)"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Misra, N., Ordyniak, S., Raman, V., Szeider, S.: Upper and lower bounds for weak backdoor set detection. In: J\u00e4rvisalo, M., Gelder, A.V. (eds.) Theory and Applications of Satisfiability Testing - SAT 2013\u201316th International Conference, Helsinki, Finland, July 8\u201312, 2013. Proceedings. Lecture Notes in Computer Science, vol. 7962, pp. 394\u2013402. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-39071-5_29, https:\/\/doi.org\/10.1007\/978-3-642-39071-5_29","DOI":"10.1007\/978-3-642-39071-5_29"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proc. FOCS 1995, pp. 182\u2013191. IEEE Computer Society (1995)","DOI":"10.1109\/SFCS.1995.492475"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"13_CR27","unstructured":"Strozecki, Y.: Enumeration complexity and matroid decomposition. Ph.D. thesis, Universit\u00e9 Paris Diderot, Paris, France (2010)"},{"key":"13_CR28","volume-title":"Two general methods to reduce delay and change of enumeration algorithms","author":"T Uno","year":"2003","unstructured":"Uno, T.: Two general methods to reduce delay and change of enumeration algorithms. Tech. rep, NII (2003)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-21540-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T06:49:38Z","timestamp":1773902978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-21540-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032215390","9783032215406"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-21540-6_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":"20 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoIKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Foundations of Information and Knowledge Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanover","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2026","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":"foiks2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/foiks2026.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}