{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T07:56:50Z","timestamp":1782460610411,"version":"3.54.5"},"reference-count":14,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0020-0190(93)90085-n","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"229-235","source":"Crossref","is-referenced-by-count":56,"title":["On the complexity of assembly partitioning"],"prefix":"10.1016","volume":"48","author":[{"given":"Lydia","family":"Kavraki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Claude","family":"Latombe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Randall H.","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90085-N_BIB1","first-page":"334","article-title":"On monotone paths among obstacles with applications to planning assemblies","author":"Arkin","year":"1989","journal-title":"Proc. 5th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0020-0190(93)90085-N_BIB2","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(93)90085-N_BIB3","first-page":"61","article-title":"On translating a set of rectangles","volume":"1","author":"Guibas","year":"1983"},{"key":"10.1016\/0020-0190(93)90085-N_BIB4","series-title":"Sequences","author":"Halberstam","year":"1983"},{"key":"10.1016\/0020-0190(93)90085-N_BIB5","year":"1991"},{"key":"10.1016\/0020-0190(93)90085-N_BIB6","series-title":"Tech. Rept. STAN-CS-93-1467","article-title":"Complexity of partitioning a planar assembly","author":"Kavraki","year":"1993"},{"key":"10.1016\/0020-0190(93)90085-N_BIB7","first-page":"299","article-title":"On planning assemblies","author":"Natarajan","year":"1988","journal-title":"Proc. 4th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0020-0190(93)90085-N_BIB8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1142\/S0218195993000051","article-title":"Dissasembling two-dimensional composite parts via translations","volume":"3","author":"Nussbaum","year":"1993","journal-title":"Internat. J. Comput. Geom."},{"key":"10.1016\/0020-0190(93)90085-N_BIB9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02187902","article-title":"Separating two polygons by a sequence of translations","volume":"3","author":"Pollack","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(93)90085-N_BIB10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/cpa.3160360305","article-title":"On the piano movers' problem: I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers","volume":"36","author":"Schwartz","year":"1983","journal-title":"Comm. Pure Appl. Math."},{"key":"10.1016\/0020-0190(93)90085-N_BIB11","first-page":"247","article-title":"Objects that cannot be taken apart with two hands","author":"Snoeyink","year":"1993","journal-title":"Proc. 9th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0020-0190(93)90085-N_BIB12","series-title":"Computational Geometry","article-title":"Movable separability of sets","author":"Toussaint","year":"1985"},{"key":"10.1016\/0020-0190(93)90085-N_BIB13","series-title":"Ph.D. Thesis","article-title":"On geometric assembly planning","author":"Wilson","year":"1992"},{"key":"10.1016\/0020-0190(93)90085-N_BIB14","series-title":"Tech. Rept. STAN-CS-92-1458","article-title":"On the complexity of partitioning an assembly","author":"Wilson","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390085N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390085N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:28:48Z","timestamp":1555144128000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390085N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["002001909390085N"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90085-n","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}