{"id":"https://openalex.org/W2532977679","doi":"https://doi.org/10.1145/3580376","title":"The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems","display_name":"The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems","publication_year":2023,"publication_date":"2023-06-06","ids":{"openalex":"https://openalex.org/W2532977679","doi":"https://doi.org/10.1145/3580376","mag":"2532977679"},"language":"en","primary_location":{"id":"doi:10.1145/3580376","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3580376","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3580376","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3580376","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000019988","display_name":"Andreas Emil Feldmann","orcid":"https://orcid.org/0000-0001-6229-5332"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Andreas Emil Feldmann","raw_affiliation_strings":["University of Sheffield, UK"],"affiliations":[{"raw_affiliation_string":"University of Sheffield, UK","institution_ids":["https://openalex.org/I91136226"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Germany"],"affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Germany","institution_ids":["https://openalex.org/I4210128801"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000019988"],"corresponding_institution_ids":["https://openalex.org/I91136226"],"apc_list":null,"apc_paid":null,"fwci":0.1966,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.48413647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":"3-4","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.856576681137085},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7785725593566895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6956803798675537},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.671711802482605},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5478836297988892},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5345370769500732},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5243502259254456},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5199416875839233},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.215334951877594}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.856576681137085},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7785725593566895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6956803798675537},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.671711802482605},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5478836297988892},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5345370769500732},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5243502259254456},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5199416875839233},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.215334951877594},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3580376","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3580376","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3580376","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3580376","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3580376","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3580376","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5294695404","display_name":null,"funder_award_id":"#19-27871X","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G5664323314","display_name":null,"funder_award_id":"19-27871X","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2532977679.pdf","grobid_xml":"https://content.openalex.org/works/W2532977679.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W194684792","https://openalex.org/W196127575","https://openalex.org/W1497634048","https://openalex.org/W1570425181","https://openalex.org/W1963899113","https://openalex.org/W1965229006","https://openalex.org/W1972906866","https://openalex.org/W1973819999","https://openalex.org/W1976584101","https://openalex.org/W1996668544","https://openalex.org/W2003753063","https://openalex.org/W2005771129","https://openalex.org/W2009976792","https://openalex.org/W2011823863","https://openalex.org/W2035613592","https://openalex.org/W2039298646","https://openalex.org/W2045749371","https://openalex.org/W2051627428","https://openalex.org/W2089847997","https://openalex.org/W2096477872","https://openalex.org/W2097782835","https://openalex.org/W2116087731","https://openalex.org/W2123087902","https://openalex.org/W2143481766","https://openalex.org/W2151534739","https://openalex.org/W2341842340","https://openalex.org/W2401610261","https://openalex.org/W2401939546","https://openalex.org/W2490706771","https://openalex.org/W2570206580","https://openalex.org/W2620939520","https://openalex.org/W2798588639","https://openalex.org/W2914414140","https://openalex.org/W2963340170","https://openalex.org/W2963676274","https://openalex.org/W2995828778","https://openalex.org/W3039948875","https://openalex.org/W3114660220"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W2118320476","https://openalex.org/W1494268238","https://openalex.org/W154868527","https://openalex.org/W2161182859","https://openalex.org/W2035613592","https://openalex.org/W2132921321","https://openalex.org/W4300501056","https://openalex.org/W2765600275","https://openalex.org/W2392246501"],"abstract_inverted_index":{"Given":[0],"a":[1,6,33,40,67,103,151,188,193,201,231,235,329],"directed":[2,41,133,154,189],"graph":[3,190],"G":[4,37],"and":[5,246,263,276,306,320,326],"list":[7,169],"(":[8,16,170,178],"s":[9,17,42,171,179],"1":[10,13,73,172,175],",":[11,19,74,173,181],"t":[12,20,45,72,76,107,112,174,182],"),":[14,176],"\u2026,":[15,75,177],"d":[18,21,53,77,180,183],")":[22,78,114,184],"of":[23,36,89,124,132,153,163,185,195,204,226,238,317,332],"terminal":[24],"pairs,":[25],"the":[26,87,92,122,129,160,168,205,223,242,265],"Directed":[27,58,164,270,307],"Steiner":[28,59,97,134,165,271,282,294,308],"Network":[29,166,309],"problem":[30,243],"asks":[31],"for":[32,48,64,102,250,286,314],"minimum-cost":[34],"subgraph":[35],"that":[38,191,216,269,335],"contains":[39],"i":[43,46,51,108],"\u2192":[44],"path":[47,104],"every":[49,106,110,218,251],"1\u2264":[50],"\u2264":[52],".":[54],"The":[55],"special":[56,93,141,161,212],"case":[57,94,162],"Tree":[60,272,283],"(when":[61,99],"we":[62,100,157,214],"ask":[63,101],"paths":[65],"from":[66,105],"root":[68],"r":[69],"to":[70,81,109,117,136,230],"terminals":[71,318],"is":[79,115,150,192,200,244,248,273,284,296,310],"known":[80,116,266,338],"be":[82,118],"fixed-parameter":[83,210],"tractable":[84,211,333],"parameterized":[85,120],"by":[86,121],"number":[88,123,237,316],"terminals,":[90],"while":[91],"Strongly":[95,292],"Connected":[96,293],"Subgraph":[98,295],"other":[111,140],"j":[113],"W[1]-hard":[119,249,297],"terminals.":[125],"We":[126],"systematically":[127],"explore":[128],"complexity":[130],"landscape":[131],"problems":[135],"fully":[137],"understand":[138],"which":[139],"cases":[142,334],"are":[143],"FPT":[144,274,285],"or":[145],"W[1]-hard.":[146],"Formally,":[147],"if":[148,217],"\u210b":[149,207,221,254],"class":[152],"graphs,":[155],"then":[156,241],"look":[158],"at":[159],"where":[167],"demands":[186],"form":[187],"member":[194],"\u210b.":[196],"Our":[197],"main":[198],"result":[199],"complete":[202,260],"characterization":[203],"classes":[206],"resulting":[208],"in":[209,220,312],"cases:":[213],"show":[215],"pattern":[219],"has":[222],"combinatorial":[224],"property":[225],"being":[227],"\u201ctransitively":[228],"equivalent":[229],"bounded-length":[232],"caterpillar":[233],"with":[234],"bounded":[236],"extra":[239],"edges,\u201d":[240],"FPT,":[245],"it":[247],"recursively":[252],"enumerable":[253],"not":[255,337],"having":[256],"this":[257],"property.":[258],"This":[259],"dichotomy":[261],"unifies":[262],"generalizes":[264],"results":[267],"showing":[268],"[Dreyfus":[275],"Wagner,":[277],"Networks":[278],"1971],":[279],"q":[280,288],"-Root":[281],"constant":[287,315],"[Such\u00fd,":[289],"WG":[290],"2016],":[291],"[Guo":[298],"et":[299],"al.,":[300],"SIAM":[301,322],"J.":[302,323],"Discrete":[303],"Math.":[304],"2011],":[305],"solvable":[311],"polynomial-time":[313],"[Feldman":[319],"Ruhl,":[321],"Comput.":[324],"2006],":[325],"moreover":[327],"reveals":[328],"large":[330],"continent":[331],"were":[336],"before.":[339]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}