{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:11Z","timestamp":1759637951968,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-89543-3_34","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"401-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Restrained Domination and\u00a0Independent Restrained Domination in Extending Supergrid Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5803-2265","authenticated-orcid":false,"given":"Ruo-Wei","family":"Hung","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8072-8055","authenticated-orcid":false,"given":"Ming-Jung","family":"Chiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"key":"34_CR1","first-page":"97","volume":"38","author":"TY Chang","year":"1994","unstructured":"Chang, T.Y., Clark, W.E., Hare, E.O.: Domination numbers of complete grids I. Ars Comb. 38, 97\u2013112 (1994)","journal-title":"Ars Comb."},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discret. Math. 86, 165\u2013177 (1990)","journal-title":"Discret. Math."},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0012-365X(99)00016-3","volume":"203","author":"GS Domke","year":"1999","unstructured":"Domke, G.S., Hattingh, J.H., Hedetniemi, S.T., Laskar, R.C., Markus, L.R.: Restrained domination in graphs. Discret. Math. 203, 61\u201369 (1999)","journal-title":"Discret. Math."},{"key":"34_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1137\/11082574","volume":"25","author":"D Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, D., Pinlou, A., Rao, M., Thomass\u00e9, A.: The domination number of grids. SIAM J. Discret. Math. 25, 1443\u20131453 (2011)","journal-title":"SIAM J. Discret. Math."},{"key":"34_CR6","first-page":"215","volume":"49","author":"DR Guichard","year":"2004","unstructured":"Guichard, D.R.: A lower bound for the domination number of complete grid graphs. J. Comb. Math. Comb. Comput. 49, 215\u2013220 (2004)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"34_CR7","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"34_CR8","volume-title":"Domination in Graphs: Advanced Topics","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.tcs.2015.08.024","volume":"602","author":"RW Hung","year":"2015","unstructured":"Hung, R.W., Yao, C.C., Chan, S.J.: The Hamiltonian properties of supergrid graphs. Theor. Comput. Sci. 602, 132\u2013148 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.dam.2016.04.020","volume":"211","author":"RW Hung","year":"2016","unstructured":"Hung, R.W.: Hamiltonian cycles in linear-convex supergrid graphs. Discret. Appl. Math. 211, 99\u2013112 (2016)","journal-title":"Discret. Appl. Math."},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.disopt.2017.06.001","volume":"26","author":"RW Hung","year":"2017","unstructured":"Hung, R.W., Li, C.F., Chen, J.S., Su, Q.S.: The Hamiltonian connectivity of rectangular supergrid graphs. Discret. Optim. 26, 41\u201365 (2017)","journal-title":"Discret. Optim."},{"key":"34_CR12","first-page":"432","volume":"44","author":"RW Hung","year":"2017","unstructured":"Hung, R.W., Chen, H.D., Zeng, S.C.: The Hamiltonicity and Hamiltonian connectivity of some shaped supergrid graphs. IAENG Int. J. Comput. Sci. 44, 432\u2013444 (2017)","journal-title":"IAENG Int. J. Comput. Sci."},{"key":"34_CR13","first-page":"69","volume":"49","author":"RW Hung","year":"2019","unstructured":"Hung, R.W., Keshavarz-Kohjerdi, F., Lin, C.B., Chen, J.S.: The Hamiltonian connectivity of alphabet supergrid graphs. IAENG Int. J. Appl. Math. 49, 69\u201385 (2019)","journal-title":"IAENG Int. J. Appl. Math."},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Hung, R.W., Chiu, M.J., Chen, J.S.: The domination and independent domination problems in supergrid graphs. In: The 21st International Conference on Computational Science and its Applications (ICCSA 2021), 13\u201316 September, University of Cagliari, Italy (2021, to appear)","DOI":"10.1007\/978-3-030-86653-2_46"},{"issue":"4","key":"34_CR15","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamiltonian paths in grid graphs. SIAM J. Comput. 11(4), 676\u2013686 (1982)","journal-title":"SIAM J. Comput."},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.26708\/IJMSC.2015.2.5.21","volume":"5","author":"C Sivagnanam","year":"2015","unstructured":"Sivagnanam, C., Kulandaivel, M.P.: Extended results on restrained domination number and connectivity of a graph. Int. J. Math. Soft Comput. 5, 183\u2013187 (2015)","journal-title":"Int. J. Math. Soft Comput."},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"JA Telle","year":"1997","unstructured":"Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial $$k$$-trees. SIAM J. Discret. Math. 10, 529\u2013550 (1997)","journal-title":"SIAM J. Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89543-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:16:42Z","timestamp":1634782602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_34","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":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","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":"56","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":"43% - 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.1","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.2","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)"}}]}}