{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:54:18Z","timestamp":1776848058763,"version":"3.51.2"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T00:00:00Z","timestamp":1776297600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005416","name":"Norges forskningsr\u00e5d","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence nationale de la recherche","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115970","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:11:35Z","timestamp":1776294695000},"page":"115970","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["When does FTP become FPT?"],"prefix":"10.1016","volume":"1076","author":[{"given":"Matthias","family":"Bentert","sequence":"first","affiliation":[]},{"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":[]},{"given":"Laure","family":"Morelle","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2026.115970_bib0001","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-021-01664-9","article-title":"Flexible graph connectivity","volume":"192","author":"Adjiashvili","year":"2022","journal-title":"Math. Program."},{"key":"10.1016\/j.tcs.2026.115970_bib0002","series-title":"Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT)","first-page":"5:1","article-title":"Fault-tolerant edge-disjoint s-t paths \u2013 beyond uniform faults","author":"Adjiashvili","year":"2022"},{"key":"10.1016\/j.tcs.2026.115970_bib0003","series-title":"Proceedings of the 18th International Symposium on Parameterized and Exact Computation (IPEC)","first-page":"4:1","article-title":"On the complexity of finding a sparse connected spanning subgraph in a non-uniform failure model","author":"Bentert","year":"2023"},{"key":"10.1016\/j.tcs.2026.115970_bib0004","series-title":"Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)","first-page":"9:1","article-title":"Approximation algorithms for flexible graph connectivity","author":"Boyd","year":"2021"},{"key":"10.1016\/j.tcs.2026.115970_bib0005","unstructured":"D. Adjiashvili, Fault-tolerant shortest paths \u2013 beyond the uniform failure model, (2013). CoRR abs\/1301.6299."},{"key":"10.1016\/j.tcs.2026.115970_bib0006","series-title":"Proceedings of the 50th International Colloquium on Automata, Languages, and Programming (ICALP)","first-page":"15:1","article-title":"Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions","author":"Bansal","year":"2023"},{"key":"10.1016\/j.tcs.2026.115970_bib0007","series-title":"Proceedings of the 50th International Colloquium on Automata, Languages, and Programming (ICALP)","first-page":"36:1","article-title":"Approximation algorithms for network design in non-uniform fault models","author":"Chekuri","year":"2023"},{"key":"10.1016\/j.tcs.2026.115970_bib0008","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"issue":"2","key":"10.1016\/j.tcs.2026.115970_bib0009","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0097-3165(90)90064-4","article-title":"On Cayley\u2019s formula for counting forests","volume":"53","author":"Tak\u00e1cs","year":"1990","journal-title":"J. Comb. Theory Ser. A"},{"key":"10.1016\/j.tcs.2026.115970_bib0010","series-title":"Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"503","article-title":"A deterministic almost-linear time algorithm for minimum-cost flow","author":"van den Brand","year":"2023"},{"issue":"4","key":"10.1016\/j.tcs.2026.115970_bib0011","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","article-title":"Color-coding","volume":"42","author":"Alon","year":"1995","journal-title":"J. ACM"},{"issue":"5","key":"10.1016\/j.tcs.2026.115970_bib0012","doi-asserted-by":"crossref","first-page":"34:1","DOI":"10.1145\/3212622","article-title":"The parameterized complexity of the k-biclique problem","volume":"65","author":"Lin","year":"2018","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.115970_bib0013","series-title":"Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP)","first-page":"378","article-title":"Incompressibility through colors and IDs","author":"Dom","year":"2009"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600229X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600229X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:56:29Z","timestamp":1776844589000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439752600229X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":13,"alternative-id":["S030439752600229X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115970","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"When does FTP become FPT?","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115970","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115970"}}