{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:13:30Z","timestamp":1743128010259,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030866525"},{"type":"electronic","value":"9783030866532"}],"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-86653-2_46","type":"book-chapter","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T21:45:47Z","timestamp":1631223947000},"page":"631-646","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Domination and Independent Domination Problems in 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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8402-7128","authenticated-orcid":false,"given":"Jong-Shin","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.disc.2017.08.025","volume":"341","author":"G Abrishami","year":"2018","unstructured":"Abrishami, G., Henning, M.A.: Independent domination in subcubic graphs of girth at least six. Discrete Math. 341, 155\u2013164 (2018)","journal-title":"Discrete Math."},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"841","DOI":"10.7151\/dmgt.2105","volume":"39","author":"G Abrishami","year":"2019","unstructured":"Abrishami, G., Henning, M.A., Bahbarnia, F.: On independent domination in planar cubic graphs. Discuss. Math. Graph Theory 39, 841\u2013853 (2019)","journal-title":"Discuss. Math. Graph Theory"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0012-365X(78)90105-X","volume":"23","author":"RB Allan","year":"1978","unstructured":"Allan, R.B., Laskar, R.: On domination and independent domination numbers of a graph. Discrete Math. 23, 73\u201376 (1978)","journal-title":"Discrete Math."},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.akcej.2018.08.005","volume":"16","author":"ST Bhangale","year":"2019","unstructured":"Bhangale, S.T., Pawar, M.M.: Isolate and independent domination number of some classes of graphs. AKCE Intern. J. Graphs Combin. 16, 110\u2013115 (2019)","journal-title":"AKCE Intern. J. Graphs Combin."},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0304-3975(02)00586-8","volume":"301","author":"R Boliac","year":"2003","unstructured":"Boliac, R., Lozin, V.: Independent domination in finitely defined classes of graphs. Theoret. Comput. Sci. 301, 271\u2013284 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2013.01.009","volume":"511","author":"BM Bui-Xuan","year":"2013","unstructured":"Bui-Xuan, B.M., Telle, J.A., Vatshelle, M.: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theoret. Comput. Sci. 511, 66\u201376 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"46_CR7","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1137\/S0097539792238431","volume":"27","author":"MS Chang","year":"1998","unstructured":"Chang, M.S.: Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput. 27, 1671\u20131694 (1998)","journal-title":"SIAM J. Comput."},{"key":"46_CR8","unstructured":"Chang, T.Y.: Domination numbers of grid graphs. Ph.D. thesis, University of South Florida, Tampa, FL (1992)"},{"key":"46_CR9","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 Combin. 38, 97\u2013112 (1994)","journal-title":"Ars Combin."},{"key":"46_CR10","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. Discrete Math. 86, 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"DG Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discrete Appl. Math. 9, 27\u201339 (1984)","journal-title":"Discrete Appl. Math."},{"key":"46_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33, 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"46_CR13","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1016\/j.disc.2015.02.015","volume":"338","author":"S Crevals","year":"2015","unstructured":"Crevals, S., \u00d6sterg\u00e5rd, P.R.J.: Independent domination of grids. Discrete Math. 338, 1379\u20131384 (2015)","journal-title":"Discrete Math."},{"key":"46_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"36","author":"P Damaschke","year":"1990","unstructured":"Damaschke, P., Muller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inform. Process. Lett. 36, 231\u2013236 (1990)","journal-title":"Inform. Process. Lett."},{"key":"46_CR15","unstructured":"Gagnon, A., et al.: A method for eternally dominating strong grids. Discrete Math. Theoret. Comput. Sci. 22(1), #8 (2020)"},{"key":"46_CR16","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":"46_CR17","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. Discrete Math. 313, 839\u2013854 (2013)","journal-title":"Discrete Math."},{"key":"46_CR18","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. Discrete Math. 25, 1443\u20131453 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"46_CR19","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. Combin. Math. Combin. Comput. 49, 215\u2013220 (2004)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"46_CR20","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10878-019-00409-x","volume":"38","author":"M Hajian","year":"2019","unstructured":"Hajian, M., Henning, M.A., Jafari Rad, N.: A new lower bound on the domination number of a graph. J. Comb. Optim. 38, 721\u2013738 (2019)","journal-title":"J. Comb. Optim."},{"key":"46_CR21","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":"46_CR22","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":"46_CR23","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. Theoret. Comput. Sci. 602, 132\u2013148 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"46_CR24","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. Discrete Appl. Math. 211, 99\u2013112 (2016)","journal-title":"Discrete Appl. Math."},{"key":"46_CR25","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. Discrete Optim. 26, 41\u201365 (2017)","journal-title":"Discrete Optim."},{"issue":"4","key":"46_CR26","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":"46_CR27","first-page":"378","volume":"47","author":"F Keshavarz-Kohjerdi","year":"2020","unstructured":"Keshavarz-Kohjerdi, F., Hung, R.W.: The Hamiltonicity, Hamiltonian connectivity, and longest $$(s, t)$$-path of $$L$$-shaped supergrid graphs. IAENG Intern. J. Comput. Sci. 47, 378\u2013391 (2020)","journal-title":"IAENG Intern. J. Comput. Sci."},{"key":"46_CR28","unstructured":"Klobuc\u0306ar, A.: Independent sets and independent dominating sets in the strong product of paths and cycles. Math. Commun. 10, 23\u201330 (2005)"},{"key":"46_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.09.001","volume":"562","author":"CH Liu","year":"2015","unstructured":"Liu, C.H., Poon, S.H., Lin, J.Y.: Independent dominating set problem revisited. Theoret. Comput. Sci. 562, 1\u201322 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"46_CR30","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0012-365X(91)90473-F","volume":"96","author":"J Topp","year":"1991","unstructured":"Topp, J., Volkmann, L.: On graphs with equal domination and independent domination numbers. Discrete Math. 96, 75\u201380 (1991)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86653-2_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T17:55:08Z","timestamp":1632506108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86653-2_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030866525","9783030866532"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86653-2_46","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":"9 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cagliari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","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":"Customed version of CyberChair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1588","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":"466","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":"18","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":"29% - 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,5","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":"8","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)"}}]}}