{"id":"https://openalex.org/W2887635191","doi":"https://doi.org/10.1007/s00453-020-00772-w","title":"The Power of Cut-Based Parameters for Computing Edge Disjoint Paths","display_name":"The Power of Cut-Based Parameters for Computing Edge Disjoint Paths","alternate_titles":[],"publication_year":2019,"publication_date":"2019-09-11","ids":{"openalex":"https://openalex.org/W2887635191","doi":"https://doi.org/10.1007/s00453-020-00772-w","mag":"2887635191","pmid":"https://pubmed.ncbi.nlm.nih.gov/33707803","pmcid":"https://www.ncbi.nlm.nih.gov/pmc/articles/7904754"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-020-00772-w","doi":"https://doi.org/10.1007/s00453-020-00772-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-020-00772-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00772-w.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"parent_works":[{"id":"https://openalex.org/W3108019135","display_name":"Graph-Theoretic Concepts in Computer Science: 45th International Workshop, WG 2019, Vall de N\u00faria, Spain, June 19\u201321, 2019, Revised Papers","relationship":"volume"}],"lineage":["https://openalex.org/W2887635191","https://openalex.org/W3108019135"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["arxiv","crossref","datacite","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00772-w.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088116512","display_name":"Robert Ganian","orcid":"https://orcid.org/0000-0002-7762-8045","observed_orcids":["https://orcid.org/0000-0002-7762-8045"]},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Robert Ganian","raw_affiliation_strings":["Algorithms and Complexity Group, Vienna University of Technology, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017076947","display_name":"Sebastian Ordyniak","orcid":"https://orcid.org/0000-0003-1935-651X","observed_orcids":["https://orcid.org/0000-0003-1935-651X"]},"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":"Sebastian Ordyniak","raw_affiliation_strings":["Algorithms Group, University of Sheffield, Sheffield, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms Group, University of Sheffield, Sheffield, UK","institution_ids":["https://openalex.org/I91136226"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017076947"],"corresponding_institution_ids":["https://openalex.org/I91136226"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690},"fwci":1.7206,"has_fulltext":true,"cited_by_count":27,"citation_normalized_percentile":{"value":0.83371048,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":92,"max":99},"biblio":{"volume":"83","issue":"2","first_page":"190","last_page":"204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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.0006000000284984708,"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.0,"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/edge-disjoint-paths","display_name":"edge-disjoint paths","score":0.9210000038146973},{"id":"https://openalex.org/keywords/fixed-parameter-tractability","display_name":"fixed-parameter tractability","score":0.8939999938011169},{"id":"https://openalex.org/keywords/polynomial-kernel","display_name":"polynomial kernel","score":0.781000018119812},{"id":"https://openalex.org/keywords/feedback-edge-set","display_name":"feedback edge set","score":0.9430000185966492},{"id":"https://openalex.org/keywords/graph-immersion","display_name":"graph immersion","score":0.656000018119812},{"id":"https://openalex.org/keywords/graph-cuts","display_name":"graph cuts","score":0.7099999785423279},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.7749999761581421},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"parameterized complexity","score":0.6499999761581421},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.5009999871253967}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7795898914337158},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6781489849090576},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6563328504562378},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5163613557815552},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5104133486747742},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4763781726360321},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4725251793861389},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4409918189048767},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4359104633331299},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.4133342504501343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3386189937591553},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1007/s00453-020-00772-w","doi":"https://doi.org/10.1007/s00453-020-00772-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-020-00772-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00772-w.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"doi:10.1007/978-3-030-30786-8_15","doi":"https://doi.org/10.1007/978-3-030-30786-8_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-30786-8_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","ki-jl-1","norway-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmid:33707803","doi":null,"is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/33707803","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"Journal Article"},{"id":"pmh:oai:pubmedcentral.nih.gov:7904754","doi":null,"is_oa":true,"landing_page_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC7904754/","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"Text"},{"id":"pmh:oai:eprints.whiterose.ac.uk:167888","doi":null,"is_oa":false,"landing_page_url":"https://eprints.whiterose.ac.uk/167888/8/Ganian-Ordyniak2021_Article_ThePowerOfCut-BasedParametersF.pdf","pdf_url":"https://eprints.whiterose.ac.uk/167888/8/Ganian-Ordyniak2021_Article_ThePowerOfCut-BasedParametersF.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:168077","doi":null,"is_oa":false,"landing_page_url":"https://eprints.whiterose.ac.uk/168077/1/EDP-edges.pdf","pdf_url":"https://eprints.whiterose.ac.uk/168077/1/EDP-edges.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Proceedings Paper"},{"id":"pmh:oai:arXiv.org:1808.03496","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1808.03496","pdf_url":"https://arxiv.org/pdf/1808.03496","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2887635191","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1808.03496.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1808.03496","doi":"https://doi.org/10.48550/arxiv.1808.03496","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1808.03496","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.1007/s00453-020-00772-w","doi":"https://doi.org/10.1007/s00453-020-00772-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-020-00772-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00772-w.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G8159133586","display_name":"New Frontiers for Parameterized Complexity","funder_award_id":"P31336","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2887635191.pdf","grobid_xml":"https://content.openalex.org/works/W2887635191.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1570425181","https://openalex.org/W1963742727","https://openalex.org/W1980529780","https://openalex.org/W2005079828","https://openalex.org/W2005509629","https://openalex.org/W2019062750","https://openalex.org/W2046202598","https://openalex.org/W2053991811","https://openalex.org/W2074101363","https://openalex.org/W2081304472","https://openalex.org/W2116087731","https://openalex.org/W2117663227","https://openalex.org/W2140262267","https://openalex.org/W2257535006","https://openalex.org/W2293160748","https://openalex.org/W2335915014","https://openalex.org/W2403583756","https://openalex.org/W2526713497","https://openalex.org/W2761665840","https://openalex.org/W2798588639","https://openalex.org/W2914414140","https://openalex.org/W2963428363","https://openalex.org/W2963586530","https://openalex.org/W2964080336","https://openalex.org/W3065763739","https://openalex.org/W4213311856"],"related_works":["https://openalex.org/W2963428363","https://openalex.org/W4312298349","https://openalex.org/W2909818447","https://openalex.org/W7126862569","https://openalex.org/W1505819794","https://openalex.org/W2050719228","https://openalex.org/W7222713967","https://openalex.org/W2019041817","https://openalex.org/W2614881414","https://openalex.org/W4399522565"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"revisits":[3],"the":[4,54,61,111,122,183,192],"classical":[5],"edge-disjoint":[6,34],"paths":[7,35],"(EDP)":[8],"problem,":[9],"where":[10],"one":[11],"is":[12,44,74,165,175],"given":[13],"an":[14],"undirected":[15],"graph":[16,83,135,138,149],"G":[17,28],"and":[18,25,118,137],"a":[19,30,89,142,176,186],"set":[20,31,190],"of":[21,32,50,57,63,92,108,114,151,185],"terminal":[22,38],"pairs":[23],"P":[24,66],"asks":[26],"whether":[27],"contains":[29],"pairwise":[33],"connecting":[36],"every":[37,148],"pair":[39],"in":[40,65,67,110,191],"P.":[41],"Our":[42,116,155,171],"aim":[43],"to":[45,76,104,134,167],"identify":[46],"structural":[47,125],"properties":[48],"(parameters)":[49],"graphs":[51,87],"which":[52,99],"allow":[53],"efficient":[55],"solution":[56],"EDP":[58,73,146,160,180],"without":[59],"restricting":[60],"placement":[62],"terminals":[64],"any":[68],"way.":[69],"In":[70],"this":[71],"setting,":[72],"known":[75],"remain":[77],"NP-hard":[78],"even":[79],"on":[80,147],"extremely":[81],"restricted":[82],"classes,":[84],"such":[85],"as":[86],"with":[88,131],"vertex":[90],"cover":[91],"size":[93,184],"3.":[94],"We":[95],"present":[96],"three":[97],"results":[98],"use":[100],"edge-separator":[101],"based":[102],"parameters":[103],"chart":[105],"new":[106],"islands":[107],"tractability":[109],"complexity":[112],"landscape":[113],"EDP.":[115],"first":[117],"main":[119],"result":[120,157,174],"utilizes":[121],"fairly":[123],"recent":[124],"parameter":[126,130],"tree-cut":[127,153,163],"width":[128,164],"(a":[129],"fundamental":[132],"ties":[133],"immersions":[136],"cuts):":[139],"we":[140],"obtain":[141],"polynomial-time":[143],"algorithm":[144],"for":[145,179],"class":[150],"bounded":[152],"width.":[154],"second":[156],"shows":[158],"that":[159],"parameterized":[161,181],"by":[162,182],"unlikely":[166],"be":[168],"fixed-parameter":[169],"tractable.":[170],"final,":[172],"third":[173],"polynomial":[177],"kernel":[178],"minimum":[187],"feedback":[188],"edge":[189],"graph.":[193]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2887635191","counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2018-08-22T00:00:00"}
