{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:55:12Z","timestamp":1742925312528,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_6","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"59-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["1-Complex s,\u00a0t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids"],"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":[[2022,3,16]]},"reference":[{"issue":"1\u20133","key":"6_CR1","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":"6_CR2","unstructured":"Everett, H.: Hamiltonian paths in nonrectangular grid graphs. Master\u2019s thesis, University of Saskatchewan, Canada (1986)"},{"key":"6_CR3","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":"6_CR4","doi-asserted-by":"publisher","unstructured":"Gorbenko, A., Popov, V., Sheka, A.: Localization on discrete grid graphs. In: He, X., Hua, E., Lin, Y., Liu, X. (eds.) Computer, Informatics, Cybernetics and Applications. LNEE, vol. 107, pp. 971\u2013978. Springer, Dordrecht (2012). https:\/\/doi.org\/10.1007\/978-94-007-1839-5_105","DOI":"10.1007\/978-94-007-1839-5_105"},{"issue":"4","key":"6_CR5","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."},{"key":"6_CR6","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. Theor. 40, 14667\u201314678 (2007)","journal-title":"J. Phys. A Math. Theor."},{"key":"6_CR7","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. Theor. Comput. Sci. 621, 37\u201356 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"6_CR8","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 Prototyp. J. 20(6), 511\u2013522 (2014)","journal-title":"Rapid Prototyp. J."},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-030-79987-8_35","volume-title":"Combinatorial Algorithms","author":"RI Nishat","year":"2021","unstructured":"Nishat, R.I., Srinivasan, V., Whitesides, S.: Reconfiguring simple s,\u00a0t Hamiltonian paths in rectangular grid graphs. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 501\u2013515. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_35"},{"key":"6_CR10","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"},{"key":"6_CR11","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":"6_CR12","unstructured":"Bodroz\u0303a Panti\u0107, O., Panti\u0107, B., Panti\u0107, I., Bodroz\u0303a Solarov, M.: Enumeration of Hamiltonian cycles in some grid graphs. MATCH Commun. Math. Comput. Chem. 70, 181\u2013204 (2013)"},{"issue":"9","key":"6_CR13","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"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:04:38Z","timestamp":1647389078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","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":"89","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":"30","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":"34% - 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","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-9","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 proceedings also include 3 invited papers.","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)"}}]}}