{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:39:21Z","timestamp":1742985561347,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031220494"},{"type":"electronic","value":"9783031220500"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22050-0_1","type":"book-chapter","created":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T12:14:39Z","timestamp":1670847279000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Geometric Shape Construction via\u00a0Growth Operations"],"prefix":"10.1007","author":[{"given":"Nada","family":"Almalki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6234-3960","authenticated-orcid":false,"given":"Othon","family":"Michail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,13]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Akitaya, H.A., et al.: Universal reconfiguration of facet-connected modular robots by pivots: the O(1) musketeers. Algorithmica 83(5), 1316\u20131351 (2021)","DOI":"10.1007\/s00453-020-00784-6"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(78)90073-X","volume":"7","author":"SG Akl","year":"1978","unstructured":"Akl, S.G., Toussaint, G.T.: An improved algorithm to check for polygon similarity. Inf. Process. Lett. 7(3), 127\u2013128 (1978)","journal-title":"Inf. Process. Lett."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2020.04.026","volume":"830","author":"A Almethen","year":"2020","unstructured":"Almethen, A., Michail, O., Potapov, I.: Pushing lines helps: efficient universal centralised transformations for programmable matter. Theoret. Comput. Sci. 830, 43\u201359 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-92182-0_32","volume-title":"Algorithms and Computation","author":"G Aloupis","year":"2008","unstructured":"Aloupis, G., Collette, S., Demaine, E.D., Langerman, S., Sacrist\u00e1n, V., Wuhrer, S.: Reconfiguration of cube-style modular robots using $$O(\\log n)$$ parallel moves. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 342\u2013353. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_32"},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279\u2013304 (2007)","journal-title":"Distrib. Comput."},{"issue":"7759","key":"1_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1038\/s41586-019-1184-5","volume":"570","author":"MM Chan","year":"2019","unstructured":"Chan, M.M., et al.: Molecular recording of mammalian embryogenesis. Nature 570(7759), 77\u201382 (2019)","journal-title":"Nature"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Connor, M., Michail, O., Potapov, I.: Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach. Theoret. Comput. Sci. (2022)","DOI":"10.1016\/j.tcs.2022.09.016"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-662-45174-8_4","volume-title":"Distributed Computing","author":"A Cornejo","year":"2014","unstructured":"Cornejo, A., Dornhaus, A., Lynch, N., Nagpal, R.: Task allocation in ant colonies. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 46\u201360. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45174-8_4"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Derakhshandeh, Z., Gmyr, R., Richa, A.W., Scheideler, C., Strothmann, T.: Universal shape formation for programmable matter. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 289\u2013299 (2016)","DOI":"10.1145\/2935764.2935784"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2016.02.039","volume":"671","author":"Z Derakhshandeh","year":"2017","unstructured":"Derakhshandeh, Z., Gmyr, R., Richa, W., Scheideler, C., Strothmann, T.: Universal coating for programmable matter. Theoret. Comput. Sci. 671, 56\u201368 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Derakhshandeh, Z., Richa, A., Dolev, S., Scheideler, C., Gmyr, R., Strothmann, T.: Brief announcement: amoebot-a new model for programmable matter. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 220\u2013222 (2014)","DOI":"10.1145\/2612669.2612712"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00446-019-00350-6","volume":"33","author":"GA Di Luna","year":"2020","unstructured":"Di Luna, G.A., Flocchini, P., Santoro, N., Viglietta, G., Yamauchi, Y.: Shape formation by programmable particles. Distrib. Comput. 33(1), 69\u2013101 (2020)","journal-title":"Distrib. Comput."},{"issue":"12","key":"1_CR14","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2380656.2380675","volume":"55","author":"D Doty","year":"2012","unstructured":"Doty, D.: Theory of algorithmic self-assembly. Commun. ACM 55(12), 78\u201388 (2012)","journal-title":"Commun. ACM"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., Pach, J.: Pushing squares around. In: Proceedings of the 20th Annual Symposium on Computational Geometry, pp. 116\u2013123 (2004)","DOI":"10.1145\/997817.997838"},{"issue":"6","key":"1_CR16","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1177\/0278364904039652","volume":"23","author":"A Dumitrescu","year":"2004","unstructured":"Dumitrescu, A., Suzuki, I., Yamashita, M.: Formations for fast locomotion of metamorphic robotic systems. Int. J. Robot. Res. 23(6), 583\u2013593 (2004)","journal-title":"Int. J. Robot. Res."},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/0215033","volume":"15","author":"H Imai","year":"1986","unstructured":"Imai, H., Asano, T.: Efficient algorithms for geometric graph search problems. SIAM J. Comput. 15(2), 478\u2013494 (1986)","journal-title":"SIAM J. Comput."},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/B978-044482537-7\/50012-7","volume":"2","author":"JM Keil","year":"2000","unstructured":"Keil, J.M.: Polygon decomposition. Handb. Comput. Geom. 2, 491\u2013518 (2000)","journal-title":"Handb. Comput. Geom."},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/0020-0190(76)90092-2","volume":"5","author":"GK Manacher","year":"1976","unstructured":"Manacher, G.K.: An application of pattern matching to a problem in geometrical complexity. Inf. Process. Lett. 5(1), 6\u20137 (1976)","journal-title":"Inf. Process. Lett."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Mertzios, G.B., Michail, O., Skretas, G., Spirakis, P.G., Theofilatos, M.: The complexity of growing a graph. arXiv preprint arXiv:2107.14126 (2021)","DOI":"10.1007\/978-3-031-22050-0_9"},{"issue":"5","key":"1_CR21","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00446-017-0309-z","volume":"31","author":"O Michail","year":"2018","unstructured":"Michail, O.: Terminating distributed construction of shapes and patterns in a fair solution of automata. Distrib. Comput. 31(5), 343\u2013365 (2018)","journal-title":"Distrib. Comput."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.jcss.2018.12.001","volume":"102","author":"O Michail","year":"2019","unstructured":"Michail, O., Skretas, G., Spirakis, P.G.: On the transformation capability of feasible mechanisms for programmable matter. J. Comput. Syst. Sci. 102, 18\u201339 (2019)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Michail, O., Skretas, G., Spirakis, P.G.: Distributed computation and reconfiguration in actively dynamic networks. In: Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC), pp. 448\u2013457 (2020)","DOI":"10.1145\/3382734.3405744"},{"issue":"3","key":"1_CR24","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00446-015-0257-4","volume":"29","author":"O Michail","year":"2016","unstructured":"Michail, O., Spirakis, P.G.: Simple and efficient local codes for distributed stable network construction. Distrib. Comput. 29(3), 207\u2013237 (2016)","journal-title":"Distrib. Comput."},{"issue":"7082","key":"1_CR25","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1038\/nature04586","volume":"440","author":"PW Rothemund","year":"2006","unstructured":"Rothemund, P.W.: Folding DNA to create nanoscale shapes and patterns. Nature 440(7082), 297\u2013302 (2006)","journal-title":"Nature"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Woods, D., Chen, H.L., Goodfriend, S., Dabby, N., Winfree, E., Yin, P.: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science (ITCS), pp. 353\u2013354 (2013)","DOI":"10.1145\/2422436.2422476"},{"issue":"7748","key":"1_CR28","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1038\/s41586-019-1014-9","volume":"567","author":"D Woods","year":"2019","unstructured":"Woods, D., et al.: Diverse and robust molecular algorithms using reprogrammable DNA self-assembly. Nature 567(7748), 366\u2013372 (2019)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22050-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T09:49:17Z","timestamp":1679046557000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22050-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031220494","9783031220500"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22050-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Wireless Sensor Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2022.eu\/algosensors\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}