{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:44:15Z","timestamp":1767008655012,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031745799"},{"type":"electronic","value":"9783031745805"}],"license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-74580-5_10","type":"book-chapter","created":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T15:35:42Z","timestamp":1735227342000},"page":"131-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Threshold of\u00a0Existence of\u00a0$$\\delta $$-Temporal Cliques in\u00a0Random Simple Temporal Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7182-585X","authenticated-orcid":false,"given":"George B.","family":"Mertzios","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3765-5636","authenticated-orcid":false,"given":"Sotiris","family":"Nikoletseas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9837-2632","authenticated-orcid":false,"given":"Christoforos","family":"Raptopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5396-3749","authenticated-orcid":false,"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Aaron, E., Krizanc, D., Meyerson, E.: DMVP: foremost waypoint coverage of time-varying graphs. In: Proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp. 29\u201341 (2014)","DOI":"10.1007\/978-3-319-12340-0_3"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jpdc.2015.10.002","volume":"87","author":"EC Akrida","year":"2016","unstructured":"Akrida, E.C., Gasieniec, L., Mertzios, G.B., Spirakis, P.G.: Ephemeral networks with random availability of links: the case of fast networks. J. Parallel Distrib. Comput. 87, 109\u2013120 (2016)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s00224-017-9757-x","volume":"61","author":"EC Akrida","year":"2017","unstructured":"Akrida, E.C., Gasieniec, L., Mertzios, G.B., Spirakis, P.G.: The complexity of optimal design of temporally connected graphs. Theory Comput. Syst. 61(3), 907\u2013944 (2017)","journal-title":"Theory Comput. Syst."},{"key":"10_CR4","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":"10_CR5","unstructured":"Anagnostopoulos, A., Lacki, J., Lattanzi, S., Leonardi, S., Mahdian, M.: Community detection on evolving graphs. In: Proceedings of the 30th Conference on Neural Information Processing Systems (NIPS), pp. 3522\u20133530 (2016)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bentert, M., Himmel, A.-S., Molter, H., Morik, M., Niedermeier, R., Saitenmacher, R.: Listing all maximal $$k$$-plexes in temporal graphs. In: Proceedings of the 2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 41\u201346 (2018)","DOI":"10.1109\/ASONAM.2018.8508847"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1017\/S0305004100053056","volume":"80","author":"B Bollob\u00e1s","year":"1976","unstructured":"Bollob\u00e1s, B., Erd\u0151s, P.: Cliques in random graphs. Math. Proc. Camb. Phil. Soc. 80, 419\u2013427 (1976)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"issue":"9","key":"10_CR8","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1007\/s00453-021-00831-w","volume":"83","author":"A Casteigts","year":"2021","unstructured":"Casteigts, A., Himmel, A., Molter, H., Zschoche, P.: Finding temporal paths under waiting time constraints. Algorithmica 83(9), 2754\u20132802 (2021)","journal-title":"Algorithmica"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Casteigts, A., Raskin, M., Renken, M., Zamaraev, V.: Sharp thresholds in random simple temporal graphs. In: Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 319\u2013326 (2021)","DOI":"10.1109\/FOCS52979.2021.00040"},{"key":"10_CR10","unstructured":"Chen, J., Molter, H., Sorge, M., Such\u00fd, O.: Cluster editing in multi-layer and temporal graphs. In: Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC), vol. 123, pp. 24:1\u201324:13 (2018)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jcss.2021.01.007","volume":"119","author":"JA Enright","year":"2021","unstructured":"Enright, J.A., 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":"10_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2021.01.005","volume":"119","author":"T Erlebach","year":"2021","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: On temporal graph exploration. J. Comput. Syst. Sci. 119, 1\u201318 (2021)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"10_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MNET.2004.1337732","volume":"18","author":"A Ferreira","year":"2004","unstructured":"Ferreira, A.: Building a reference combinatorial model for MANETs. IEEE Netw. 18(5), 24\u201329 (2004)","journal-title":"IEEE Netw."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Ghosal, S., Ghosh, S.C.: Channel assignment in mobile networks based on geometric prediction and random coloring. In: Proceedings of the 40th IEEE Conference on Local Computer Networks (LCN), pp. 237\u2013240 (2015)","DOI":"10.1109\/LCN.2015.7366315"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Hamm, T., Klobas, N., Mertzios, G.B., Spirakis, P.G.: The complexity of temporal vertex cover in small-degree graphs. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI), pp. 10193\u201310201 (2022)","DOI":"10.1609\/aaai.v36i9.21259"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Heeger, K., Hermelin, D., Mertzios, G.B., Molter, H., Niedermeier, R., Shabtay, D.: Equitable scheduling on a single machine. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), pp. 11818\u201311825 (2021)","DOI":"10.1609\/aaai.v35i13.17404"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Himmel, A., Molter, H., Niedermeier, R., Sorge, M.: Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs.Soc. Netw. Anal. Min. 7(1), 35:1\u201335:16 (2017)","DOI":"10.1007\/s13278-017-0455-0"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 504\u2013513 (2000)","DOI":"10.1145\/335305.335364"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Klobas, N., Mertzios, G.B., Molter, H., Niedermeier, R., Zschoche, P.: Interference-free walks in time: temporally disjoint paths. Auton. Agents Multi-Agent Syst. 37(1) (2023)","DOI":"10.1007\/s10458-022-09583-5"},{"key":"10_CR20","unstructured":"Klobas, N., Mertzios, G.B., Molter, H., Spirakis, P.G.: The complexity of computing optimum labelings for temporal connectivity. In: Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 62:1\u201362:15 (2022)"},{"key":"10_CR21","unstructured":"Klobas, N., Mertzios, G.B., Spirakis, P.G.: Sliding into the future: investigating sliding windows in temporal graphs. In: Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 5:1\u20135:12 (2023)"},{"issue":"4","key":"10_CR22","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"},{"key":"10_CR23","unstructured":"Mertzios, G.B., Molter, H., Renken, M., Spirakis, P.G., Zschoche, P.: The complexity of transitively orienting temporal graphs. In: Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 75:1\u201375:18 (2021)"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jcss.2021.03.005","volume":"120","author":"GB Mertzios","year":"2021","unstructured":"Mertzios, G.B., Molter, H., Zamaraev, V.: Sliding window temporal graph coloring. J. Comput. Syst. Sci. 120, 97\u2013115 (2021)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10_CR25","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\u201372 (2018)","journal-title":"Commun. ACM"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.006","volume":"634","author":"O Michail","year":"2016","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. Theor. Comput. Sci. 634, 1\u201323 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Santoro, N.: Computing in time-varying networks. In: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), p.\u00a04 (2011)","DOI":"10.1007\/978-3-642-24550-3_2"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.tcs.2015.09.030","volume":"609","author":"T Viard","year":"2016","unstructured":"Viard, T., Latapy, M., Magnien, C.: Computing maximal cliques in link streams. Theor. Comput. Sci. 609, 245\u2013252 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Yu, F., Bar-Noy, A., Basu, P., Ramanathan, R.: Algorithms for channel assignment in mobile wireless networks using temporal coloring. In: Proceedings of the 16th ACM International Conference on Modeling, Analysis & Simulation of Wireless and Mobile Systems (MSWiM), pp. 49\u201358 (2013)","DOI":"10.1145\/2507924.2507965"},{"key":"10_CR30","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."}],"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-74580-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T16:02:57Z","timestamp":1735228977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74580-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"ISBN":["9783031745799","9783031745805"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74580-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"assertion":[{"value":"27 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOWIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmics of Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2024\/algowin\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}