{"id":"https://openalex.org/W2061597613","doi":"https://doi.org/10.1137/070697781","title":"Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs","display_name":"Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2061597613","doi":"https://doi.org/10.1137/070697781","mag":"2061597613"},"language":"en","primary_location":{"id":"doi:10.1137/070697781","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070697781","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/A5058550942","display_name":"Aleksandrs Slivkins","orcid":"https://orcid.org/0000-0001-6899-6383"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Aleksandrs Slivkins","raw_affiliation_strings":["slivkins@microsoft.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"slivkins@microsoft.com#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5058550942"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.368,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.8839997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"24","issue":"1","first_page":"146","last_page":"157"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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.819546103477478},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8118298053741455},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7608951926231384},{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.7500206232070923},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6863359808921814},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5674437284469604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49169331789016724},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46511414647102356},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.46307647228240967},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4420650899410248},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16025793552398682}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.819546103477478},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8118298053741455},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7608951926231384},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.7500206232070923},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6863359808921814},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5674437284469604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49169331789016724},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46511414647102356},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.46307647228240967},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4420650899410248},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16025793552398682},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/070697781","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070697781","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":26,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1484984105","https://openalex.org/W1519147138","https://openalex.org/W1563039933","https://openalex.org/W1591562949","https://openalex.org/W1949395038","https://openalex.org/W1975433230","https://openalex.org/W1976285925","https://openalex.org/W1983058179","https://openalex.org/W1994772417","https://openalex.org/W2003160050","https://openalex.org/W2005079828","https://openalex.org/W2022535594","https://openalex.org/W2042697932","https://openalex.org/W2047141034","https://openalex.org/W2050579693","https://openalex.org/W2100699015","https://openalex.org/W2108251005","https://openalex.org/W2126880366","https://openalex.org/W2138123132","https://openalex.org/W2399312309","https://openalex.org/W2401610261","https://openalex.org/W2569646339","https://openalex.org/W2913688336","https://openalex.org/W3014052784","https://openalex.org/W3016000088"],"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,55,117,168],"graph":[2,108],"and":[3,40,133,156,177],"terminal":[4],"pairs":[5],"$(s_i,t_i)$,":[6],"$i\\in[k]$,":[7,20],"the":[8,48,76,84,89,106,126,140,149,164],"edge-disjoint":[9],"paths":[10,173],"problem":[11,30,90],"is":[12,35,47,61,91,131,135,139,153],"to":[13,37,95,148,158],"determine":[14],"whether":[15,59,67],"there":[16],"exist":[17],"$s_{i}t_{i}$":[18],"paths,":[19],"that":[21,88,174],"do":[22],"not":[23],"share":[24],"any":[25],"edges.":[26,115],"We":[27,79,143],"consider":[28],"this":[29,81,145],"on":[31],"acyclic":[32,132],"digraphs.":[33],"It":[34,52],"known":[36],"be":[38,96],"NP-complete":[39],"solvable":[41],"in":[42,64,83],"time":[43,74],"$n^{O(k)}$":[44],"where":[45,137],"n":[46],"number":[49],"of":[50,75,110,113,163,171],"nodes.":[51],"has":[53,175],"been":[54],"long-standing":[56],"open":[57],"question":[58,82],"it":[60,68,101],"fixed-parameter":[62,97],"tractable":[63],"k,":[65],"i.e.,":[66],"admits":[69],"an":[70,122,159],"algorithm":[71,124],"with":[72],"running":[73],"form":[77],"$f(k)\\,n^{O(1)}$.":[78],"resolve":[80],"negative:":[85],"we":[86,120],"show":[87],"$W[1]$-hard,":[92],"hence":[93],"unlikely":[94],"tractable.":[98],"In":[99],"fact":[100],"remains":[102],"$W[1]$-hard":[103],"even":[104],"if":[105],"demand":[107,141],"consists":[109],"two":[111],"sets":[112],"parallel":[114],"On":[116],"positive":[118],"side,":[119],"give":[121],"$O(m+k^{O(1)}\\,k!\\,n)$":[123],"for":[125],"special":[127,161],"case":[128,150,162],"when":[129,151],"G":[130],"$G+H$":[134,152],"Eulerian,":[136,155],"H":[138],"graph.":[142],"generalize":[144],"result":[146],"(1)":[147],"\u201cnearly\u201d":[154],"(2)":[157],"analogous":[160],"unsplittable":[165],"flow":[166],"problem,":[167],"generalized":[169],"version":[170],"disjoint":[172],"capacities":[176],"demands.":[178]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}