{"id":"https://openalex.org/W4410061314","doi":"https://doi.org/10.1007/978-981-96-4448-3_2","title":"Parameterized Complexity of\u00a0Shortest Path with\u00a0Positive Disjunctive Constraints","display_name":"Parameterized Complexity of\u00a0Shortest Path with\u00a0Positive Disjunctive Constraints","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4410061314","doi":"https://doi.org/10.1007/978-981-96-4448-3_2"},"language":"en","primary_location":{"id":"doi:10.1007/978-981-96-4448-3_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-96-4448-3_2","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,"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"},"type":"book-chapter","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/A5021429825","display_name":"Susobhan Bandopadhyay","orcid":"https://orcid.org/0000-0003-1073-2718"},"institutions":[{"id":"https://openalex.org/I163389970","display_name":"National Institute of Science Education and Research","ror":"https://ror.org/02r2k1c68","country_code":"IN","type":"education","lineage":["https://openalex.org/I163389970","https://openalex.org/I200207707"]},{"id":"https://openalex.org/I200207707","display_name":"Homi Bhabha National Institute","ror":"https://ror.org/02bv3zr67","country_code":"IN","type":"education","lineage":["https://openalex.org/I200207707"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Susobhan Bandopadhyay","raw_affiliation_strings":["National Institute of Science Education and Research, An OCC of Homi Bhabha National Institute, Bhubaneswar, Odisha, India"],"affiliations":[{"raw_affiliation_string":"National Institute of Science Education and Research, An OCC of Homi Bhabha National Institute, Bhubaneswar, Odisha, India","institution_ids":["https://openalex.org/I163389970","https://openalex.org/I200207707"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033218913","display_name":"Suman Banerjee","orcid":"https://orcid.org/0000-0003-1761-5944"},"institutions":[{"id":"https://openalex.org/I4210127441","display_name":"Indian Institute of Technology Jammu","ror":"https://ror.org/02f0vsw63","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210127441"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Suman Banerjee","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Jammu, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Jammu, India","institution_ids":["https://openalex.org/I4210127441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038073617","display_name":"Diptapriyo Majumdar","orcid":"https://orcid.org/0000-0003-2677-4648"},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Diptapriyo Majumdar","raw_affiliation_strings":["Indraprastha Institute of Information Technology Delhi, New Delhi, India"],"affiliations":[{"raw_affiliation_string":"Indraprastha Institute of Information Technology Delhi, New Delhi, India","institution_ids":["https://openalex.org/I119939252"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060986039","display_name":"Fahad Panolan","orcid":"https://orcid.org/0000-0001-6213-8687"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Fahad Panolan","raw_affiliation_strings":["School of Computer Science, University of Leeds, Leeds, UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Leeds, Leeds, UK","institution_ids":["https://openalex.org/I130828816"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5021429825"],"corresponding_institution_ids":["https://openalex.org/I163389970","https://openalex.org/I200207707"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26814216,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"14","last_page":"25"},"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.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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9369086623191833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7766904830932617},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.684237003326416},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4697067439556122},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44994109869003296},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28728488087654114},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09513241052627563},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0494208037853241}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9369086623191833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7766904830932617},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.684237003326416},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4697067439556122},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44994109869003296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28728488087654114},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09513241052627563},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0494208037853241}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-981-96-4448-3_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-96-4448-3_2","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,"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":"pmh:oai:eprints.whiterose.ac.uk:218508","is_oa":false,"landing_page_url":null,"pdf_url":null,"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,"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":null,"raw_type":"NonPeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W179052057","https://openalex.org/W1857705078","https://openalex.org/W2013937449","https://openalex.org/W2050524721","https://openalex.org/W2059451253","https://openalex.org/W2064252342","https://openalex.org/W2108078607","https://openalex.org/W2116087731","https://openalex.org/W2116638623","https://openalex.org/W2914414140","https://openalex.org/W2944564962","https://openalex.org/W3006397453","https://openalex.org/W3008279586","https://openalex.org/W4213232386"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051058708","https://openalex.org/W1494268238","https://openalex.org/W154868527","https://openalex.org/W1983207144","https://openalex.org/W2132921321","https://openalex.org/W2053685668","https://openalex.org/W2914625303"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}