{"id":"https://openalex.org/W4360985664","doi":"https://doi.org/10.1007/s00453-023-01109-z","title":"Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs","display_name":"Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs","publication_year":2023,"publication_date":"2023-03-11","ids":{"openalex":"https://openalex.org/W4360985664","doi":"https://doi.org/10.1007/s00453-023-01109-z"},"language":"lv","primary_location":{"id":"doi:10.1007/s00453-023-01109-z","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00453-023-01109-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-023-01109-z.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,"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"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-023-01109-z.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013230954","display_name":"Barnaby Martin","orcid":"https://orcid.org/0000-0002-4642-8614"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Barnaby Martin","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dani\u00ebl Paulusma","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003084202","display_name":"Siani Smith","orcid":"https://orcid.org/0000-0003-0797-0512"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Siani Smith","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041371022","display_name":"Erik Jan van Leeuwen","orcid":"https://orcid.org/0000-0001-5240-7257"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Erik Jan van Leeuwen","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5013230954"],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04416509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"85","issue":"9","first_page":"2580","last_page":"2604"},"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.9957000017166138,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5496734380722046},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3505004048347473}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5496734380722046},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3505004048347473}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00453-023-01109-z","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00453-023-01109-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-023-01109-z.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,"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":"pmh:oai:research-information.bris.ac.uk:openaire/bdac9eb8-50bf-449b-adce-9f00903e0a61","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/bdac9eb8-50bf-449b-adce-9f00903e0a61","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Martin, B, Paulusma, D, Smith, S & van Leeuwen, E J 2023, 'Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs', Algorithmica, vol. 85, no. 9, pp. 2580-2604. https://doi.org/10.1007/s00453-023-01109-z","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:38332","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/38332/1/38332.pdf","pdf_url":"https://durham-repository.worktribe.com/preview/1175502/38332.pdf","source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 2023 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:durham-repository.worktribe.com:1175480","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1175480","pdf_url":"https://durham-repository.worktribe.com/file/1175480/1/Published%20Journal%20Article%20%28Advanced%20online%20version%29","source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/bdac9eb8-50bf-449b-adce-9f00903e0a61","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85149736098&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Martin, B, Paulusma, D, Smith, S & van Leeuwen, E J 2023, 'Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs', Algorithmica, vol. 85, no. 9, pp. 2580-2604. https://doi.org/10.1007/s00453-023-01109-z","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s00453-023-01109-z","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00453-023-01109-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-023-01109-z.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,"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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4360985664.pdf"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1582736073","https://openalex.org/W1963707128","https://openalex.org/W2001258629","https://openalex.org/W2005079828","https://openalex.org/W2020972784","https://openalex.org/W2023228520","https://openalex.org/W2035637517","https://openalex.org/W2047194922","https://openalex.org/W2060632898","https://openalex.org/W2060685279","https://openalex.org/W2095269023","https://openalex.org/W2126486668","https://openalex.org/W2166566648","https://openalex.org/W2571021594","https://openalex.org/W2962055031","https://openalex.org/W2964093597","https://openalex.org/W2987461903","https://openalex.org/W2990878769","https://openalex.org/W3041491102","https://openalex.org/W3159532254","https://openalex.org/W3168725788","https://openalex.org/W3209626956","https://openalex.org/W4213168420","https://openalex.org/W4226048850","https://openalex.org/W4307288260"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"Abstract":[0],"Paths":[1,70],"$$P^1,\\ldots":[2],",P^k$$":[3],"<mml:math":[4,24,44,53,86,108,119,129,140,160],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[5,25,45,54,87,109,120,130,141,161],"<mml:mrow>":[6,26,88,162],"<mml:msup>":[7,14,46,55,110,121],"<mml:mi>P</mml:mi>":[8,15,47,56,111,122],"<mml:mn>1</mml:mn>":[9],"</mml:msup>":[10,17,49,58,113,124],"<mml:mo>,</mml:mo>":[11,13,31,94],"<mml:mo>\u2026</mml:mo>":[12],"<mml:mi>k</mml:mi>":[16,163],"</mml:mrow>":[18,34,100,166],"</mml:math>":[19,35,50,59,101,114,125,135,146,167],"in":[20],"a":[21,76,150,171,224],"graph":[22,77,152,215],"$$G=(V,E)$$":[23],"<mml:mi>G</mml:mi>":[27],"<mml:mo>=</mml:mo>":[28,164],"<mml:mo>(</mml:mo>":[29,89],"<mml:mi>V</mml:mi>":[30],"<mml:mi>E</mml:mi>":[32],"<mml:mo>)</mml:mo>":[33,99],"are":[36],"mutually":[37,104],"induced":[38,105,219],"if":[39,75,234],"any":[40],"two":[41],"distinct":[42],"$$P^i$$":[43,107,118],"<mml:mi>i</mml:mi>":[48,92,97,112,123,133,144],"and":[51,136],"$$P^j$$":[52],"<mml:mi>j</mml:mi>":[57],"have":[60],"neither":[61],"common":[62],"vertices":[63,84],"nor":[64],"adjacent":[65],"vertices.":[66],"The":[67],"Induced":[68,174],"Disjoint":[69,175],"problem":[71,153,233],"is":[72,149,155,241],"to":[73],"decide":[74],"G":[78],"with":[79],"k":[80,103,237],"pairs":[81,182],"of":[82,180,183,189,195,199,227,230,238,247],"specified":[83],"$$(s_i,t_i)$$":[85],"<mml:msub>":[90,95,131,142],"<mml:mi>s</mml:mi>":[91,132],"</mml:msub>":[93,98,134,145],"<mml:mi>t</mml:mi>":[96,143],"contains":[102],"paths":[106],"such":[115],"that":[116,154,206,209,243],"each":[117],"starts":[126],"from":[127],"$$s_i$$":[128],"ends":[137],"at":[138],"$$t_i$$":[139],".":[147,168],"This":[148],"classical":[151],"-complete":[156],"even":[157],"for":[158,202],"$$k=2$$":[159],"<mml:mn>2</mml:mn>":[165],"We":[169,191],"introduce":[170],"natural":[172],"generalization,":[173],"Connected":[176],"Subgraphs":[177],":":[178],"instead":[179],"connecting":[181],"terminals,":[184],"we":[185,222],"must":[186],"connect":[187],"sets":[188,240],"terminals.":[190],"give":[192,223],"almost-complete":[193],"dichotomies":[194],"the":[196,228,231,235,248],"computational":[197],"complexity":[198,229],"both":[200],"problems":[201],"H":[203,216],"-free":[204],"graphs,":[205],"is,":[207,244],"graphs":[208],"do":[210],"not":[211,245],"contain":[212],"some":[213],"fixed":[214],"as":[217],"an":[218],"subgraph.":[220],"Finally,":[221],"complete":[225],"classification":[226],"second":[232],"number":[236],"terminal":[239],"fixed,":[242],"part":[246],"input.":[249]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}