{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:17Z","timestamp":1770972377003,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031522123","type":"print"},{"value":"9783031522130","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52213-0_9","type":"book-chapter","created":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:02:29Z","timestamp":1705140149000},"page":"117-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Semi-total Domination in\u00a0Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Sasmita","family":"Rout","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam Kumar","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,14]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.dam.2018.11.023","volume":"258","author":"J Asplund","year":"2019","unstructured":"Asplund, J., Davila, R., Krop, E.: A Vizing-type result for semi-total domination. Discret. Appl. Math. 258, 8\u201312 (2019)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T Biedl","year":"1998","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159\u2013180 (1998)","journal-title":"Comput. Geom."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2014.01.023","volume":"540","author":"GD da Fonseca","year":"2014","unstructured":"da Fonseca, G.D., de Figueiredo, C.M., de S\u00e1, V.G.P., Machado, R.C.: Efficient sub-5 approximations for minimum dominating sets in unit disk graphs. Theoret. Comput. Sci. 540, 70\u201381 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2020.01.007","volume":"814","author":"E Galby","year":"2020","unstructured":"Galby, E., Munaro, A., Ries, B.: Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width. Theoret. Comput. Sci. 814, 28\u201348 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Goddard, W., Henning, M.A., McPillan, C.A.: Semitotal domination in graphs. Utilitas Math. 94 (2014)","DOI":"10.1016\/j.disc.2014.01.021"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/1024022","volume":"24","author":"J Hartmanis","year":"1982","unstructured":"Hartmanis, J.: Computers and intractability: a guide to the theory of NP-completeness (M. R. Garey and D. S. Johnson). SIAM Rev. 24(1), 90 (1982)","journal-title":"SIAM Rev."},{"key":"9_CR7","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (1998)"},{"key":"9_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51117-3","volume-title":"Topics in Domination in Graphs","author":"TW Haynes","year":"2020","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: Topics in Domination in Graphs. Springer, Cham (2020)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0167-5060(08)71054-9","volume":"48","author":"ST Hedetniemi","year":"1991","unstructured":"Hedetniemi, S.T., Laskar, R.C.: Bibliography on domination in graphs and some basic definitions of domination parameters. Ann. Discret. Math. 48, 257\u2013277 (1991)","journal-title":"Ann. Discret. Math."},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","volume":"309","author":"MA Henning","year":"2009","unstructured":"Henning, M.A.: A survey of selected recent results on total domination in graphs. Discret. Math. 309(1), 32\u201363 (2009)","journal-title":"Discret. Math."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s00026-016-0331-z","volume":"20","author":"MA Henning","year":"2016","unstructured":"Henning, M.A., Marcon, A.J.: Semitotal domination in claw-free cubic graphs. Ann. Comb. 20, 799\u2013813 (2016)","journal-title":"Ann. Comb."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2018.09.019","volume":"766","author":"MA Henning","year":"2019","unstructured":"Henning, M.A., Pandey, A.: Algorithmic aspects of semitotal domination in graphs. Theoret. Comput. Sci. 766, 46\u201357 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6","volume-title":"Total Domination in Graphs","author":"MA Henning","year":"2013","unstructured":"Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer, New York (2013)"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"MV Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt, H.B., III., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25(2), 59\u201368 (1995)","journal-title":"Networks"},{"key":"9_CR16","unstructured":"Marcon, A.J.: Semitotal domination in graphs. University of Johannesburg (2015)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11671411_23","volume-title":"Approximation and Online Algorithms","author":"T Nieberg","year":"2006","unstructured":"Nieberg, T., Hurink, J.: A PTAS for the minimum dominating set problem in unit disk graphs. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 296\u2013306. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11671411_23"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.5614\/ejgta.2020.8.2.16","volume":"8","author":"A Poureidi","year":"2020","unstructured":"Poureidi, A.: Total roman domination for proper interval graphs. Electron. J. Graph Theory Appl. (EJGTA) 8(2), 401\u2013413 (2020)","journal-title":"Electron. J. Graph Theory Appl. (EJGTA)"},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"100","author":"LG Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comput. 100(2), 135\u2013140 (1981)","journal-title":"IEEE Trans. Comput."}],"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-52213-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:22:20Z","timestamp":1768281740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52213-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031522123","9783031522130"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52213-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"14 January 2024","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":"Bhilai","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.iitbhilai.ac.in\/caldam2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}