{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:22:27Z","timestamp":1772119347309,"version":"3.50.1"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:00:00Z","timestamp":1725321600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:00:00Z","timestamp":1725321600000},"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":["Algorithmica"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s00453-024-01264-x","type":"journal-article","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T07:02:06Z","timestamp":1725346926000},"page":"3465-3495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Romeo and Juliet Meeting in Forest Like Regions"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1727-5388","authenticated-orcid":false,"given":"Neeldhara","family":"Misra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manas","family":"Mulpuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prafullkumar","family":"Tale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaurav","family":"Viramgami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,3]]},"reference":[{"issue":"6","key":"1264_CR1","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1016\/j.jcss.2016.03.003","volume":"82","author":"K Bringmann","year":"2016","unstructured":"Bringmann, K., Hermelin, D., Mnich, M., Van Leeuwen, E.J.: Parameterized complexity dichotomy for steiner multicut. J. Comput. Syst. Sci. 82(6), 1020\u20131043 (2016). https:\/\/doi.org\/10.1016\/j.jcss.2016.03.003","journal-title":"J. Comput. Syst. Sci."},{"key":"1264_CR2","doi-asserted-by":"publisher","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"1264_CR3","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th Edition, vol. 173 of Graduate Texts in Mathematics. Springer (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"1264_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2023.105049","volume":"293","author":"FV Fomin","year":"2023","unstructured":"Fomin, F.V., Golovach, P.A., Thilikos, D.M.: Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. Inf. Comput. 293, 105049 (2023). https:\/\/doi.org\/10.1016\/j.ic.2023.105049","journal-title":"Inf. Comput."},{"key":"1264_CR5","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press (2019). https:\/\/doi.org\/10.1017\/9781107415157","DOI":"10.1017\/9781107415157"},{"key":"1264_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-024-01264-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-024-01264-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-024-01264-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T05:02:15Z","timestamp":1728795735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-024-01264-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,3]]},"references-count":6,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["1264"],"URL":"https:\/\/doi.org\/10.1007\/s00453-024-01264-x","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2850290\/v1","asserted-by":"object"}]},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,3]]},"assertion":[{"value":"23 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}