{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T06:06:57Z","timestamp":1784268417566,"version":"3.55.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":[[2002,8]]},"DOI":"10.1016\/s0020-0190(01)00333-7","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"187-194","source":"Crossref","is-referenced-by-count":2,"title":["On the complexity of one-shot translational separability"],"prefix":"10.1016","volume":"83","author":[{"given":"Fabian","family":"Schwarzer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Achim","family":"Schweikard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00333-7_BIB002","series-title":"Proc. 7th ACM-SIAM Symp. on Discrete Algorithms","first-page":"122","article-title":"Efficient generation of k-directional assembly sequences","author":"Agarwal","year":"1996"},{"issue":"1","key":"10.1016\/S0020-0190(01)00333-7_BIB003","doi-asserted-by":"crossref","first-page":"27","DOI":"10.2307\/2690292","article-title":"On removing a ball without disturbing the others","volume":"57","author":"Dawson","year":"1984","journal-title":"Math. Magazine"},{"key":"10.1016\/S0020-0190(01)00333-7_BIB004","series-title":"Computer-Aided Mechanical Assembly Planning","year":"1991"},{"key":"10.1016\/S0020-0190(01)00333-7_BIB005","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/S0020-0190(01)00333-7_BIB006","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(01)00333-7_BIB007","series-title":"Complexity measures for assembly sequences, PhD Thesis","author":"Goldwasser","year":"1997"},{"key":"10.1016\/S0020-0190(01)00333-7_BIB008","series-title":"Proc. IEEE Internat. Conf. on Robotics and Automation","first-page":"2553","article-title":"A simple and efficient procedure for polyhedral assembly partitioning under infinitesimal motions","author":"Guibas","year":"1995"},{"key":"10.1016\/S0020-0190(01)00333-7_BIB009","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1163\/156855397X00281","article-title":"Assembly partitioning along simple paths: the case of multiple translations","volume":"11","author":"Halperin","year":"1997","journal-title":"Adv. Robotics"},{"issue":"5","key":"10.1016\/S0020-0190(01)00333-7_BIB010","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(93)90085-N","article-title":"On the complexity of assembly partitioning","volume":"48","author":"Kavraki","year":"1993","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0020-0190(01)00333-7_BIB011","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0020-0190(95)00083-O","article-title":"Partitioning a planar assembly into two connected parts is NP-complete","volume":"55","author":"Kavraki","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00333-7_BIB012","series-title":"Proc. ACM Symp. on Computational Geometry","first-page":"299","article-title":"On planning assemblies","author":"Natarajan","year":"1988"},{"key":"10.1016\/S0020-0190(01)00333-7_BIB013","series-title":"Computational complexity of motion and stability of polygons, PhD Thesis","author":"Palmer","year":"1987"},{"key":"10.1016\/S0020-0190(01)00333-7_BIB014","series-title":"Geometric reasoning about translational motions, Dissertation","author":"Schwarzer","year":"2000"},{"key":"10.1016\/S0020-0190(01)00333-7_BIB015","series-title":"Proc. Internat. Conference on Robotics and Automation","first-page":"1537","article-title":"C-space cell defragmentation for general translational assembly planning","author":"Schwarzer","year":"2001"},{"issue":"9","key":"10.1016\/S0020-0190(01)00333-7_BIB016","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1177\/02783640022067193","article-title":"Efficient unboundedness testing: Algorithm and applications to assembly planning","volume":"19","author":"Schwarzer","year":"2000","journal-title":"Internat. J. Robotics Res."},{"key":"10.1016\/S0020-0190(01)00333-7_BIB017","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0004-3702(98)00076-9","article-title":"Detecting geometric infeasibility","volume":"105","author":"Schweikard","year":"1998","journal-title":"Artificial Intelligence"},{"issue":"6","key":"10.1016\/S0020-0190(01)00333-7_BIB018","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/BF01189068","article-title":"Assembly sequences for polyhedra","volume":"13","author":"Schweikard","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(01)00333-7_BIB019","series-title":"Proc. 9th ACM Symp. on Computational Geometry","first-page":"247","article-title":"Objects that cannot be taken apart with two hands","author":"Snoeyink","year":"1993"},{"key":"10.1016\/S0020-0190(01)00333-7_BIB020","series-title":"Computational Geometry","first-page":"335","article-title":"Movable separability of sets","author":"Toussaint","year":"1985"},{"issue":"4","key":"10.1016\/S0020-0190(01)00333-7_BIB021","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1177\/027836499501400403","article-title":"Two-handed assembly sequencing","volume":"14","author":"Wilson","year":"1995","journal-title":"Internat. J. Robotics Res."},{"key":"10.1016\/S0020-0190(01)00333-7_BIB022","series-title":"On the automatic generation of plans for mechanical assembly, PhD Thesis","author":"Wolter","year":"1988"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003337?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003337?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T04:28:46Z","timestamp":1556857726000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001003337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0020019001003337"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00333-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}