{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:27:53Z","timestamp":1742923673109,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031834370"},{"type":"electronic","value":"9783031834387"}],"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-3-031-83438-7_20","type":"book-chapter","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:26Z","timestamp":1738706186000},"page":"234-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bipartite Domination in\u00a0Graphs: Complexity and\u00a0Algorithms"],"prefix":"10.1007","author":[{"given":"Bhawani Sankar","family":"Panda","sequence":"first","affiliation":[]},{"given":"Subhasmita","family":"Joshi","sequence":"additional","affiliation":[]},{"given":"Dalu","family":"Jacob","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1556\/314.2023.00003","volume":"29","author":"A Bachstein","year":"2023","unstructured":"Bachstein, A., Goddard, W.: The lower bipartite number of a graph. Math. Pannon. 29(1), 49\u201356 (2023)","journal-title":"Math. Pannon."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1556\/314.2022.00015","volume":"28","author":"A Bachstein","year":"2022","unstructured":"Bachstein, A., Goddard, W., Henning, M.: Bipartite domination in graphs. Math. Pannon. 28, 118\u2013126 (2022)","journal-title":"Math. Pannon."},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"AA Bertossi","year":"1984","unstructured":"Bertossi, A.A.: Dominating sets for split and bipartite graphs. Inf. Process. Lett. 19(1), 37\u201340 (1984)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"20_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/net.3230100304","volume":"10","author":"EJ Cockayne","year":"1980","unstructured":"Cockayne, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Networks 10(3), 211\u2013219 (1980)","journal-title":"Networks"},{"key":"20_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2022","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT press, Cambridge (2022)"},{"issue":"7","key":"20_CR6","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1016\/j.disc.2012.11.031","volume":"313","author":"W Goddard","year":"2013","unstructured":"Goddard, W., Henning, M.A.: Independent domination in graphs: a survey and recent results. Disc. Math. 313(7), 839\u2013854 (2013)","journal-title":"Disc. Math."},{"key":"20_CR7","doi-asserted-by":"publisher","DOI":"10.1201\/9781482246582","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"2013","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (2013)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.): Topics in Domination in Graphs. DM, vol. 64. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-51117-3"},{"key":"20_CR9","volume-title":"Domination in Graphs: Advanced Topics","author":"ST Hedetniemi","year":"1998","unstructured":"Hedetniemi, S.T., Haynes, T.W., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)"},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"20_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.9734\/arjom\/2023\/v19i5658","volume":"19","author":"WP Pelias","year":"2023","unstructured":"Pelias, W.P., Cabahug, I.S., Jr.: Bipartite domination number of mycielski graph of some graph families. Asian Res. J. Math. 19(5), 41\u201350 (2023)","journal-title":"Asian Res. J. Math."},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","first-page":"8","DOI":"10.9734\/arjom\/2023\/v19i3645","volume":"19","author":"WP Pelias","year":"2023","unstructured":"Pelias, W.P., Cabahug, I.S., Jr.: Bipartite domination in some classes of graphs. Asian Res. J. Math. 19(3), 8\u201317 (2023)","journal-title":"Asian Res. J. Math."}],"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-031-83438-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:30Z","timestamp":1738706190000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83438-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031834370","9783031834387"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83438-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 February 2025","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":"Coimbatore","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam-2025-website.vercel.app\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}