{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:57:31Z","timestamp":1768316251079,"version":"3.49.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030950170","type":"print"},{"value":"9783030950187","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95018-7_10","type":"book-chapter","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:04Z","timestamp":1642982704000},"page":"115-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["P Versus NPC: Minimum Steiner Trees in Convex Split Graphs"],"prefix":"10.1007","author":[{"given":"A.","family":"Mohanapriya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Renjith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Sadagopan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Renjith, P., Sadagopan, N.: The Steiner tree in $$K_{1, r}$$-free split graphs-a Dichotomy. Discrete Appl. Math. 280, 246\u2013255 (2020)","DOI":"10.1016\/j.dam.2018.05.050"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"M\u00fcller, H., Brandst\u00e4dt, A.: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs. Theoretical Comput. Sci. 53(2\u20133), 257\u2013265 (1987)","DOI":"10.1016\/0304-3975(87)90067-3"},{"issue":"1","key":"10_CR3","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.: Steiner trees, connected domination and strongly chordal graphs. Networks 15(1), 109\u2013124 (1985)","journal-title":"Networks"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Joseph, A.W., Charles, J.C.: Steiner trees, partial 2-trees, and minimum ifi networks. Networks 13(2), 159\u2013167 (1983)","DOI":"10.1002\/net.3230130202"},{"key":"10_CR5","unstructured":"Joseph, A.W., Charles, J.C.: Steiner trees in outerplanar graphs. In: Proceedings of 13th Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp. 15\u201322 (1982)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Chimani, M., Mutzel, P., Zey, B.: Improved steiner tree algorithms for bounded treewidth. J. Discr. Algorith. 16, 67\u201378 (2012)","DOI":"10.1016\/j.jda.2012.04.016"},{"key":"10_CR7","unstructured":"Mohanapriya, A., Renjith, P., Sadagopan, N., et al.: Steiner tree in $$ k $$-star caterpillar convex bipartite graphs-a dichotomy. arXiv preprint arXiv:2107.09382, 2021"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Pandey, A., Panda, B.S.: Domination in some subclasses of bipartite graphs. Discr. Appl. Math. 252, 51\u201366 (2019)","DOI":"10.1016\/j.dam.2018.03.029"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Chen, H., Lei, Z., Liu, T., Tang, Z., Wang, C., Xu, K.: Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs. J. Combin. Optim., 1\u201316 (2015). https:\/\/doi.org\/10.1007\/s10878-015-9917-3","DOI":"10.1007\/s10878-015-9917-3"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Damaschke, P., M\u00fcller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inf. Proc. Lett. 36(5), 231\u2013236 (1990)","DOI":"10.1016\/0020-0190(90)90147-P"},{"key":"10_CR11","unstructured":"Michael, R.G.: Computers and intractability: a guide to the theory of NP-Completeness. WH Freeman and Co., (1979)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Stuart, E.D., Robert, A.W.: The Steiner problem in graphs. Networks 1(3), 195\u2013207 (1971)","DOI":"10.1002\/net.3230010302"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and ids. In: International Colloquium on Automata, Languages, and Programming, pp. 378\u2013389. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_32","DOI":"10.1007\/978-3-642-02927-1_32"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Ashok, P., Kolay, S., Misra, N., Saurabh, S.: Unique covering problems with geometric Sets. In: Xu, D., Du, D., Du, D. (eds.) Computing and Combinatorics. COCOON 2015. LNCS, vol. 9198. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21398-9_43","DOI":"10.1007\/978-3-319-21398-9_43"},{"key":"10_CR15","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT Press (2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95018-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:06:29Z","timestamp":1642982789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95018-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030950170","9783030950187"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95018-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puducherry","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acsdm.org\/caldam\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}