{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T08:55:47Z","timestamp":1744620947575,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030678982"},{"type":"electronic","value":"9783030678999"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67899-9_5","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"55-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Semitotal Domination on AT-Free Graphs and Circle Graphs"],"prefix":"10.1007","author":[{"given":"Ton","family":"Kloks","sequence":"first","affiliation":[]},{"given":"Arti","family":"Pandey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"key":"5_CR1","volume-title":"Fundamentals of Domination in Graphs","author":"T Haynes","year":"1998","unstructured":"Haynes, T., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs, vol. 208. Marcel Dekker Inc., New York (1998)"},{"key":"5_CR2","volume-title":"Domination in Graphs: Advanced Topics","author":"T Haynes","year":"1998","unstructured":"Haynes, T., Hedetniemi, S., Slater, P.: Domination in Graphs: Advanced Topics, vol. 209. Marcel Dekker Inc., New York (1998)"},{"key":"5_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5242-3","volume-title":"Connected Dominating Set: Theory and Applications","author":"D Du","year":"2013","unstructured":"Du, D., Wan, P.: Connected Dominating Set: Theory and Applications. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-5242-3"},{"key":"5_CR4","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). https:\/\/doi.org\/10.1007\/978-1-4614-6525-6"},{"key":"5_CR5","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. Discrete Math. 309, 32\u201363 (2009)","journal-title":"Discrete Math."},{"key":"5_CR6","first-page":"67","volume":"94","author":"W Goddard","year":"2014","unstructured":"Goddard, W., Henning, M.A., McPillan, C.A.: Semitotal domination in graphs. Util. Math. 94, 67\u201381 (2014)","journal-title":"Util. Math."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.disc.2014.01.021","volume":"324","author":"MA Henning","year":"2014","unstructured":"Henning, M.A., Marcon, A.J.: On matching and semitotal domination in graphs. Discrete Math. 324, 13\u201318 (2014)","journal-title":"Discrete Math."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.7151\/dmgt.1844","volume":"36","author":"MA Henning","year":"2016","unstructured":"Henning, M.A., Marcon, A.J.: Vertices contained in all or in no minimum semitotal dominating set of a tree. Discuss. Math. Graph Theory 36, 71\u201393 (2016)","journal-title":"Discuss. Math. Graph Theory"},{"key":"5_CR9","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. Combin. 20, 799\u2013813 (2016)","journal-title":"Ann. Combin."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s00373-017-1769-4","volume":"33","author":"MA Henning","year":"2017","unstructured":"Henning, M.A.: Edge weighting functions on semitotal dominating sets. Graphs Combin. 33, 403\u2013417 (2017)","journal-title":"Graphs Combin."},{"key":"5_CR11","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 graphs. Theor. Comput. Sci. 766, 46\u201357 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR12","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, D.: Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width. Theor. Comput. Sci. 814, 28\u201348 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"DG Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discrete Math. 10, 399\u2013430 (1997)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR14","first-page":"71","volume":"13","author":"P Duchet","year":"1982","unstructured":"Duchet, P., Meyneil, H.: On hadwiger\u2019s number and the stability number. Discrete Math. 13, 71\u201374 (1982)","journal-title":"Discrete Math."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0166-218X(99)00128-6","volume":"99","author":"D Kratsch","year":"2000","unstructured":"Kratsch, D.: Domination and total domination on asteroidal-triple free graphs. Discrete Appl. Math. 99, 111\u2013123 (2000)","journal-title":"Discrete Appl. Math."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0166-218X(93)90178-Q","volume":"42","author":"J Keil","year":"1993","unstructured":"Keil, J.: The complexity of domination problems in circle graphs. Discrete Appl. Math. 42, 51\u201363 (1993)","journal-title":"Discrete Appl. Math."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0166-218X(93)90222-A","volume":"44","author":"E Elmallah","year":"1993","unstructured":"Elmallah, E., Stewart, L.: Independence and domination in polygon graphs. Discrete Math. 44, 65\u201377 (1993)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67899-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:06:16Z","timestamp":1611792376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","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":"Rupnagar","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","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":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","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":"39","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":"48% - 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":"2,8","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":"2,21","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)"}}]}}