{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:56:08Z","timestamp":1742957768247,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"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-79987-8_35","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"501-515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Reconfiguring Simple s,\u00a0t Hamiltonian Paths in Rectangular Grid Graphs"],"prefix":"10.1007","author":[{"given":"Rahnuma Islam","family":"Nishat","sequence":"first","affiliation":[]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"35_CR1","unstructured":"Arkin, E.M., Bender, M.A., Demaine, E.D., Fekete, S.P., Mitchell, J.S.B., Sethia, S.: Optimal covering tours with turn costs. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2001, pp. 138\u2013147. Society for Industrial and Applied Mathematics, Philadelphia (2001)"},{"issue":"1\u20133","key":"35_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(95)00330-Y","volume":"169","author":"KL Collins","year":"1997","unstructured":"Collins, K.L., Krompart, L.B.: The number of Hamiltonian paths in a rectangular grid. Discrete Math. 169(1\u20133), 29\u201338 (1997)","journal-title":"Discrete Math."},{"key":"35_CR3","unstructured":"Everett, H.: Hamiltonian paths in nonrectangular grid graphs. Master\u2019s thesis, University of Saskatchewan, Canada (1986)"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-16926-7_13","volume-title":"Graph Theoretic Concepts in Computer Science","author":"M Fellows","year":"2010","unstructured":"Fellows, M., et al.: Milling a graph with turn costs: a parameterized complexity perspective. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 123\u2013134. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16926-7_13"},{"key":"35_CR5","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1007\/978-94-007-1839-5","volume-title":"Computer, Informatics, Cybernetics and Applications","author":"A Gorbenko","year":"2012","unstructured":"Gorbenko, A., Popov, V., Sheka, A.: Localization on discrete grid graphs. In: He, X., Hua, E., Lin, Y., Liu, X. (eds.) CICA 2011. LNEE, vol. 107, pp. 971\u2013978. Springer, Dordrecht (2012). https:\/\/doi.org\/10.1007\/978-94-007-1839-5"},{"issue":"4","key":"35_CR6","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.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676\u2013686 (1982)","journal-title":"SIAM J. Comput."},{"issue":"12","key":"35_CR7","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","volume":"412","author":"T Ito","year":"2011","unstructured":"Ito, T., et al.: On the complexity of reconfiguration problems. Theoret. Comput. Sci. 412(12), 1054\u20131065 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"14667","DOI":"10.1088\/1751-8113\/40\/49\/003","volume":"40","author":"JL Jacobsen","year":"2007","unstructured":"Jacobsen, J.L.: Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions. J. Phys. A Math. Gen. 40, 14667\u201314678 (2007)","journal-title":"J. Phys. A Math. Gen."},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2016.01.024","volume":"621","author":"F Keshavarz-Kohjerdi","year":"2016","unstructured":"Keshavarz-Kohjerdi, F., Bagheri, A.: Hamiltonian paths in L-shaped grid graphs. Theoret. Comput. Sci. 621, 37\u201356 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR10","unstructured":"Lignos, I.: Reconfigurations of combinatorial problems: graph colouring and Hamiltonian cycle. Ph.D. thesis, Durham University (2017)"},{"issue":"6","key":"35_CR11","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1108\/RPJ-01-2013-0011","volume":"20","author":"P Muller","year":"2014","unstructured":"Muller, P., Hascoet, J.Y., Mognol, P.: Toolpaths for additive manufacturing of functionally graded materials (FGM) parts. Rapid Prototyping J. 20(6), 511\u2013522 (2014)","journal-title":"Rapid Prototyping J."},{"key":"35_CR12","unstructured":"Nishat, R.I.: Reconfiguration of Hamiltonian cycles and paths in grid graphs. Ph.D. thesis, University of Victoria, Canada (2020)"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-319-62389-4_37","volume-title":"Computing and Combinatorics","author":"RI Nishat","year":"2017","unstructured":"Nishat, R.I., Whitesides, S.: Bend complexity and Hamiltonian cycles in grid graphs. In: Cao, Y., Chen, J. (eds.) COCOON 2017. LNCS, vol. 10392, pp. 445\u2013456. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62389-4_37"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-030-30786-8_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"RI Nishat","year":"2019","unstructured":"Nishat, R.I., Whitesides, S.: Reconfiguring Hamiltonian cycles in L-shaped grid graphs. In: Sau, I., Thilikos, D.M. (eds.) WG 2019. LNCS, vol. 11789, pp. 325\u2013337. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30786-8_25"},{"issue":"4","key":"35_CR15","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3390\/a11040052","volume":"11","author":"N Nishimura","year":"2018","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52 (2018)","journal-title":"Algorithms"},{"key":"35_CR16","first-page":"181","volume":"70","author":"O Bodroza Panti\u0107","year":"2013","unstructured":"Bodroza Panti\u0107, O., Panti\u0107, B., Panti\u0107, I., Bodroza Solarov, M.: Enumeration of Hamiltonian cycles in some grid graphs. MATCH Commun. Math. Comput. Chem. 70, 181\u2013204 (2013)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"issue":"4","key":"35_CR17","doi-asserted-by":"publisher","first-page":"P4.7","DOI":"10.37236\/4510","volume":"21","author":"V Pettersson","year":"2014","unstructured":"Pettersson, V.: Enumerating Hamiltonian cycles. Electron. J. Comb. 21(4), P4.7 (2014)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"35_CR18","doi-asserted-by":"publisher","first-page":"R1","DOI":"10.37236\/1694","volume":"10","author":"F Ruskey","year":"2003","unstructured":"Ruskey, F., Sawada, J.: Bent Hamilton cycles in $$d$$-dimensional grid graphs. Electron. J. Comb. 10(1), R1 (2003)","journal-title":"Electron. J. Comb."},{"issue":"9","key":"35_CR19","doi-asserted-by":"publisher","first-page":"140","DOI":"10.3390\/a11090140","volume":"11","author":"A Takaoka","year":"2018","unstructured":"Takaoka, A.: Complexity of Hamiltonian cycle reconfiguration. Algorithms 11(9), 140 (2018)","journal-title":"Algorithms"},{"key":"35_CR20","unstructured":"Umans, C., Lenhart, W.: Hamiltonian cycles in solid grid graphs. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, pp. 496\u2013505 (1997)"},{"issue":"4","key":"35_CR21","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1020853410145","volume":"6","author":"S Winter","year":"2002","unstructured":"Winter, S.: Modeling costs of turns in route planning. GeoInformatica 6(4), 345\u2013361 (2002)","journal-title":"GeoInformatica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:15:40Z","timestamp":1625008540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_35","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":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","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":"107","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":"38","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":"36% - 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":"9.1","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)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}