{"id":"https://openalex.org/W3122423875","doi":"https://doi.org/10.1137/21m1395089","title":"A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs","display_name":"A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs","publication_year":2023,"publication_date":"2023-05-10","ids":{"openalex":"https://openalex.org/W3122423875","doi":"https://doi.org/10.1137/21m1395089","mag":"3122423875"},"language":"en","primary_location":{"id":"doi:10.1137/21m1395089","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1395089","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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 Chitnis","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Birmingham B15 2TT, UK "],"raw_orcid":"https://orcid.org/0000-0002-6098-7770","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham B15 2TT, UK ","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012330722"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":0.7759,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.73439989,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"37","issue":"2","first_page":"556","last_page":"572"},"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.9994000196456909,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9973999857902527,"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/combinatorics","display_name":"Combinatorics","score":0.8174495697021484},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7132711410522461},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6764328479766846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.672560453414917},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5789538621902466},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5582385659217834},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4848979115486145},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.45530030131340027},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.41784971952438354},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3486674427986145}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8174495697021484},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7132711410522461},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6764328479766846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.672560453414917},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5789538621902466},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5582385659217834},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4848979115486145},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.45530030131340027},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.41784971952438354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3486674427986145}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/21m1395089","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1395089","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W95416648","https://openalex.org/W790236442","https://openalex.org/W836309381","https://openalex.org/W1509794588","https://openalex.org/W1733171300","https://openalex.org/W1791386552","https://openalex.org/W1983058179","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2005079828","https://openalex.org/W2006146932","https://openalex.org/W2017434030","https://openalex.org/W2020187144","https://openalex.org/W2022459721","https://openalex.org/W2042697932","https://openalex.org/W2050579693","https://openalex.org/W2061597613","https://openalex.org/W2081304472","https://openalex.org/W2115589427","https://openalex.org/W2119500311","https://openalex.org/W2154257711","https://openalex.org/W2158584754","https://openalex.org/W2278828694","https://openalex.org/W2297903070","https://openalex.org/W2338323869","https://openalex.org/W2401939546","https://openalex.org/W2401985258","https://openalex.org/W2472796018","https://openalex.org/W2550041253","https://openalex.org/W2569646339","https://openalex.org/W2799833205","https://openalex.org/W2914414140","https://openalex.org/W2944399784","https://openalex.org/W2951996037","https://openalex.org/W2963232826","https://openalex.org/W2963896308","https://openalex.org/W2963908100","https://openalex.org/W2963966355","https://openalex.org/W2964013645","https://openalex.org/W2988480584","https://openalex.org/W2995828778","https://openalex.org/W3035520095","https://openalex.org/W3088406905","https://openalex.org/W3160838608","https://openalex.org/W4213311856"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4292730466","https://openalex.org/W2372211403","https://openalex.org/W3164774158"],"abstract_inverted_index":{".Given":[0],"a":[1,5,204,212,389,416],"graph":[2,69,115,122,202,208,277],"\\(G\\)":[3,43],"and":[4,75,86,256,271,294,320,424,432,443,454],"set":[6],"\\(\\mathcal{T}=":[7],"\\{":[8],"(s_i,":[9],"t_i)":[10],":":[11],"1\\leq":[12],"i\\leq":[13,54],"k":[14],"\\}\\)":[15],"of":[16,110,164,170,195,214,247,254,275,290,302,317,339,392,411,418,436,441,446],"\\(k\\)":[17,66,194,243,410],"pairs,":[18,197,249],"the":[19,73,108,119,162,167,192,200,222,245,252,268,272,276,288,314,369,408,434,437,447],"Vertex-Disjoint":[20,126],"Paths":[21,101,127,172,187,238,298,307,326,351,383,399,449],"(resp.,":[22,35],"Edge-Disjoint":[23,171,186,237,297,306,325,350,382,398],"Paths)":[24],"problems":[25],"asks":[26],"us":[27],"to":[28,49,90,107],"determine":[29],"whether":[30],"there":[31,230],"exist":[32],"pairwise":[33],"vertex-disjoint":[34,76],"edge-disjoint)":[36],"paths":[37],"\\(P_1,":[38],"P_2,":[39],"\\ldots,":[40],"P_k\\)":[41],"in":[42,78,157,287,375],"such":[44],"that":[45,185,229,313,397],"\\(P_i\\)":[46],"connects":[47],"\\(s_i\\)":[48],"\\(t_i\\)":[50],"for":[51,93,99,236,296,305,324,349,381],"each":[52],"\\(1\\leq":[53],"k\\)":[55],".":[56,95],"Unlike":[57],"their":[58],"undirected":[59,121,456],"counterparts":[60],"which":[61,140,366],"are":[62,278],"FPT":[63,154],"(parameterized":[64],"by":[65,83,145,183,191,358,407],")":[67],"from":[68],"minor":[70],"theory,":[71],"both":[72,267],"edge-disjoint":[74],"versions":[77,445],"directed":[79,104,130,175,206,303,386,402,453],"graphs":[80,105,176,403],"were":[81],"shown":[82],"Fortune,":[84,318],"Hopcroft,":[85,319],"Wyllie":[87,321],"(TCS":[88,322],"'80)":[89,323],"be":[91],"NP-hard":[92],"\\(k=2\\)":[94],"This":[96,210,414],"strong":[97],"hardness":[98,263,295],"Disjoint":[100,448],"on":[102,113,128,173,239,299,308,327,352,384,400,451],"general":[103],"led":[106],"study":[109],"parameterized":[111,168,190,406,438],"complexity":[112,169,439],"special":[114,300,390],"classes,":[116],"e.g.,":[117],"when":[118,199],"underlying":[120],"is":[123,177,188,203,231,244,251,258,329,404],"planar.":[124],"For":[125],"planar":[129,205,240,385,401,452,455],"graphs,":[131],"Schrijver":[132,425],"(SICOMP":[133],"'94)":[134],"designed":[135,152],"an":[136,153,336],"\\(n^{O(k)}\\)":[137,315],"time":[138,224,462],"algorithm":[139,155,235,316],"was":[141,354],"later":[142],"improved":[143,367],"upon":[144,368],"Cygan":[146,419],"et":[147,360,420],"al.":[148,361,421],"(FOCS":[149,422],"'13),":[150],"who":[151],"running":[156],"\\(2^{2^{O(k^2)}}\\cdot":[158],"n^{O(1)}\\)":[159],"time.":[160],"To":[161],"best":[163,343],"our":[165,285,393],"knowledge,":[166],"planar)":[174],"unknown.":[178],"We":[179,282],"resolve":[180],"this":[181],"gap":[182],"showing":[184],"W[1]-hard":[189,405],"number":[193,246,253,409],"terminal":[196,248,412],"even":[198,265,332],"input":[201],"acyclic":[207,460],"(DAG).":[209],"answers":[211,415],"question":[213,417],"Slivkins":[215,376],"(ESA":[216,377],"'03,":[217,378],"SIDMA":[218,379],"'10).":[219],"Moreover,":[220],"under":[221,347],"exponential":[223],"hypothesis":[225],"(ETH),":[226],"we":[227,334,395],"show":[228],"no":[232],"\\(f(k)\\cdot":[233,355,370],"n^{o(k)}\\)":[234],"DAGs,":[241],"where":[242],"\\(n\\)":[250],"vertices,":[255],"\\(f\\)":[257],"any":[259],"computable":[260],"function.":[261],"Our":[262,310],"holds":[264],"if":[266,333],"maximum":[269,273],"in-degree":[270],"out-degrees":[274],"at":[279],"most":[280],"2.":[281],"now":[283],"place":[284],"result":[286,311],"context":[289],"previously":[291],"known":[292],"algorithms":[293],"classes":[301],"graphs.\u2022Implications":[304],"DAGs:":[309],"shows":[312],"DAGs":[328,353],"asymptotically":[330],"tight,":[331],"add":[335],"extra":[337],"restriction":[338],"planarity.":[340],"The":[341],"previous":[342],"lower":[344,372],"bound":[345,373],"(also":[346],"ETH)":[348],"n^{o(k/\\log":[356],"k)}\\)":[357],"Amiri":[359],"(MFCS":[362],"'16,":[363],"IPL":[364],"'19),":[365],"n^{o(\\sqrt{k})}\\)":[371],"implicit":[374],"'10).\u2022Implications":[380],"graphs:":[387],"As":[388],"case":[391],"result,":[394],"obtain":[396],"pairs.":[413],"'13)":[423],"(pp.":[426],"417\u2013444,":[427],"Building":[428],"Bridges":[429],"II,":[430],"'19)":[431],"completes":[433],"landscape":[435],"status":[440],"edge":[442],"vertex":[444],"problem":[450],"graphs.Keywordsedge-disjoint":[457],"pathsplanar":[458],"graphsdirected":[459],"graphsexponential":[461],"hypothesisparameterized":[463],"complexityMSC":[464],"codes68W2505C8568W4005C20":[465]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}