{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:50:16Z","timestamp":1725983416204},"publisher-location":"Cham","reference-count":3,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946665"},{"type":"electronic","value":"9783319946672"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94667-2_15","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T07:56:24Z","timestamp":1530604584000},"page":"177-188","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computational Complexity of Robot Arm Simulation Problems"],"prefix":"10.1007","author":[{"given":"Tianfeng","family":"Feng","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Horiyama","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[]},{"given":"Toshiki","family":"Saitoh","sequence":"additional","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511735172","volume-title":"Geometric Folding Algorithms","author":"ED Demaine","year":"2007","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Geometric Folding Algorithms. Cambridge University Press, Cambridge (2007)"},{"key":"15_CR2","unstructured":"Kupferman, O., Vardi, G.: Eulerian paths with regular constraints. In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 58, 62:1\u201362:15 (2016)"},{"key":"15_CR3","first-page":"90","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"RG Michael","year":"1979","unstructured":"Michael, R.G., David, S.J.: Computers and Intractability: A Guide to the Theory of NP-Completeness, pp. 90\u201391. W. H. Freeman Co., San Francisco (1979)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94667-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T08:07:47Z","timestamp":1530605267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94667-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946665","9783319946672"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94667-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}