{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T07:51:33Z","timestamp":1746085893945,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_41","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"463-475","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Hamiltonian Path Graph is Connected for Simple s,\u00a0t Paths in Rectangular Grid Graphs"],"prefix":"10.1007","author":[{"given":"Rahnuma Islam","family":"Nishat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"3","key":"41_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/S0097539703434267","volume":"35","author":"EM Arkin","year":"2005","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. SIAM J. Comput. 35(3), 531\u2013566 (2005)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"41_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1111\/cgf.14488","volume":"41","author":"A Bedel","year":"2022","unstructured":"Bedel, A., Coudert-Osmont, Y., Mart\u00ednez, J., Nishat, R.I., Whitesides, S., Lefebvre, S.: Closed space-filling curves with controlled orientation for 3D printing. Comput. Graph. Forum 41(2), 473\u2013492 (2022)","journal-title":"Comput. Graph. Forum"},{"issue":"1\u20133","key":"41_CR3","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":"41_CR4","unstructured":"Everett, H.: Hamiltonian paths in nonrectangular grid graphs. Master\u2019s thesis, University of Saskatchewan, Canada (1986)"},{"key":"41_CR5","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":"41_CR6","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":"41_CR7","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":"41_CR8","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":"41_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":"41_CR10","unstructured":"Lignos, I.: Reconfigurations of Combinatorial Problems: Graph Colouring and Hamiltonian Cycle. Ph.D. thesis, Durham University (2017)"},{"key":"41_CR11","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, t 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":"41_CR12","doi-asserted-by":"publisher","unstructured":"Nishat, R.I., Srinivasan, V., Whitesides, S.: 1-complex s, t Hamiltonian paths: structure and reconfiguration in rectangular grids. In: Mutzel, P., Rahman, M.S., Slamin (eds.) WALCOM 2022. LNCS, vol. 13174, pp. 59\u201370. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-96731-4_6","DOI":"10.1007\/978-3-030-96731-4_6"},{"key":"41_CR13","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":"41_CR14","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"},{"issue":"9","key":"41_CR15","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"},{"issue":"4","key":"41_CR16","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","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:05:57Z","timestamp":1680213957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_41","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":"1 January 2023","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":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"12","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":"39% - 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":"5","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)"}}]}}