{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T15:10:33Z","timestamp":1688137833840},"reference-count":23,"publisher":"Informa UK Limited","issue":"3","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2023,5,4]]},"DOI":"10.1080\/10556788.2022.2157001","type":"journal-article","created":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T16:56:49Z","timestamp":1672937809000},"page":"591-625","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes"],"prefix":"10.1080","volume":"38","author":[{"given":"Fatemeh","family":"Keshavarz-Kohjerdi","sequence":"first","affiliation":[{"name":"Department of Computer Science, Shahed University, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alireza","family":"Bagheri","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2023,1,5]]},"reference":[{"key":"CIT0001","doi-asserted-by":"crossref","unstructured":"F. Afrati, The Hamilton circuit problem on grids, RAIRO-Theor. Inf. Appl. 28(6) (1994), pp. 567\u2013582.","DOI":"10.1051\/ita\/1994280605671"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2008.11.004"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(02)00135-7"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22508"},{"key":"CIT0005","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey M.R.","year":"1979"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.11.040"},{"key":"CIT0007","unstructured":"K. Hou and J. Lynch, The computational complexity of finding Hamiltonian cycles in grid graphs of semiregular tessellations, in Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG), University of Manitoba, S. Durocher and S. Kamali, eds., Winnipeg, Manitoba, Canada, 2018, pp. 114\u2013128."},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.04.020"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.08.024"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_53"},{"key":"CIT0011","unstructured":"K. Islam, H. Meijer, Y.N. Rodriguez, D. Rappaport, and H. Xiao, Hamiltonian circuits in hexagonal grid graphs, in Proceedings of 19th Canadian Conference of Computational Geometry, CCCG97, 2007, pp. 85\u201388."},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1137\/0211056"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2021.19778"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.01.024"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.05.031"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-017-1984-z"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2019.100554"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30786-8_25"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.12.002"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1007\/s004540010051"},{"issue":"1","key":"CIT0021","first-page":"65","volume":"35","author":"Salman A.","year":"2003","journal-title":"J. Math. Fundam. Sci."},{"key":"CIT0022","unstructured":"C. Umans and W. Lenhart, Hamiltonian cycles in solid grid graphs, in Proceedings of 38th Annual Symposium on Foundations of Computer Science, FOCS 97, Miami Beach, Florida, 1997, pp. 496\u2013505."},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1137\/0405046"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2022.2157001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T14:42:32Z","timestamp":1688136152000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2022.2157001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,5]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5,4]]}},"alternative-id":["10.1080\/10556788.2022.2157001"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2022.2157001","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,5]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-11-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-01-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}