{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:59Z","timestamp":1760202779625,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030000295"},{"type":"electronic","value":"9783030000301"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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-030-00030-1_8","type":"book-chapter","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T19:44:00Z","timestamp":1536263040000},"page":"122-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Forming Tile Shapes with Simple Robots"],"prefix":"10.1007","author":[{"given":"Robert","family":"Gmyr","sequence":"first","affiliation":[]},{"given":"Kristian","family":"Hinnenthal","sequence":"additional","affiliation":[]},{"given":"Irina","family":"Kostitsyna","sequence":"additional","affiliation":[]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[]},{"given":"Dorian","family":"Rudolph","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[]},{"given":"Thim","family":"Strothmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,7]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Bonato, A., Nowakowski, R.J.: The game of cops and robbers on graphs. AMS (2011)","DOI":"10.1090\/stml\/061"},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1002\/(SICI)1097-4563(199605)13:5<317::AID-ROB5>3.0.CO;2-T","volume":"13","author":"G Chirikjian","year":"1996","unstructured":"Chirikjian, G., Pamecha, A., Ebert-Uphoff, I.: Evaluating efficiency of self-reconfiguration in a class of modular robots. J. Robot. Syst. 13(5), 317\u2013338 (1996)","journal-title":"J. Robot. Syst."},{"key":"8_CR3","first-page":"54","volume":"109","author":"S Das","year":"2013","unstructured":"Das, S.: Mobile agents in distributed computing: network exploration. Bull. Eur. Assoc. Theor. Comput. Sci. 109, 54\u201369 (2013)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"8_CR4","unstructured":"Demaine, E., Tachi, T.: Origamizer: a practical algorithm for folding any polyhedron. In: Proceedings of 33rd International Symposium on Computational Geometry (SoCG), pp. 34:1\u201334:16 (2017)"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2016.11.020","volume":"671","author":"ED Demaine","year":"2017","unstructured":"Demaine, E.D., Fekete, S.P., Scheffer, C., Schmidt, A.: New geometric algorithms for fully connected staged self-assembly. Theor. Comput. Sci. 671, 4\u201318 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0925-7721(02)00170-0","volume":"26","author":"E Demaine","year":"2003","unstructured":"Demaine, E., Demaine, M., Hoffmann, M., O\u2019Rourke, J.: Pushing blocks is hard. Comput. Geom. 26(1), 21\u201336 (2003)","journal-title":"Comput. Geom."},{"key":"8_CR7","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 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 289\u2013299 (2016)","DOI":"10.1145\/2935764.2935784"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3), 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10514-015-9421-8","volume":"38","author":"F Hurtado","year":"2015","unstructured":"Hurtado, F., Molina, E., Ramaswami, S., Sacrist\u00e1n, V.: Distributed reconfiguraiton of 2D lattice-based modular robotic systems. Auton. Rob. 38(4), 383\u2013413 (2015)","journal-title":"Auton. Rob."},{"issue":"7295","key":"8_CR10","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1038\/nature09012","volume":"465","author":"K Lund","year":"2010","unstructured":"Lund, K., et al.: Molecular robots guided by prescriptive landscapes. Nature 465(7295), 206\u2013210 (2010)","journal-title":"Nature"},{"issue":"3","key":"8_CR11","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."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Murata, S., Kurokawa, H., Kokaji, S.: Self-assembling machine. In: Proceedings of IEEE International Conference on Robotics and Automation (ICRA), pp . 441\u2013448 (1994)","DOI":"10.1109\/ROBOT.1995.525759"},{"issue":"5923","key":"8_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1126\/science.1170336","volume":"324","author":"T Omabegho","year":"2009","unstructured":"Omabegho, T., Sha, R., Seeman, N.: A bipedal DNA Brownian motor with coordinated legs. Science 324(5923), 67\u201371 (2009)","journal-title":"Science"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11047-013-9379-4","volume":"13","author":"MJ Patitz","year":"2014","unstructured":"Patitz, M.J.: An introduction to tile-based self-assembly and a survey of recent results. Nat. Comput. 13(2), 195\u2013224 (2014)","journal-title":"Nat. Comput."},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/net.21453","volume":"59","author":"A Pelc","year":"2012","unstructured":"Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59(3), 331\u2013347 (2012)","journal-title":"Networks"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"1428","DOI":"10.1016\/j.tcs.2008.12.003","volume":"410","author":"JH Reif","year":"2009","unstructured":"Reif, J.H., Sahu, S.: Autonomous programmable DNA nanorobotic devices using DNAzymes. Theor. Comput. Sci. 410, 1428\u20131439 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"8_CR18","first-page":"4903","volume":"126","author":"J Shin","year":"2004","unstructured":"Shin, J., Pierce, N.: A synthetic DNA walker for molecular transport. J. Am. Chem. Soc. 126, 4903\u20134911 (2004)","journal-title":"J. Am. Chem. Soc."},{"issue":"3\u20134","key":"8_CR19","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1177\/0278364907085562","volume":"27","author":"Y Terada","year":"2008","unstructured":"Terada, Y., Murata, S.: Automatic modular assembly system and its distributed control. Int. J. Robot. Res. 27(3\u20134), 445\u2013462 (2008)","journal-title":"Int. J. Robot. Res."},{"issue":"6356","key":"8_CR20","doi-asserted-by":"publisher","first-page":"eaan6558","DOI":"10.1126\/science.aan6558","volume":"357","author":"A Thubagere","year":"2017","unstructured":"Thubagere, A.: A cargo-sorting DNA robot. Science 357(6356), eaan6558 (2017)","journal-title":"Science"},{"issue":"6","key":"8_CR21","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1109\/70.817668","volume":"15","author":"K Tomita","year":"1999","unstructured":"Tomita, K., Murata, S., Kurokawa, H., Yoshida, E., Kokaji, S.: Self-assembly and self-repair method for a distributed mechanical system. IEEE Trans. Robot. Autom. 15(6), 1035\u20131045 (1999)","journal-title":"IEEE Trans. Robot. Autom."},{"issue":"48","key":"8_CR22","doi-asserted-by":"publisher","first-page":"4322","DOI":"10.1002\/anie.201107855","volume":"51","author":"Z Wang","year":"2012","unstructured":"Wang, Z., Elbaz, J., Willner, I.: A dynamically programmed DNA transporter. Angewandte Chemie Int. Ed. 51(48), 4322\u20134326 (2012)","journal-title":"Angewandte Chemie Int. Ed."},{"issue":"3","key":"8_CR23","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1038\/nnano.2011.253","volume":"7","author":"S Wickham","year":"2012","unstructured":"Wickham, S., Bath, J., Katsuda, Y., Endo, M., Hidaka, K., Sugiyama, H., Turberfield, A.: A DNA-based molecular motor that can navigate a network of tracks. Nat. Nanotechnol. 7(3), 169\u2013173 (2012)","journal-title":"Nat. Nanotechnol."},{"key":"8_CR24","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 4th Conference of Innovations in Theoretical Computer Science (ITCS), pp. 353\u2013354 (2013)","DOI":"10.1145\/2422436.2422476"}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00030-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T01:19:34Z","timestamp":1720574374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00030-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030000295","9783030000301"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00030-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DNA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on DNA Computing and Molecular Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dna2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dna24sdnu.com\/","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":"14","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":"12","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":"86% - 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":"5","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":"3","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)"}}]}}