{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:35Z","timestamp":1725536015622},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_6","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T03:56:42Z","timestamp":1248062202000},"page":"61-73","source":"Crossref","is-referenced-by-count":3,"title":["Minimal Locked Trees"],"prefix":"10.1007","author":[{"given":"Brad","family":"Ballinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Charlton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ching-Hao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Abbott, T.G., Demaine, E.D., Gassend, B.: A generalized carpenter\u2019s rule theorem for self-touching linkages (preprint) (December 2007)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Alt, H., Knauer, C., Rote, G., Whitesides, S.: On the complexity of the linkage reconfiguration problem. In: Towards a Theory of Geometric Graphs. Contemporary Mathematics, vol.\u00a0342, pp. 1\u201314. AMS (2004)","DOI":"10.1090\/conm\/342\/06126"},{"issue":"1\u20133","key":"6_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0166-218X(01)00229-3","volume":"117","author":"T. Biedl","year":"2002","unstructured":"Biedl, T., Demaine, E.D., Demaine, M.L., Lazard, S., Lubiw, A., O\u2019Rourke, J., Robbins, S., Streinu, I., Toussaint, G., Whitesides, S.: A note on reconfiguring tree linkages: Trees can lock. Discrete Applied Mathematics\u00a0117(1\u20133), 293\u2013297 (2002); The full paper is Technical Report SOCS-00.7, School of Computer Science, McGill University (September 2000) (Originally appeared at CCCG 1998)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Connelly, R., Demaine, E.D., Demaine, M.L., Fekete, S., Langerman, S., Mitchell, J.S.B., Rib\u00f3, A., Rote, G.: Locked and unlocked chains of planar shapes. In: Proceedings of the 22nd Annual ACM Symposium on Computational Geometry, Sedona, Arizona, June 2006, pp. 61\u201370 (2006)","DOI":"10.1145\/1137856.1137868"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Connelly, R., Demaine, E.D., Rote, G.: Infinitesimally locked self-touching linkages with applications to locked trees. In: Physical Knots: Knotting, Linking, and Folding of Geometric Objects in $\\mathbb R^3$ , pp. 287\u2013311. AMS (2002)","DOI":"10.1090\/conm\/304\/05200"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00454-003-0006-7","volume":"30","author":"R. Connelly","year":"2003","unstructured":"Connelly, R., Demaine, E.D., Rote, G.: Straightening polygonal arcs and convexifying polygonal cycles. Discrete & Computational Geometry\u00a030(2), 205\u2013239 (2003)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.2307\/2690292","volume":"57","author":"R. Dawson","year":"1984","unstructured":"Dawson, R.: On removing a ball without disturbing the others. Mathematics Magazine\u00a057(1), 27\u201330 (1984)","journal-title":"Mathematics Magazine"},{"key":"6_CR8","unstructured":"Demaine, E.D., Demaine, M.L.: Computing extreme origami bases. Technical Report CS-97-22, Dept. of Computer Science, University of Waterloo (May 1997)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Langerman, S., O\u2019Rourke, J., Snoeyink, J.: Interlocked open linkages with few joints. In: Proceedings of the 18th Annual ACM Symposium on Computational Geometry, Barcelona, Spain, June 2002, pp. 189\u2013198 (2002)","DOI":"10.1145\/513400.513424"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0925-7721(02)00171-2","volume":"26","author":"E.D. Demaine","year":"2003","unstructured":"Demaine, E.D., Langerman, S., O\u2019Rourke, J., Snoeyink, J.: Interlocked open and closed linkages with few joints. Computational Geometry: Theory and Applications\u00a026(1), 37\u201345 (2003)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"4","key":"6_CR11","first-page":"166","volume":"15","author":"J. Glass","year":"2006","unstructured":"Glass, J., Lu, B., O\u2019Rourke, J., Zhong, J.K.: A 2-chain can interlock with an open 11-chain. Geombinatorics\u00a015(4), 166\u2013176 (2006)","journal-title":"Geombinatorics"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/11618058_51","volume-title":"Graph Drawing","author":"S.-H. Poon","year":"2006","unstructured":"Poon, S.-H.: On straightening low-diameter unit trees. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 519\u2013521. Springer, Heidelberg (2006)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Poon, S.-H.: On unfolding lattice polygons\/trees and diameter-4 trees. In: Proceedings of the 12th Annual International Computing and Combinatorics Conference, pp. 186\u2013195 (2006)","DOI":"10.1007\/11809678_21"},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00454-005-1184-0","volume":"34","author":"I. Streinu","year":"2005","unstructured":"Streinu, I.: Pseudo-triangulations, rigidity and motion planning. Discrete & Computational Geometry\u00a034(4), 587\u2013635 (2005)","journal-title":"Discrete & Computational Geometry"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/B978-0-444-87806-9.50018-9","volume-title":"Computational Geometry","author":"G.T. Toussaint","year":"1985","unstructured":"Toussaint, G.T.: Movable separability of sets. In: Computational Geometry, pp. 335\u2013375. North-Holland, Amsterdam (1985)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T11:28:56Z","timestamp":1558438136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}