{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:34:21Z","timestamp":1743100461873,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031211300"},{"type":"electronic","value":"9783031211317"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-21131-7_41","type":"book-chapter","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:04:15Z","timestamp":1674669855000},"page":"523-535","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Integrating Temporal Graphs via\u00a0Dual Networks: Dense Graph Discovery"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Dondi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pietro Hiram","family":"Guzzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Mehdi","family":"Hosseinzadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,26]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Braha, D., Bar-Yam, Y.: Time-dependent complex networks: dynamic centrality, dynamic motifs, and cycles of social interactions. In: Adaptive Networks, pp. 39\u201350. Springer (2009)","DOI":"10.1007\/978-3-642-01284-6_3"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Castelli, M., Dondi, R., Hosseinzadeh, M.M.: Genetic algorithms for finding episodes in temporal networks. In: Cristani, M., Toro, C., Zanni-Merk, C., Howlett, R.J., Jain, L.C. (eds.), Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, Virtual Event, 16\u201318 September 2020. Procedia Computer Science, vol. 176, pp. 215\u2013224. Elsevier (2020)","DOI":"10.1016\/j.procs.2020.08.023"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Proceedings, pp. 84\u201395 (2000)","DOI":"10.1007\/3-540-44436-X_10"},{"issue":"7","key":"41_CR4","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1109\/TKDE.2010.271","volume":"24","author":"J Chen","year":"2010","unstructured":"Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection. IEEE Trans. Knowl. Data Eng. 24(7), 1216\u20131230 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"41_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42979-021-00593-w","volume":"2","author":"R Dondi","year":"2021","unstructured":"Dondi, R., Hosseinzadeh, M.M.: Dense sub-networks discovery in temporal networks. SN Comput. Sci. 2(3), 1\u201311 (2021)","journal-title":"SN Comput. Sci."},{"issue":"1","key":"41_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/s41109-021-00381-8","volume":"6","author":"R Dondi","year":"2021","unstructured":"Dondi, R., Hosseinzadeh, M.M., Guzzi, P.H.: A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks. Appl. Netw. Sci. 6(1), 40 (2021)","journal-title":"Appl. Netw. Sci."},{"issue":"1","key":"41_CR7","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s10878-020-00664-3","volume":"41","author":"R Dondi","year":"2021","unstructured":"Dondi, R., Hosseinzadeh, M.M., Mauri, G., Zoppis, I.: Top-k overlapping densest subgraphs: approximation algorithms and computational complexity. J. Comb. Optim. 41(1), 80\u2013104 (2021)","journal-title":"J. Comb. Optim."},{"issue":"5","key":"41_CR8","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1007\/s10618-016-0464-z","volume":"30","author":"E Galbrun","year":"2016","unstructured":"Galbrun, E., Gionis, A., Tatti, N.: Top-k overlapping densest subgraphs. Data Min. Knowl. Discov. 30(5), 1134\u20131165 (2016)","journal-title":"Data Min. Knowl. Discov."},{"key":"41_CR9","volume-title":"Finding a Maximum Density Subgraph","author":"AV Goldberg","year":"1984","unstructured":"Goldberg, A.V.: Finding a Maximum Density Subgraph. Tech. rep, Berkeley, CA, USA (1984)"},{"issue":"9","key":"41_CR10","doi-asserted-by":"publisher","first-page":"2544","DOI":"10.1093\/bioinformatics\/btac133","volume":"38","author":"S Gu","year":"2022","unstructured":"Gu, S., Jiang, M., Guzzi, P.H., Milenkovi\u0107, T.: Modeling multi-scale data via a network of networks. Bioinformatics 38(9), 2544\u20132553 (2022)","journal-title":"Bioinformatics"},{"issue":"3","key":"41_CR11","first-page":"472","volume":"19","author":"PH Guzzi","year":"2018","unstructured":"Guzzi, P.H., Milenkovi\u0107, T.: Survey of local and global biological network alignment: the need to reconcile the two sides of the same coin. Briefings Bioinform. 19(3), 472\u2013481 (2018)","journal-title":"Briefings Bioinform."},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Hosseinzadeh, M.M.: Dense subgraphs in biological networks. In: International Conference on Current Trends in Theory and Practice of Informatics, pp. 711\u2013719. Springer (2020)","DOI":"10.1007\/978-3-030-38919-2_60"},{"issue":"12","key":"41_CR13","doi-asserted-by":"publisher","first-page":"3461","DOI":"10.1007\/s00453-017-0400-7","volume":"80","author":"Y Kawase","year":"2018","unstructured":"Kawase, Y., Miyauchi, A.: The densest subgraph problem with a convex\/concave size function. Algorithmica 80(12), 3461\u20133480 (2018)","journal-title":"Algorithmica"},{"issue":"4","key":"41_CR14","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."},{"issue":"1","key":"41_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-020-60737-5","volume":"10","author":"M Milano","year":"2020","unstructured":"Milano, M., Milenkovi\u0107, T., Cannataro, M., Guzzi, P.H.: L-hetnetaligner: a novel algorithm for local alignment of heterogeneous biological networks. Sci. Rep. 10(1), 1\u201320 (2020)","journal-title":"Sci. Rep."},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Rozenshtein, P., Gionis, A.: Mining temporal networks. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 3225\u20133226. ACM (2019)","DOI":"10.1145\/3292500.3332295"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Wu, Y., Zhu, X., Li, L., Fan, W., Jin, R., Zhang, X.: Mining Dual Networks\u2014Models, Algorithms, and Applications. TKDD (2016)","DOI":"10.1145\/2785970"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21131-7_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:09:01Z","timestamp":1674670141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21131-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031211300","9783031211317"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21131-7_41","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2016","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}