{"id":"https://openalex.org/W4417539504","doi":"https://doi.org/10.1016/j.tcs.2026.115970","title":"When does FTP become FPT?","display_name":"When does FTP become FPT?","publication_year":2026,"publication_date":"2026-04-15","ids":{"openalex":"https://openalex.org/W4417539504","doi":"https://doi.org/10.1016/j.tcs.2026.115970"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2026.115970","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115970","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.tcs.2026.115970","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Matthias Bentert","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Matthias Bentert","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Fedor V. Fomin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2619-2990","affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Laure Morelle","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laure Morelle","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02541084,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1076","issue":null,"first_page":"115970","last_page":"115970"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6687999963760376,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6687999963760376,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.21130000054836273,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.03400000184774399,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5673999786376953},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5426999926567078},{"id":"https://openalex.org/keywords/file-transfer-protocol","display_name":"File Transfer Protocol","score":0.48590001463890076},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4722999930381775},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4375999867916107},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.3287999927997589},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.3255000114440918},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.3084000051021576}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6373000144958496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6122999787330627},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5673999786376953},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5426999926567078},{"id":"https://openalex.org/C169485995","wikidata":"https://www.wikidata.org/wiki/Q42283","display_name":"File Transfer Protocol","level":3,"score":0.48590001463890076},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4722999930381775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44290000200271606},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4375999867916107},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3479999899864197},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.3255000114440918},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3084000051021576},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3050999939441681},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2948000133037567},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2777000069618225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27630001306533813},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.274399995803833},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.26989999413490295},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/j.tcs.2026.115970","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115970","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2506.17008","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2506.17008","pdf_url":"https://arxiv.org/pdf/2506.17008","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2506.17008","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2506.17008","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1016/j.tcs.2026.115970","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115970","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,58,94,100,103,111,114,117,127,137,154],"problem":[2],"Fault-Tolerant":[3,73],"Path":[4,74],"(FTP),":[5],"we":[6],"are":[7],"given":[8],"an":[9,68,149],"edge-weighted":[10],"directed":[11],"graph":[12],"G":[13,48],"=":[14],"(V,":[15],"E),":[16],"a":[17,44,83],"subset":[18],"U":[19],"\\subseteq":[20],"E":[21],"of":[22,47,60,91,96,105,120,130,153,157],"vulnerable":[23,63,97,131],"edges,":[24,64],"two":[25],"vertices":[26],"s,":[27],"t":[28],"\\in":[29],"V,":[30],"and":[31,34,79,141,144],"integers":[32],"k":[33,62],"\\ell.":[35],"The":[36],"task":[37],"is":[38,75],"to":[39],"decide":[40],"whether":[41,72,80],"there":[42],"exists":[43],"subgraph":[45],"H":[46,65],"with":[49],"total":[50],"cost":[51],"at":[52],"most":[53],"\\ell":[54],"such":[55],"that,":[56],"after":[57],"removal":[59],"any":[61,124,134],"still":[66],"contains":[67],"s-t-path.":[69],"We":[70,147],"study":[71],"fixed-parameter":[76],"tractable":[77],"(FPT)":[78],"it":[81],"admits":[82],"polynomial":[84],"kernel":[85],"under":[86],"various":[87],"parameterizations.":[88,146],"Our":[89],"choices":[90],"parameters":[92],"include:":[93],"number":[95,104,119,129],"edges":[98,109,122,132],"in":[99,110,123,133],"input":[101,112],"graph,":[102,113],"safe":[106,121],"(i.e,":[107],"invulnerable)":[108],"budget":[115],"\\ell,":[116],"minimum":[118,128],"optimal":[125,135],"solution,":[126,136],"required":[138],"redundancy":[139],"k,":[140],"natural":[142],"above-":[143],"below-guarantee":[145],"provide":[148],"almost":[150],"complete":[151],"description":[152],"complexity":[155],"landscape":[156],"FTP":[158],"for":[159],"these":[160],"parameters.":[161]},"counts_by_year":[],"updated_date":"2026-04-23T06:14:38.165362","created_date":"2025-10-10T00:00:00"}