{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:40:57Z","timestamp":1767314457969,"version":"3.48.0"},"publisher-location":"Cham","reference-count":13,"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_4","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:39:06Z","timestamp":1767314346000},"page":"48-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["When Does FTP Become FPT?"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Bentert","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1955-4612","authenticated-orcid":false,"given":"Fedor V.","family":"Fomin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2619-2990","authenticated-orcid":false,"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1001-1801","authenticated-orcid":false,"given":"Laure","family":"Morelle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10107-021-01664-9","volume":"192","author":"D Adjiashvili","year":"2022","unstructured":"Adjiashvili, D., Hommelsheim, F., M\u00fchlenthaler, M.: Flexible graph connectivity. Math. Program. 192(1), 409\u2013441 (2022)","journal-title":"Math. Program."},{"key":"4_CR2","unstructured":"Adjiashvili, D., Hommelsheim, F., M\u00fchlenthaler, M., Schaudt, O.: Fault-tolerant edge-disjoint s-t paths \u2013 beyond uniform faults. In: Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pp. 5:1\u20135:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"4","key":"4_CR3","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"},{"key":"4_CR4","unstructured":"Bansal, I., Cheriyan, J., Grout, L., Ibrahimpur, S.: Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions. In: Proceedings of the 50th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 15:1\u201315:19. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"4_CR5","unstructured":"Bentert, M., Fomin, F.V., Golovach, P.A., Morelle, L.: When does FTP become FPT? (2025). https:\/\/arxiv.org\/abs\/2506.17008"},{"key":"4_CR6","unstructured":"Bentert, M., Schestag, J., Sommer, F.: On the complexity of finding a sparse connected spanning subgraph in a non-uniform failure model. In: Proceedings of the 18th International Symposium on Parameterized and Exact Computation (IPEC), pp. 4:1\u20134:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"4_CR7","unstructured":"Boyd, S.C., Cheriyan, J., Haddadan, A., Ibrahimpur, S.: Approximation algorithms for flexible graph connectivity. In: Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 9:1\u20139:14. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"van den Brand, J., et al.: A deterministic almost-linear time algorithm for minimum-cost flow. In: Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 503\u2013514. IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00037"},{"key":"4_CR9","unstructured":"Chekuri, C., Jain, R.: Approximation algorithms for network design in non-uniform fault models. In: Proceedings of the 50th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 36:1\u201336:20. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-21275-3_15","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Lower bounds for kernelization. In: Parameterized Algorithms, pp. 523\u2013555. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3_15"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"Automata, Languages and Programming","author":"M Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 378\u2013389. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_32"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Lin, B.: The parameterized complexity of the $$k$$-biclique problem. J. ACM 65(5), 34:1\u201334:23 (2018)","DOI":"10.1145\/3212622"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0097-3165(90)90064-4","volume":"53","author":"L Tak\u00e1cs","year":"1990","unstructured":"Tak\u00e1cs, L.: On Cayley\u2019s formula for counting forests. J. Comb. Theory, Ser. A 53(2), 321\u2013323 (1990)","journal-title":"J. Comb. Theory, Ser. A"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:39:07Z","timestamp":1767314347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_4","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"}}]}}