{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:54Z","timestamp":1725543114021},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_21","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"186-195","source":"Crossref","is-referenced-by-count":2,"title":["On Unfolding Lattice Polygons\/Trees and Diameter-4 Trees"],"prefix":"10.1007","author":[{"given":"Sheung-Hung","family":"Poon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(01)00150-8","volume":"80","author":"J. Alberto-Calvo","year":"2001","unstructured":"Alberto-Calvo, J., Krizanc, D., Morin, P., Soss, M., Toussaint, G.: Convexifying polygons with simple projections. Information Processing Letters\u00a080(2), 81\u201386 (2001)","journal-title":"Information Processing Letters"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Alt, H., Knauer, C., Rote, G., Whitesides, S.: The Complexity of (Un)folding. In: Proc. 19th ACM Symposium on Computational Geometry (SOCG), pp. 164\u2013170 (2003)","DOI":"10.1145\/777792.777818"},{"issue":"1-3","key":"21_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., Demaine, M., 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-3), 293\u2013297 (2002)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"21_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s00454-001-0038-7","volume":"26","author":"T. Biedl","year":"2001","unstructured":"Biedl, T., Demaine, E., Demaine, M., Lazard, S., Lubiw, A., O\u2019Rourke, J., Overmars, M., Robbins, S., Streinu, I., Toussaint, G., Whitesides, S.: Locked and Unlocked Polygonal Chains in Three Dimensions. Discrete & Computational Geometry\u00a026(3), 269\u2013281 (2001)","journal-title":"Discrete & Computational Geometry"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Cantarella, J., Demaine, E.D., Iben, H., O\u2019Brien, J.: An Energy-Driven Approach to Linkage Unfolding. In: Proceedings of the 20th Annual ACM Symposium on Computational Geometry (SoCG 2004), pp. 134\u2013143 (2004)","DOI":"10.1145\/997817.997840"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Chan, H.S., Dill, K.A.: The protein folding problem. Physics Today, pp. 24\u201332, (February 1993)","DOI":"10.1063\/1.881371"},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0925-7721(01)00013-X","volume":"20","author":"R. Cocan","year":"2001","unstructured":"Cocan, R., O\u2019Rourke, J.: Polygonal Chains Cannot Lock in 4D. Computational Geometry: Theory & Applications\u00a020, 105\u2013129 (2001)","journal-title":"Computational Geometry: Theory & Applications"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Connelly, R., Demaine, E., Rote, G.: Infinitesimally Locked Self-Touching Linkages with Applications to Locked Trees. In: Calvo, J., Millett, K., Rawdon, E. (eds.) Physical Knots: Knotting, Linking, and Folding of Geometric Objects in R\n                              3, pp. 287\u2013311. American Mathematical Society (2002)","DOI":"10.1090\/conm\/304\/05200"},{"issue":"2","key":"21_CR9","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"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Langerman, S., O\u2019Rourke, J., Snoeyink, J.: Interlocked Open Linkages with Few Joints. In: Proc. 18th Annual ACM Symposium on Computational Geometry (SoCG), Barcelona, Spain, June 5-7, 2002, pp. 189\u2013198 (2002)","DOI":"10.1145\/513400.513424"},{"issue":"31","key":"21_CR11","doi-asserted-by":"publisher","first-page":"7133","DOI":"10.1021\/bi00483a001","volume":"29","author":"K.A. Dill","year":"1990","unstructured":"Dill, K.A.: Dominant forces in protein folding. Biochemistry\u00a029(31), 7133\u20137155 (1990)","journal-title":"Biochemistry"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1511\/1998.25.3306","volume":"86","author":"B. Hayes","year":"1998","unstructured":"Hayes, B.: Prototeins. American Scientist\u00a086, 216\u2013221 (1998)","journal-title":"American Scientist"},{"key":"21_CR13","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":"21_CR14","doi-asserted-by":"crossref","unstructured":"Streinu, I.: A combinatorial approach for planar non-colliding robot arm motion planning. In: Proc. 41st ACM Annual Symposium on Foundations of Computer Science (FOCS), pp. 443\u2013453 (2000)","DOI":"10.1109\/SFCS.2000.892132"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:26:34Z","timestamp":1619508394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11809678_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}