{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:09Z","timestamp":1740122409521,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Department of Science and Technology India","award":["ECR\/2017\/001442"],"award-info":[{"award-number":["ECR\/2017\/001442"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10878-022-00884-9","type":"journal-article","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T19:45:22Z","timestamp":1658519122000},"page":"1221-1247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy"],"prefix":"10.1007","volume":"44","author":[{"given":"D. H.","family":"Aneesh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5946-1117","authenticated-orcid":false,"given":"A.","family":"Mohanapriya","sequence":"additional","affiliation":[]},{"given":"P.","family":"Renjith","sequence":"additional","affiliation":[]},{"given":"N.","family":"Sadagopan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,22]]},"reference":[{"key":"884_CR1","doi-asserted-by":"crossref","unstructured":"Booth KS, Lueker GS (1975) Linear algorithms to recognize interval graphs and test for the consecutive ones property. In: Proceedings of the seventh annual ACM symposium on Theory of computing. pp255\u2013265","DOI":"10.1145\/800116.803776"},{"issue":"1","key":"884_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10878-015-9917-3","volume":"32","author":"H Chen","year":"2016","unstructured":"Chen H, Lei Z, Liu T, Tang Z, Wang C, Ke X (2016) Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs. J Comb Optim 32(1):95\u2013110","journal-title":"J Comb Optim"},{"issue":"1\u20133","key":"884_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(90)90359-P","volume":"86","author":"CJ Colbourn","year":"1990","unstructured":"Colbourn CJ, Stewart LK (1990) Permutation graphs: connected domination and Steiner trees. Discrete Math 86(1\u20133):179\u2013189","journal-title":"Discrete Math"},{"key":"884_CR4","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT press, Cambridge"},{"key":"884_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan M, Fomin FV, Kowalik \u0141, Lokshtanov D, Marx D, Pilipczuk M, Pilipczuk M, Saurabh S (2015) Parameterized algorithms. Springer, Cham"},{"issue":"5","key":"884_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"36","author":"P Damaschke","year":"1990","unstructured":"Damaschke P, M\u00fcller H, Kratsch D (1990) Domination in convex and chordal bipartite graphs. Inf Process Lett 36(5):231\u2013236","journal-title":"Inf Process Lett"},{"issue":"3","key":"884_CR7","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1137\/0217032","volume":"17","author":"A D\u2019Atri","year":"1988","unstructured":"D\u2019Atri A, Moscarini M (1988) Distance-hereditary graphs, Steiner trees, and connected domination. SIAM J Comput 17(3):521\u2013538","journal-title":"SIAM J Comput"},{"key":"884_CR8","doi-asserted-by":"crossref","unstructured":"Dom M, Lokshtanov D, Saurabh S (2009) Incompressibility through colors and IDs. In: International colloquium on automata, languages, and programming. Springer. 378\u2013389","DOI":"10.1007\/978-3-642-02927-1_32"},{"issue":"3","key":"884_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Dreyfus","year":"1971","unstructured":"Dreyfus SE, Wagner RA (1971) The Steiner problem in graphs. Networks 1(3):195\u2013207","journal-title":"Networks"},{"key":"884_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman & Co, New York"},{"issue":"4","key":"884_CR11","doi-asserted-by":"publisher","first-page":"294","DOI":"10.5539\/mas.v9n4p294","volume":"9","author":"DR Grigoreva","year":"2015","unstructured":"Grigoreva DR, Faizullina AG, Basyrov RR, Sharipov RS (2015) Use of Steiner problem in solving practical problems of road construction. Modern Appl Sci 9(4):294","journal-title":"Modern Appl Sci"},{"issue":"3","key":"884_CR12","first-page":"382","volume":"41","author":"FK Hwang","year":"1995","unstructured":"Hwang FK, Richards DS, Winter P, Widmayer P (1995) The Steiner tree problem, annals of discrete mathematics. ZOR-Methods Models Oper Res 41(3):382","journal-title":"ZOR-Methods Models Oper Res"},{"issue":"1","key":"884_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0196-6774(92)90012-2","volume":"13","author":"T Kashiwabara","year":"1992","unstructured":"Kashiwabara T, Masuda S, Nakajima K, Fujisawa T (1992) Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph. J Algorithms 13(1):161\u2013174","journal-title":"J Algorithms"},{"issue":"2","key":"884_CR14","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"S Louis Hakimi","year":"1971","unstructured":"Louis Hakimi S (1971) Steiner\u2019s problem in graphs and its implications. Networks 1(2):113\u2013133","journal-title":"Networks"},{"key":"884_CR15","volume-title":"Algorithmic graph theory and perfect graphs","author":"Martin Charles Golumbic","year":"2004","unstructured":"Martin Charles Golumbic (2004) Algorithmic graph theory and perfect graphs. Elsevier, Amsterdam"},{"issue":"2","key":"884_CR16","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/opre.6.2.232","volume":"6","author":"W Miehle","year":"1958","unstructured":"Miehle W (1958) Link-length minimization in networks. Oper Res 6(2):232\u2013243","journal-title":"Oper Res"},{"issue":"2\u20133","key":"884_CR17","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","volume":"53","author":"H M\u00fcller","year":"1987","unstructured":"M\u00fcller H, Brandst\u00e4dt A (1987) The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs. Theoret Comput Sci 53(2\u20133):257\u2013265","journal-title":"Theoret Comput Sci"},{"key":"884_CR18","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.dam.2018.05.050","volume":"280","author":"P Renjith","year":"2020","unstructured":"Renjith P, Sadagopan N (2020) The Steiner tree in $$K_{1, r}$$-free split graphs-A Dichotomy. Discret Appl Math 280:246\u2013255","journal-title":"Discret Appl Math"},{"key":"884_CR19","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory. Prentice hall, Hoboken"},{"issue":"1","key":"884_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230150109","volume":"15","author":"K White","year":"1985","unstructured":"White K, Farber M, Pulleyblank W (1985) Steiner trees, connected domination and strongly chordal graphs. Networks 15(1):109\u2013124","journal-title":"Networks"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00884-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00884-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00884-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T06:16:34Z","timestamp":1660371394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00884-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,22]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["884"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00884-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,7,22]]},"assertion":[{"value":"27 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2022","order":2,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}