{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:07Z","timestamp":1759639087089,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030892395"},{"type":"electronic","value":"9783030892401"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89240-1_1","type":"book-chapter","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T05:01:04Z","timestamp":1634619664000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Transformations of Hamiltonian Shapes Based on Line Moves"],"prefix":"10.1007","author":[{"given":"Abdullah","family":"Almethen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Othon","family":"Michail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,19]]},"reference":[{"issue":"11","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266(11), 1021\u20131024 (1994)","journal-title":"Science"},{"issue":"5","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1007\/s00453-020-00784-6","volume":"83","author":"HA Akitaya","year":"2021","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)","journal-title":"Algorithmica"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-030-62401-9_6","volume-title":"Algorithms for Sensor Systems","author":"A Almethen","year":"2020","unstructured":"Almethen, A., Michail, O., Potapov, I.: On efficient connectivity-preserving transformations in a grid. In: Pinotti, C.M., Navarra, A., Bagchi, A. (eds.) ALGOSENSORS 2020. LNCS, vol. 12503, pp. 76\u201391. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62401-9_6"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2020.04.026","volume":"830\u2013831","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\u2013831, 43\u201359 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"8","key":"1_CR5","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.comgeo.2013.03.004","volume":"46","author":"G Aloupis","year":"2013","unstructured":"Aloupis, G., et al.: Efficient reconfiguration of lattice-based modular robots. Comput. Geom. 46(8), 917\u2013928 (2013)","journal-title":"Comput. Geom."},{"key":"1_CR6","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(logn) 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_CR7","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., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"issue":"1\u20133","key":"1_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0166-218X(96)00058-3","volume":"71","author":"D Boneh","year":"1996","unstructured":"Boneh, D., Dunworth, C., Lipton, R.J., Sgall, J.: On the computational power of DNA. Discret. Appl. Math. 71(1\u20133), 79\u201394 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1109\/JSYST.2013.2281124","volume":"9","author":"J Bourgeois","year":"2015","unstructured":"Bourgeois, J., Goldstein, S.: Distributed intelligent MEMS: progresses and perspective. IEEE Syst. J. 9(3), 1057\u20131068 (2015)","journal-title":"IEEE Syst. J."},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/s00453-020-00752-0","volume":"83","author":"J Czyzowicz","year":"2021","unstructured":"Czyzowicz, J., Dereniowski, D., Pelc, A.: Building a nest by an automaton. Algorithmica 83(1), 144\u2013176 (2021)","journal-title":"Algorithmica"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11047-017-9658-6","volume":"17","author":"J Daymude","year":"2018","unstructured":"Daymude, J., et al.: On the runtime of universal coating for programmable matter. Nat. Comput. 17(1), 81\u201396 (2018)","journal-title":"Nat. Comput."},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-319-43994-5_10","volume-title":"DNA Computing and Molecular Programming","author":"Z Derakhshandeh","year":"2016","unstructured":"Derakhshandeh, Z., Gmyr, R., Porter, A., Richa, A.W., Scheideler, C., Strothmann, T.: On the runtime of universal coating for programmable matter. In: Rondelez, Y., Woods, D. (eds.) DNA 2016. LNCS, vol. 9818, pp. 148\u2013164. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43994-5_10"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Derakhshandeh, Z., Gmyr, R., Richa, A., Scheideler, C., Strothmann, T.: Universal shape formation for programmable matter. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 289\u2013299. ACM (2016)","DOI":"10.1145\/2935764.2935784"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00446-019-00350-6","volume":"33","author":"GA Di Luna","year":"2019","unstructured":"Di Luna, G.A., Flocchini, P., Santoro, N., Viglietta, G., Yamauchi, Y.: Shape formation by programmable particles. Distrib. Comput. 33, 69\u2013101 (2019)","journal-title":"Distrib. Comput."},{"key":"1_CR15","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, 78\u201388 (2012)","journal-title":"Commun. ACM"},{"issue":"7245","key":"1_CR16","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1038\/nature08016","volume":"459","author":"S Douglas","year":"2009","unstructured":"Douglas, S., Dietz, H., Liedl, T., H\u00f6gberg, B., Graf, F., Shih, W.: Self-assembly of DNA into nanoscale three-dimensional shapes. Nature 459(7245), 414 (2009)","journal-title":"Nature"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., Pach, J.: Pushing squares around. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 116\u2013123. ACM (2004)","DOI":"10.1145\/997817.997838"},{"issue":"6","key":"1_CR18","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":"3","key":"1_CR19","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/TRA.2004.824936","volume":"20","author":"A Dumitrescu","year":"2004","unstructured":"Dumitrescu, A., Suzuki, I., Yamashita, M.: Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration. IEEE Trans. Robot. Autom. 20(3), 409\u2013418 (2004)","journal-title":"IEEE Trans. Robot. Autom."},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00453-020-00761-z","volume":"83","author":"SP Fekete","year":"2021","unstructured":"Fekete, S.P., Gmyr, R., Hugo, S., Keldenich, P., Scheffer, C., Schmidt, A.: CADbots: algorithmic aspects of manipulating programmable matter with finite automata. Algorithmica 83(1), 387\u2013412 (2021)","journal-title":"Algorithmica"},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00440ED1V01Y201208DCT010","volume":"3","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by oblivious mobile robots. Synthesis Lect. Distrib. Comput. Theory 3(2), 1\u2013185 (2012)","journal-title":"Synthesis Lect. Distrib. Comput. Theory"},{"key":"1_CR22","unstructured":"Fukuda, T.: Self organizing robots based on cell structures-CEBot. In: Proceedings of IEEE International Workshop on Intelligent Robots and Systems (IROS 1988), pp. 145\u2013150 (1988)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Gilpin, K., Knaian, A., Rus, D.: Robot pebbles: one centimeter modules for programmable matter through self-disassembly. In: 2010 IEEE International Conference on Robotics and Automation (ICRA), pp. 2485\u20132492. IEEE (2010)","DOI":"10.1109\/ROBOT.2010.5509817"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Gmyr, R., et al.: Forming tile shapes with simple robots. Natural Comput. 19(2) 375\u2013390 (2020)","DOI":"10.1007\/s11047-019-09774-2"},{"issue":"4","key":"1_CR25","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C., Szwarcfiter, J.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676\u2013686 (1982)","journal-title":"SIAM J. Comput."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Knaian, A., Cheung, K., Lobovsky, M., Oines, A., Schmidt-Neilsen, P., Gershenfeld, N.: The milli-motein: a self-folding chain of programmable matter with a one centimeter module pitch. In: 2012 IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 1447\u20131453. IEEE (2012)","DOI":"10.1109\/IROS.2012.6385904"},{"key":"1_CR27","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.: On the transformation capability of feasible mechanisms for programmable matter. J. Comput. Syst. Sci. 102, 18\u201339 (2019)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"1_CR28","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.: Simple and efficient local codes for distributed stable network construction. Distrib. Comput. 29(3), 207\u2013237 (2016)","journal-title":"Distrib. Comput."},{"issue":"2","key":"1_CR29","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/3156693","volume":"61","author":"O Michail","year":"2018","unstructured":"Michail, O., Spirakis, P.: Elements of the theory of dynamic networks. Commun. ACM 61(2), 72\u201381 (2018)","journal-title":"Commun. ACM"},{"key":"1_CR30","unstructured":"Nguyen, A., Guibas, L., Yim, M.: Controlled module density helps reconfiguration planning. In: Proceedings of 4th International Workshop on Algorithmic Foundations of Robotics, pp. 23\u201336 (2000)"},{"key":"1_CR31","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/978-981-10-8657-1_44","volume-title":"Smart and Innovative Trends in Next Generation Computing Technologies","author":"VP Prakash","year":"2017","unstructured":"Prakash, V.P., Patvardhan, C., Srivastav, A.: Effective heuristics for the bi-objective euclidean bounded diameter minimum spanning tree problem. In: Bhattacharyya, P., Sastry, H., Marriboyina, V., Sharma, R. (eds.) NGCT 2017. CCIS, vol. 827, pp. 580\u2013589. Springer, Singapore (2017). https:\/\/doi.org\/10.1007\/978-981-10-8657-1_44"},{"issue":"7082","key":"1_CR32","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1038\/nature04586","volume":"440","author":"P Rothemund","year":"2006","unstructured":"Rothemund, P.: Folding DNA to create nanoscale shapes and patterns. Nature 440(7082), 297\u2013302 (2006)","journal-title":"Nature"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Rothemund, P., 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. ACM (2000)","DOI":"10.1145\/335305.335358"},{"issue":"6198","key":"1_CR34","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1126\/science.1254295","volume":"345","author":"M Rubenstein","year":"2014","unstructured":"Rubenstein, M., Cornejo, A., Nagpal, R.: Programmable self-assembly in a thousand-robot swarm. Science 345(6198), 795\u2013799 (2014)","journal-title":"Science"},{"issue":"1\u20132","key":"1_CR35","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0167-2789(91)90296-L","volume":"47","author":"T Toffoli","year":"1991","unstructured":"Toffoli, T., Margolus, N.: Programmable matter: concepts and realization. Phys. D Nonlinear Phenomena 47(1\u20132), 263\u2013272 (1991)","journal-title":"Phys. D Nonlinear Phenomena"},{"issue":"2","key":"1_CR36","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00446-003-0103-y","volume":"17","author":"J Walter","year":"2004","unstructured":"Walter, J., Welch, J., Amato, N.: Distributed reconfiguration of metamorphic robot chains. Distrib. Comput. 17(2), 171\u2013189 (2004)","journal-title":"Distrib. Comput."},{"key":"1_CR37","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology (1998)"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Woods, D., Chen, H., 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, pp. 353\u2013354. ACM (2013)","DOI":"10.1145\/2422436.2422476"},{"issue":"26\u201328","key":"1_CR39","doi-asserted-by":"publisher","first-page":"2433","DOI":"10.1016\/j.tcs.2010.01.037","volume":"411","author":"M Yamashita","year":"2010","unstructured":"Yamashita, M., Suzuki, I.: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theoret. Comput. Sci. 411(26\u201328), 2433\u20132453 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"1_CR40","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MRA.2007.339623","volume":"14","author":"M Yim","year":"2007","unstructured":"Yim, M., et al.: Modular self-reconfigurable robot systems [grand challenges of robotics]. IEEE Robot. Autom. Mag. 14(1), 43\u201352 (2007)","journal-title":"IEEE Robot. Autom. Mag."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89240-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T05:56:10Z","timestamp":1634622970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89240-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030892395","9783030892401"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89240-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 October 2021","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 Sensor Systems, Wireless Networks and Distributed Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2021.tecnico.ulisboa.pt\/ALGOSENSORS2021\/index.html","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":"28","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":"36% - 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.4","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.7","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)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}