{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:49Z","timestamp":1740122389162,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T00:00:00Z","timestamp":1707696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T00:00:00Z","timestamp":1707696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100005276","name":"National Board for Higher Mathematics","doi-asserted-by":"publisher","award":["02011\/24\/2023\/6051"],"award-info":[{"award-number":["02011\/24\/2023\/6051"]}],"id":[{"id":"10.13039\/501100005276","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10878-024-01105-1","type":"journal-article","created":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T20:02:32Z","timestamp":1707768152000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On convexity in split graphs: complexity of Steiner tree and domination"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5946-1117","authenticated-orcid":false,"given":"A.","family":"Mohanapriya","sequence":"first","affiliation":[]},{"given":"P.","family":"Renjith","sequence":"additional","affiliation":[]},{"given":"N.","family":"Sadagopan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,12]]},"reference":[{"issue":"7","key":"1105_CR1","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"FN Abu-Khzam","year":"2010","unstructured":"Abu-Khzam FN (2010) A kernelization algorithm for d-hitting set. J Comput Syst Sci 76(7):524\u2013531","journal-title":"J Comput Syst Sci"},{"key":"1105_CR2","doi-asserted-by":"crossref","unstructured":"Ashok P, Kolay S, Misra N, Saurabh S (2015) Unique covering problems with geometric sets. In: International computing and combinatorics conference. Springer, pp 548\u2013558","DOI":"10.1007\/978-3-319-21398-9_43"},{"key":"1105_CR3","doi-asserted-by":"crossref","unstructured":"Bonomo-Braberman F, Brettell N, Munaro A, Paulusma D (2021) Solving problems on generalized convex graphs via mim-width. In: Workshop on algorithms and data structures. Springer, pp 200\u2013214","DOI":"10.1007\/978-3-030-83508-8_15"},{"issue":"1","key":"1105_CR4","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"},{"key":"1105_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jda.2012.04.016","volume":"16","author":"M Chimani","year":"2012","unstructured":"Chimani M, Mutzel P, Zey B (2012) Improved Steiner tree algorithms for bounded treewidth. J Discrete Algorithms 16:67\u201378","journal-title":"J Discrete Algorithms"},{"key":"1105_CR6","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"},{"issue":"5","key":"1105_CR7","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"},{"key":"1105_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, pp 378\u2013389","DOI":"10.1007\/978-3-642-02927-1_32"},{"issue":"3","key":"1105_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":"1105_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"R Garey Michael","year":"1979","unstructured":"Garey Michael R (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman & Co, New york"},{"key":"1105_CR11","doi-asserted-by":"crossref","unstructured":"Jiang W, Liu T, Ren T, Xu K (2011) Two hardness results on feedback vertex sets. In: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Springer, pp 233\u2013243","DOI":"10.1007\/978-3-642-21204-8_26"},{"key":"1105_CR12","doi-asserted-by":"crossref","unstructured":"Jiang W, Liu T, Xu K (2011) Tractable feedback vertex sets in restricted bipartite graphs. In: International conference on combinatorial optimization and applications. Springer, pp 424\u2013434","DOI":"10.1007\/978-3-642-22616-8_33"},{"key":"1105_CR13","unstructured":"Mohanapriya A, Renjith P, Sadagopan N, et\u00a0al. (2021) Steiner tree in $$ k $$-star caterpillar convex bipartite graphs\u2014a dichotomy. arXiv preprint arXiv:2107.09382"},{"issue":"2\u20133","key":"1105_CR14","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. Theor Comput Sci 53(2\u20133):257\u2013265","journal-title":"Theor Comput Sci"},{"key":"1105_CR15","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.tcs.2021.06.031","volume":"885","author":"BS Panda","year":"2021","unstructured":"Panda BS, Juhi C (2021) Dominating induced matching in some subclasses of bipartite graphs. Theor Comput Sci 885:104\u2013115","journal-title":"Theor Comput Sci"},{"key":"1105_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.dam.2018.03.029","volume":"252","author":"A Pandey","year":"2019","unstructured":"Pandey A, Panda BS (2019) Domination in some subclasses of bipartite graphs. Discret Appl Math 252:51\u201366","journal-title":"Discret Appl Math"},{"issue":"2","key":"1105_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-007-9148-9","volume":"52","author":"V Raman","year":"2008","unstructured":"Raman V, Saurabh S (2008) Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica 52(2):203\u2013225","journal-title":"Algorithmica"},{"key":"1105_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. Discrete Appl Math 280:246\u2013255","journal-title":"Discrete Appl Math"},{"key":"1105_CR19","unstructured":"Wald JA, Colbourn CJ (1982) Steiner trees in outerplanar graphs. In: Proc. 13th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, pp 15\u201322"},{"issue":"2","key":"1105_CR20","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"JA Wald","year":"1983","unstructured":"Wald JA, Colbourn CJ (1983) Steiner trees, partial 2-trees, and minimum IFI networks. Networks 13(2):159\u2013167","journal-title":"Networks"},{"issue":"1","key":"1105_CR21","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-024-01105-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01105-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01105-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T23:13:34Z","timestamp":1710285214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01105-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,12]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1105"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01105-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,2,12]]},"assertion":[{"value":"3 January 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2024","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 have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"8"}}