{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:10:02Z","timestamp":1649203802544},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1016\/0196-6774(91)90017-s","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"516-529","source":"Crossref","is-referenced-by-count":5,"title":["How to play bowling in parallel on the grid"],"prefix":"10.1016","volume":"12","author":[{"given":"Jehoshua","family":"Bruck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vwani P","family":"Roychowdhury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(91)90017-S_BIB1","series-title":"Computers and Intractability\u2014A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"No. 2","key":"10.1016\/0196-6774(91)90017-S_BIB2","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1137\/0215033","article-title":"Efficient algorithms for geometric graph search problems","volume":"15","author":"Imai","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"No. 4","key":"10.1016\/0196-6774(91)90017-S_BIB3","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/12.21143","article-title":"Fault-tolerant array processors using single-track switches","volume":"38","author":"Kung","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(91)90017-S_BIB4","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0196-6774(91)90017-S_BIB5","article-title":"Manhattan and Rectilinear Wiring","author":"Raghavan","year":"1981"},{"key":"10.1016\/0196-6774(91)90017-S_BIB6","series-title":"First Annual Symposium on Discrete Algorithms","article-title":"On finding non-intersecting paths in grids and its application in reconfiguring VLSI\/WSI arrays","author":"Roychowdhury","year":"1990"},{"key":"10.1016\/0196-6774(91)90017-S_BIB7","series-title":"Second Annual Symposium on Discrete Algorithms","article-title":"A fast algorithm for connecting grid points to the boundary with nonintersecting straight lines","author":"Birk","year":"1991"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190017S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190017S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:53:41Z","timestamp":1548726821000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749190017S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["019667749190017S"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(91)90017-s","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}