{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:02:27Z","timestamp":1746331347145,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819644476","type":"print"},{"value":"9789819644483","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-4448-3_2","type":"book-chapter","created":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:50:30Z","timestamp":1746251430000},"page":"14-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Complexity of\u00a0Shortest Path with\u00a0Positive Disjunctive Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1073-2718","authenticated-orcid":false,"given":"Susobhan","family":"Bandopadhyay","sequence":"first","affiliation":[]},{"given":"Suman","family":"Banerjee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2677-4648","authenticated-orcid":false,"given":"Diptapriyo","family":"Majumdar","sequence":"additional","affiliation":[]},{"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,4]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, A., Jain, P., Kanesh, L., Saurabh, S.: Parameterized complexity of conflict-free matchings and paths. In: Algorithmica, pp. 1\u201327 (2020)","DOI":"10.1007\/s00453-020-00681-y"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0168-0072(95)00020-8","volume":"84","author":"L Cai","year":"1997","unstructured":"Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: Advice classes of parameterized tractability. Ann. Pure Appl. Logic 84(1), 119\u2013138 (1997)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"40\u201342","key":"2_CR3","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40\u201342), 3736\u20133756 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol.\u00a05. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2005.10.004","volume":"351","author":"P Damaschke","year":"2006","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theor. Comput. Sci. 351(3), 337\u2013350 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-642-04428-1_36","volume-title":"Algorithmic Decision Theory","author":"A Darmann","year":"2009","unstructured":"Darmann, A., Pferschy, U., Schauer, J.: Determining a minimum spanning tree with disjunctive constraints. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS (LNAI), vol. 5783, pp. 414\u2013423. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04428-1_36"},{"issue":"16","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.dam.2010.12.016","volume":"159","author":"A Darmann","year":"2011","unstructured":"Darmann, A., Pferschy, U., Schauer, J., Woeginger, G.J.: Paths, trees and matchings under disjunctive constraints. Disc. Appl. Math. 159(16), 1726\u20131735 (2011)","journal-title":"Disc. Appl. Math."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph theory 3rd ed. Graduate texts in mathematics, vol. 173 (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (2012)","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10951-008-0089-1","volume":"12","author":"G Even","year":"2009","unstructured":"Even, G., Halld\u00f3rsson, M.M., Kaplan, L., Ron, D.: Scheduling with conflicts: online and offline algorithms. J. Sched. 12(2), 199\u2013224 (2009)","journal-title":"J. Sched."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-28639-4_15","volume-title":"Parameterized and Exact Computation","author":"J Guo","year":"2004","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Downey, R., Fellows, M., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 162\u2013173. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28639-4_15"},{"issue":"6","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1007\/s00224-019-09964-6","volume":"64","author":"P Jain","year":"2020","unstructured":"Jain, P., Kanesh, L., Misra, P.: Conflict free version of covering problems on graphs: classical and parameterized. Theory Comput. Syst. 64(6), 1067\u20131093 (2020)","journal-title":"Theory Comput. Syst."},{"issue":"10","key":"2_CR13","doi-asserted-by":"publisher","first-page":"2902","DOI":"10.1007\/s00453-020-00708-4","volume":"82","author":"D Majumdar","year":"2020","unstructured":"Majumdar, D., Ramanujan, M.S., Saurabh, S.: On the approximate compressibility of connected vertex cover. Algorithmica 82(10), 2902\u20132926 (2020)","journal-title":"Algorithmica"},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10878-011-9438-7","volume":"26","author":"U Pferschy","year":"2013","unstructured":"Pferschy, U., Schauer, J.: The maximum flow problem with disjunctive constraints. J. Comb. Optim. 26(1), 109\u2013119 (2013)","journal-title":"J. Comb. Optim."},{"key":"2_CR15","unstructured":"West, D.B.: Introduction to Graph Theory. Pearson Education, Boston (2007)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4448-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:50:35Z","timestamp":1746251435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4448-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819644476","9789819644483"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4448-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cocoa2024.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}