{"id":"https://openalex.org/W7129436121","doi":"https://doi.org/10.48550/arxiv.2602.14768","title":"On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints","display_name":"On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints","publication_year":2026,"publication_date":"2026-02-16","ids":{"openalex":"https://openalex.org/W7129436121","doi":"https://doi.org/10.48550/arxiv.2602.14768"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.14768","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021429825","display_name":"Susobhan Bandopadhyay","orcid":"https://orcid.org/0000-0003-1073-2718"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bandopadhyay, Susobhan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000126726","display_name":"Aritra Banik","orcid":"https://orcid.org/0000-0002-7544-6125"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Banik, Aritra","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126272020","display_name":"Diptapriyo Majumdar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Majumdar, Diptapriyo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126203208","display_name":"Abhishek Sahu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sahu, Abhishek","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5021429825"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.6136000156402588,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.6136000156402588,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.13199999928474426,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.12639999389648438,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7423999905586243},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6373000144958496},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5874000191688538},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4909000098705292},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4429999887943268},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4332999885082245},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.41429999470710754},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4018000066280365}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7423999905586243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6509000062942505},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6395999789237976},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6373000144958496},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5874000191688538},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4909000098705292},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4429999887943268},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4332999885082245},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.41429999470710754},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4018000066280365},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38690000772476196},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3594000041484833},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35499998927116394},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.3361000120639801},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.31139999628067017},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3043999969959259},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.30379998683929443},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.2897000014781952},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.2851000130176544},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.2653000056743622},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2578999996185303}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.14768","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.14768","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.14768","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.14768","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"an":[1,11,39],"undirected":[2],"graph":[3],"G":[4,17,70],"and":[5,20,100,115,142],"a":[6,14,144],"set":[7],"A":[8,27],"\\subseteq":[9],"V(G),":[10],"A-path":[12,36],"is":[13,37,47,86,90],"path":[15,46,98],"in":[16,31,69],"that":[18,84],"starts":[19],"ends":[21],"at":[22],"two":[23],"distinct":[24],"vertices":[25,30],"of":[26,44],"with":[28,77,146],"intermediate":[29],"V(G)":[32],"\\setminus":[33],"A.":[34],"An":[35],"called":[38],"(A,\\ell)-path":[40],"if":[41],"the":[42,45,51,93,106,134,140],"length":[43],"exactly":[48],"\\ell.":[49,121],"In":[50,102],"{\\sc":[52],"(A,":[53,67],"\\ell)-Path":[54],"Packing}":[55],"problem":[56,76],"(ALPP),":[57],"we":[58,104,127,132],"seek":[59],"to":[60,79,97,110,117],"determine":[61],"whether":[62],"there":[63],"exist":[64],"k":[65],"vertex-disjoint":[66],"\\ell)-paths":[68],"or":[71],"not.":[72],"We":[73,82],"pursue":[74],"this":[75],"respect":[78],"structural":[80],"parameters.":[81],"prove":[83],"ALPP":[85],"W[1]-hard":[87],"when":[88],"it":[89],"parameterized":[91],"by":[92],"combined":[94,107,125],"parameter":[95,141],"distance":[96,109,116],"(dtp)":[99],"|A|.":[101],"addition,":[103],"consider":[105,133],"parameters":[108],"cluster":[111,118],"(cvd)":[112,119],"+":[113,120],"|A|":[114],"For":[122],"both":[123],"these":[124],"parameters,":[126],"provide":[128,143],"FPT":[129],"algorithms.":[130],"Finally,":[131],"vertex":[135],"cover":[136],"number":[137],"(vc)":[138],"as":[139],"kernel":[145],"O(vc^2)":[147],"vertices.":[148]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-18T00:00:00"}