{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:25:27Z","timestamp":1743042327505,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"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_9","type":"book-chapter","created":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T12:14:39Z","timestamp":1670847279000},"page":"123-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Complexity of\u00a0Growing a\u00a0Graph"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7182-585X","authenticated-orcid":false,"given":"George B.","family":"Mertzios","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6234-3960","authenticated-orcid":false,"given":"Othon","family":"Michail","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2514-8004","authenticated-orcid":false,"given":"George","family":"Skretas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5396-3749","authenticated-orcid":false,"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3699-0179","authenticated-orcid":false,"given":"Michail","family":"Theofilatos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,13]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jcss.2019.08.002","volume":"107","author":"EC Akrida","year":"2020","unstructured":"Akrida, E.C., Mertzios, G.B., Spirakis, P.G., Zamaraev, V.: Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107, 108\u2013123 (2020)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Chen, J., Wu, Y., Yin, Y.: Fast construction of overlay networks. In: Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 145\u2013154 (2005)","DOI":"10.1145\/1073970.1073991"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"37:1","DOI":"10.1145\/1290672.1290674","volume":"3","author":"J Aspnes","year":"2007","unstructured":"Aspnes, J., Shah, G.: Skip graphs. ACM Transactions on Algorithms 3(4), 37:1-37:25 (2007)","journal-title":"ACM Transactions on Algorithms"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Augustine, J., Pandurangan, G., Robinson, P., Upfal, E.: Towards robust and efficient computation in dynamic peer-to-peer networks. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 551\u2013569 (2012)","DOI":"10.1137\/1.9781611973099.47"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/0095-8956(91)90004-4","volume":"51","author":"H-J Bandelt","year":"1991","unstructured":"Bandelt, H.-J., Prisner, E.: Clique graphs and helly graphs. J. Comb. Theory Series B 51(1), 34\u201345 (1991)","journal-title":"J. Comb. Theory Series B"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Clementi, A., Pasquale, F., Trevisan, L., Ziccardi, I.: Expansion and flooding in dynamic random networks with node churn. In: Proceedings of the 41st IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 976\u2013986 (2021)","DOI":"10.1109\/ICDCS51616.2021.00097"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<125::AID-NET1>3.0.CO;2-P","volume":"28","author":"KA Berman","year":"1996","unstructured":"Berman, K.A.: Vulnerability of scheduled networks and a generalization of Menger\u2019s theorem. Netw.: Int. J. 28(3), 125\u2013134 (1996)","journal-title":"Netw.: Int. J."},{"key":"9_CR8","series-title":"Number 73 in Cambridge Studies in Advanced Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. Number 73 in Cambridge Studies in Advanced Mathematics, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1103\/PhysRevLett.59.521","volume":"59","author":"L Bombelli","year":"1987","unstructured":"Bombelli, L., Lee, J., Meyer, D., Sorkin, R.D.: Space-time as a causal set. Phys. Rev. Lett. 59(5), 521 (1987)","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"9_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"7759","key":"9_CR11","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":"9_CR12","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s00224-007-9011-z","volume":"42","author":"I Chatzigiannakis","year":"2008","unstructured":"Chatzigiannakis, I., Kinalis, A., Nikoletseas, S.: Adaptive energy management for incremental deployment of heterogeneous wireless sensors. Theory Comput. Syst. 42, 42\u201372 (2008). https:\/\/doi.org\/10.1007\/s00224-007-9011-z","journal-title":"Theory Comput. Syst."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Cordeiro, M., Sarmento, R.P., Brazdil, P., Gama, J.: Evolving networks and social network analysis methods and techniques, Chapter 7. In: Social Media and Journalism (2018)","DOI":"10.5772\/intechopen.79041"},{"issue":"12","key":"9_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":"9_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jcss.2021.01.007","volume":"119","author":"J Enright","year":"2021","unstructured":"Enright, J., Meeks, K., Mertzios, G.B., Zamaraev, V.: Deleting edges to restrict the size of an epidemic in temporal networks. J. Comput. Syst. Sci. 119, 60\u201377 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Gilbert, S., Pandurangan, G., Robinson, P., Trehan, A.: Dconstructor: efficient and robust network construction with polylogarithmic overhead. In: Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC) (2020)","DOI":"10.1145\/3382734.3405716"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-030-24922-9_18","volume-title":"Structural Information and Communication Complexity","author":"T G\u00f6tte","year":"2019","unstructured":"G\u00f6tte, T., Hinnenthal, K., Scheideler, C.: Faster construction of overlay networks. In: Censor-Hillel, K., Flammini, M. (eds.) SIROCCO 2019. LNCS, vol. 11639, pp. 262\u2013276. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24922-9_18"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"G\u00f6tte, T., Hinnenthal, K., Scheideler, C., Werthmann, J.: Time-optimal construction of overlay networks. In: Proceedings of the 40th ACM Symposium on Principles of Distributed Computing (PODC), pp. 457\u2013468 (2021)","DOI":"10.1145\/3465084.3467932"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1019625207705","volume":"13","author":"A Howard","year":"2002","unstructured":"Howard, A., Matari\u0107, M.J., Sukhatme, G.S.: An incremental self-deployment algorithm for mobile sensor networks. Auton. Robots 13, 113\u2013126 (2002). https:\/\/doi.org\/10.1023\/A:1019625207705","journal-title":"Auton. Robots"},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48686-0_1","volume-title":"Computing and Combinatorics","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.S.: The web as a graph: measurements, models, and methods. In: Asano, T., Imai, H., Lee, D.T., Nakano, S., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 1\u201317. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48686-0_1"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2011.12.006","volume":"426","author":"MC Lin","year":"2012","unstructured":"Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L.: Arboricity, h-index, and dynamic algorithms. Theoret. Comput. Sci. 426, 75\u201390 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1007\/s00453-018-0478-6","volume":"81","author":"GB Mertzios","year":"2019","unstructured":"Mertzios, G.B., Michail, O., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. Algorithmica 81(4), 1416\u20131449 (2019)","journal-title":"Algorithmica"},{"issue":"4","key":"9_CR24","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016)","journal-title":"Internet Math."},{"key":"9_CR25","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":"9_CR26","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 ACM Symposium on Principles of Distributed Computing (PODC), pp. 448\u2013457 (2020)","DOI":"10.1145\/3382734.3405744"},{"issue":"2","key":"9_CR27","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/3156693","volume":"61","author":"O Michail","year":"2018","unstructured":"Michail, O., Spirakis, P.G.: Elements of the theory of dynamic networks. Commun. ACM 61(2), 72 (2018)","journal-title":"Commun. ACM"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"77","DOI":"10.3389\/fpls.2019.00077","volume":"10","author":"HA M\u00e9ndez-Hern\u00e1ndez","year":"2019","unstructured":"M\u00e9ndez-Hern\u00e1ndez, H.A., et al.: Signaling overview of plant somatic embryogenesis. Front. Plant Sci. 10, 77 (2019)","journal-title":"Front. Plant Sci."},{"key":"9_CR29","unstructured":"Poston, T.: Fuzzy geometry. Ph.D. thesis, University of Warwick (1971)"},{"issue":"2","key":"9_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevD.61.024002","volume":"61","author":"DP Rideout","year":"1999","unstructured":"Rideout, D.P., Sorkin, R.D.: Classical sequential growth dynamics for causal sets. Phys. Rev. D 61(2), 024002 (1999)","journal-title":"Phys. Rev. D"},{"issue":"7082","key":"9_CR31","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1038\/nature04586","volume":"440","author":"PWK Rothemund","year":"2006","unstructured":"Rothemund, P.W.K.: Folding DNA to create nanoscale shapes and patterns. Nature 440(7082), 297\u2013302 (2006)","journal-title":"Nature"},{"key":"9_CR32","unstructured":"Scheideler, C., Setzer, A.: On the complexity of local graph transformations. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1093\/comjnl\/28.1.78","volume":"28","author":"H Williams","year":"1985","unstructured":"Williams, H.: A linear algorithm for colouring planar graphs with five colours. Comput. J. 28, 78\u201381 (1985)","journal-title":"Comput. J."},{"key":"9_CR34","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"},{"key":"9_CR35","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jcss.2019.07.006","volume":"107","author":"P Zschoche","year":"2020","unstructured":"Zschoche, P., Fluschnik, T., Molter, H., Niedermeier, R.: The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. 107, 72\u201392 (2020)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR36","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3, 103\u2013128 (2007)","journal-title":"Theory Comput."}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T12:15:49Z","timestamp":1670847349000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22050-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031220494","9783031220500"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22050-0_9","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)"}}]}}