{"id":"https://openalex.org/W2995828778","doi":"https://doi.org/10.1137/18m122371x","title":"Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)","display_name":"Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W2995828778","doi":"https://doi.org/10.1137/18m122371x","mag":"2995828778"},"language":"en","primary_location":{"id":"doi:10.1137/18m122371x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m122371x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.birmingham.ac.uk/en/publications/8f056b96-514c-4dc5-bcc2-a3b905f03d28","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012330722","display_name":"Rajesh Chitnis","orcid":"https://orcid.org/0000-0002-6098-7770"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Rajesh H. Chitnis","raw_affiliation_strings":["School of Computer Science, University of Birmingham"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000019988","display_name":"Andreas Emil Feldmann","orcid":"https://orcid.org/0000-0001-6229-5332"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Andreas E. Feldmann","raw_affiliation_strings":["Department of Applied Mathematics, Charles University, Prague, Czechia"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Charles University, Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108944480","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MohammadTaghi HajiAghayi","raw_affiliation_strings":["Department of Computer Science , University of Maryland at College Park, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Maryland at College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"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/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Marx","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5012330722"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":0.7226,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.75517734,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"49","issue":"2","first_page":"318","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/combinatorics","display_name":"Combinatorics","score":0.8094702959060669},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.7806430459022522},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7288295030593872},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6888337731361389},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6416219472885132},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6174358129501343},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5442176461219788},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5064581632614136},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.46877235174179077},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46869730949401855},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4243735671043396},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37616202235221863},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1600031852722168},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11321082711219788}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8094702959060669},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.7806430459022522},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7288295030593872},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6888337731361389},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6416219472885132},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6174358129501343},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5442176461219788},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5064581632614136},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.46877235174179077},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46869730949401855},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4243735671043396},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37616202235221863},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1600031852722168},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11321082711219788},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/18m122371x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m122371x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/8f056b96-514c-4dc5-bcc2-a3b905f03d28","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/8f056b96-514c-4dc5-bcc2-a3b905f03d28","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chitnis, R, Feldmann, A E, Hajiaghayi, M & Marx, D 2020, 'Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)', SIAM Journal on Computing, vol. 49, no. 2, pp. 318\u2013364. https://doi.org/10.1137/18M122371X","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/8f056b96-514c-4dc5-bcc2-a3b905f03d28","is_oa":true,"landing_page_url":"https://www.siam.org/publications/journals/siam-journal-on-computing-sicomp","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chitnis , R , Feldmann , A E , Hajiaghayi , M & Marx , D 2020 , ' Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions) ' , SIAM Journal on Computing , vol. 49 , no. 2 , pp. 318\u2013364 . https://doi.org/10.1137/18M122371X","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/8f056b96-514c-4dc5-bcc2-a3b905f03d28","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/8f056b96-514c-4dc5-bcc2-a3b905f03d28","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chitnis, R, Feldmann, A E, Hajiaghayi, M & Marx, D 2020, 'Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)', SIAM Journal on Computing, vol. 49, no. 2, pp. 318\u2013364. https://doi.org/10.1137/18M122371X","raw_type":"article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1082698598","display_name":null,"funder_award_id":"UNCE/SCI/004","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G1129333050","display_name":null,"funder_award_id":"N000141110662","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G1171700966","display_name":null,"funder_award_id":"NSF CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1811664709","display_name":null,"funder_award_id":"725978","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G2811237814","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G34334426","display_name":null,"funder_award_id":"2014-CoG 647557","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G3751613428","display_name":null,"funder_award_id":"YIP award N000141110662","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G4425768753","display_name":null,"funder_award_id":"1053605","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4518263622","display_name":null,"funder_award_id":"1411106","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5108384764","display_name":null,"funder_award_id":"280152","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G5330626842","display_name":null,"funder_award_id":"GACR no. P202/12/G061","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G5566021001","display_name":null,"funder_award_id":"P202/12/G061","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G5990251679","display_name":null,"funder_award_id":"FA8650-11-1-7162","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7013946126","display_name":null,"funder_award_id":"RASA","funder_id":"https://openalex.org/F4320310578","funder_display_name":"University of Maryland"},{"id":"https://openalex.org/G7835183750","display_name":"Visualization Studies of Heat and Mass Transfer in Forced Flow He II","funder_award_id":"0001411","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310578","display_name":"University of Maryland","ror":"https://ror.org/01r0c1p88"},{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338294","display_name":"Air Force Research Laboratory","ror":"https://ror.org/02e2egq70"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W790236442","https://openalex.org/W1578789027","https://openalex.org/W1943258494","https://openalex.org/W1985572324","https://openalex.org/W1986144992","https://openalex.org/W1991636386","https://openalex.org/W1993920925","https://openalex.org/W1995725694","https://openalex.org/W1996668544","https://openalex.org/W2009976792","https://openalex.org/W2035613592","https://openalex.org/W2045749371","https://openalex.org/W2063525042","https://openalex.org/W2084876869","https://openalex.org/W2085348754","https://openalex.org/W2088820959","https://openalex.org/W2089847997","https://openalex.org/W2092838574","https://openalex.org/W2113885662","https://openalex.org/W2127240180","https://openalex.org/W2127485201","https://openalex.org/W2130190334","https://openalex.org/W2132087752","https://openalex.org/W2143481766","https://openalex.org/W2150004999","https://openalex.org/W2158584754","https://openalex.org/W2172222998","https://openalex.org/W2228622483","https://openalex.org/W2563156040","https://openalex.org/W2570206580","https://openalex.org/W2804655966","https://openalex.org/W2951996037"],"related_works":["https://openalex.org/W3135652805","https://openalex.org/W4301463689","https://openalex.org/W2605313623","https://openalex.org/W2800485060","https://openalex.org/W4220735480","https://openalex.org/W2108770488","https://openalex.org/W3022168212","https://openalex.org/W4302399289","https://openalex.org/W2952055179","https://openalex.org/W4302786124"],"abstract_inverted_index":{"Given":[0],"a":[1,7,29,41,65,107,119,138,180,224,231,271,306,358,371],"vertex-weighted":[2],"directed":[3,100,263],"graph":[4,82,294],"$G=(V,E)$":[5],"and":[6,55,83,131,187,201,252,315,337],"set":[8,31],"$T=\\{t_1,":[9],"t_2,":[10],"\\ldots,":[11],"t_k\\}$":[12],"of":[13,18,34,78,88,118,121,129,206,227,239,284,313,360],"$k$":[14,84],"terminals,":[15],"the":[16,19,70,76,81,86,95,124,127,163,190,216,220,237,242,282,292,310,344,353,374,402,408,412],"objective":[17],"Strongly":[20],"Connected":[21],"Steiner":[22,209,348],"Subgraph":[23],"(SCSS)":[24],"problem":[25,50,96,283],"is":[26,51,75,85,106,115,137,179,185,295,355,370,384],"to":[27,199,234,268,343,356,373],"find":[28,357],"vertex":[30,416],"$H\\subseteq":[32],"V$":[33],"minimum":[35,361],"weight":[36,362],"such":[37,305,363],"that":[38,147,177,364],"$G[H]$":[39],"contains":[40],"$t_{i}\\rightarrow":[42],"t_j$":[43],"path":[44,372],"for":[45,69,111,142,157,194,261,281,304,331,365,390,401,411],"each":[46],"$i\\neq":[47],"j$.":[48],"The":[49,245],"NP-hard,":[52],"but":[53],"Feldman":[54,130,314,336],"Ruhl":[56,338],"[SIAM":[57],"J.":[58],"Comput.,":[59],"36":[60],"(2006),":[61],"pp.":[62],"543--561]":[63],"gave":[64],"novel":[66],"$n^{O(k)}$":[67,311,341],"algorithm":[68,110,128,156,193,260,312,330,342,389,409],"SCSS":[71,149,319],"problem,":[72],"where":[73],"$n$":[74],"number":[77,87,238],"vertices":[79],"in":[80,123,230,241,255,320],"terminals.":[89],"We":[90,378],"explore":[91],"how":[92],"much":[93],"easier":[94],"becomes":[97],"on":[98,392],"planar":[99,112,148,262,288,394],"graphs.":[101,395],"Our":[102,133],"main":[103,134],"algorithmic":[104],"result":[105,136],"$2^{O(k)}\\cdot":[108,258],"n^{O(\\sqrt{k})}$":[109,259],"SCSS,":[113],"which":[114],"an":[116,153,286,326],"improvement":[117,308],"factor":[120],"$O(\\sqrt{k})$":[122],"exponent":[125],"over":[126,309],"Ruhl.":[132],"hardness":[135],"matching":[139,219],"lower":[140,217,253,398],"bound":[141,218],"our":[143,171,250,257,397],"algorithm:":[144],"we":[145,173,222,275,301],"show":[146,175,379],"does":[150,323],"not":[151,296,324],"have":[152,325],"$f(k)\\cdot":[154,327,386],"n^{o(\\sqrt{k})}$":[155],"any":[158,332],"computable":[159,333],"function":[160,334],"$f$,":[161],"unless":[162],"exponential":[164],"time":[165,280,388],"hypothesis":[166],"(ETH)":[167],"fails.":[168],"To":[169,214],"obtain":[170,215,277],"algorithm,":[172,221],"first":[174],"combinatorially":[176],"there":[178,369,383],"minimal":[181],"solution":[182,289],"whose":[183],"treewidth":[184],"$O(\\sqrt{k})$,":[186],"then":[188],"use":[189],"dynamic-programming":[191],"based":[192],"finding":[195,285],"bounded-treewidth":[196],"solutions":[197],"due":[198],"Feldmann":[200],"Marx":[202],"[The":[203],"Complexity":[204],"Landscape":[205],"Fixed-Parameter":[207],"Directed":[208,347],"Network":[210,349],"Problems,":[211],"preprint,":[212],"\u016dlhttps://arxiv.org/abs/1707.06808].":[213],"need":[223],"delicate":[225],"construction":[226],"gadgets":[228],"arranged":[229],"gridlike":[232],"fashion":[233],"tightly":[235],"control":[236],"terminals":[240],"created":[243],"instance.":[244],"following":[246],"additional":[247],"results":[248],"put":[249],"upper":[251],"bounds":[254,399],"context:":[256],"graphs":[264,269,322],"can":[265,276],"be":[266],"generalized":[267,339],"excluding":[270],"fixed":[272],"minor.":[273],"Additionally,":[274],"this":[278],"running":[279],"optimal":[287],"even":[290],"if":[291],"input":[293],"planar.":[297],"In":[298],"general":[299,321,346,414],"graphs,":[300],"cannot":[302],"hope":[303],"dramatic":[307],"Ruhl:":[316],"assuming":[317,381],"ETH,":[318,382],"n^{o(k/\\log":[328],"k)}$":[329],"$f$.":[335],"their":[340],"more":[345,413],"(DSN)":[350],"problem;":[351],"here":[352],"task":[354],"subgraph":[359],"every":[366],"source":[367],"$s_i$":[368],"corresponding":[375],"terminal":[376],"$t_i$.":[377],"that,":[380],"no":[385],"n^{o(k)}$":[387],"DSN":[391],"acyclic":[393],"All":[396],"hold":[400],"integer":[403],"weighted":[404],"edge":[405],"version,":[406],"while":[407],"works":[410],"unweighted":[415],"version.":[417]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2025-10-10T00:00:00"}