{"id":"https://openalex.org/W2571021594","doi":"https://doi.org/10.1137/140963200","title":"Induced Disjoint Paths in Claw-Free Graphs","display_name":"Induced Disjoint Paths in Claw-Free Graphs","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2571021594","doi":"https://doi.org/10.1137/140963200","mag":"2571021594"},"language":"en","primary_location":{"id":"doi:10.1137/140963200","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140963200","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":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1447883","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051709720","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"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":["School of Engineering and Computer Science, Durham University, DH1 3LE Durham, UK"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computer Science, Durham University, DH1 3LE 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/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":"Erik Jan van Leeuwen","raw_affiliation_strings":["Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051709720"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.23525351,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"29","issue":"1","first_page":"348","last_page":"375"},"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.9990000128746033,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8809405565261841},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7667940855026245},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6322202682495117},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4742003083229065},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4661105275154114},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44552624225616455},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42226895689964294}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8809405565261841},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7667940855026245},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6322202682495117},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4742003083229065},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4661105275154114},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44552624225616455},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42226895689964294}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/140963200","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140963200","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"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:14155","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/14155/","pdf_url":null,"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":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"SIAM journal on discrete mathematics, 2015, Vol.29(1), pp.348-375 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:durham-repository.worktribe.com:1447883","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1447883","pdf_url":null,"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":null,"raw_type":"publishedVersion"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1447883","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1447883","pdf_url":null,"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":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1111885211","display_name":null,"funder_award_id":"EP/G043434/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G1771282160","display_name":"Algorithmic Aspects of Graph Coloring","funder_award_id":"EP/G043434/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G2761285720","display_name":null,"funder_award_id":"FP/2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3981126665","display_name":null,"funder_award_id":"Seventh Framework Programme","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G442989154","display_name":null,"funder_award_id":"FP/2007-2013","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5593277320","display_name":null,"funder_award_id":"2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5921460977","display_name":null,"funder_award_id":"267959","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6492145964","display_name":"RIGOROUS THEORY OF PREPROCESSING","funder_award_id":"267959","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7980471698","display_name":"Practical Approximation Algorithms","funder_award_id":"259515","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1965412489","https://openalex.org/W1967979192","https://openalex.org/W1969172826","https://openalex.org/W1969279846","https://openalex.org/W1976430052","https://openalex.org/W2003458989","https://openalex.org/W2005079828","https://openalex.org/W2013421520","https://openalex.org/W2014287896","https://openalex.org/W2020972784","https://openalex.org/W2028803564","https://openalex.org/W2047194922","https://openalex.org/W2052053238","https://openalex.org/W2054926952","https://openalex.org/W2059198909","https://openalex.org/W2060632898","https://openalex.org/W2060685279","https://openalex.org/W2073656332","https://openalex.org/W2104062785","https://openalex.org/W2126486668","https://openalex.org/W2144784192","https://openalex.org/W2148030608","https://openalex.org/W2167772458","https://openalex.org/W4210316907","https://openalex.org/W4253689634"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W4288277589","https://openalex.org/W2998616538","https://openalex.org/W2173621488","https://openalex.org/W2964749573","https://openalex.org/W2401679980","https://openalex.org/W4245692971","https://openalex.org/W1553466895"],"abstract_inverted_index":{"Paths":[0,36,122],"$P_1,\\ldots,P_k$":[1],"in":[2,109],"a":[3,42,126,174,183],"graph":[4,43,176,180],"$G=(V,E)$":[5],"are":[6,90,202],"said":[7],"to":[8,39,92],"be":[9,93],"mutually":[10,54],"induced":[11,55,185],"if":[12,198],"for":[13,65,75,96,114,129,152,171],"any":[14],"$1\\leq":[15],"i<j":[16],"\\leq":[17],"k$,":[18],"$P_i$":[19,57,60],"and":[20,63,200],"$P_j$":[21],"have":[22,125],"neither":[23],"common":[24],"vertices":[25,28,50],"nor":[26],"adjacent":[27],"(except":[29],"perhaps":[30],"their":[31],"end-vertices).":[32],"The":[33],"Induced":[34,120],"Disjoint":[35,121],"problem":[37,71,123,145,194],"is":[38,72,112,187,195],"test":[40],"whether":[41,173],"$G$":[44,199],"with":[45],"$k$":[46,53],"pairs":[47],"of":[48,106,134,157,167],"specified":[49],"$(s_i,t_i)$":[51],"contains":[52,177],"paths":[56],"such":[58,85],"that":[59,69,103,118,163,192],"connects":[61],"$s_i$":[62],"$t_i$":[64],"$i=1,\\ldots,k$.":[66],"We":[67,101],"show":[68,102,162],"this":[70,193],"fixed-parameter":[73,94],"tractable":[74,95],"claw-free":[76,97,135,175],"graphs":[77,98,131],"when":[78,150],"parameterized":[79],"by":[80,116,190],"$k$.":[81],"Several":[82],"related":[83],"problems,":[84],"as":[86,99,182],"the":[87,119,144,153,164],"$k$-in-a-Path":[88],"problem,":[89],"proved":[91],"well.":[100],"an":[104],"improvement":[105],"these":[107],"results":[108],"certain":[110],"directions":[111],"unlikely,":[113],"example,":[115],"noting":[117],"cannot":[124],"polynomial":[127],"kernel":[128],"line":[130,203],"(a":[132],"type":[133],"graphs),":[136],"unless":[137],"\\sf":[138,147],"NP":[139],"$\\subseteq$":[140],"co${\\sf":[141],"NP}/$poly.":[142],"Moreover,":[143],"becomes":[146],"NP-complete,":[148],"even":[149,197],"$k=2$,":[151],"more":[154],"general":[155],"class":[156],"$K_{1,4}$-free":[158],"graphs.":[159,204],"Finally,":[160],"we":[161],"$n^{O(k)}$-time":[165],"algorithm":[166],"Fiala":[168],"et":[169],"al.":[170],"testing":[172],"some":[178],"$k$-vertex":[179],"$H$":[181,201],"topological":[184],"minor":[186],"essentially":[188],"optimal":[189],"proving":[191],"$\\mathsf{W}$[1]-hard":[196]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}