{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:49:14Z","timestamp":1767034154615,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030653507"},{"type":"electronic","value":"9783030653514"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-65351-4_47","type":"book-chapter","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:03:06Z","timestamp":1609797786000},"page":"585-596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Top-k Connected Overlapping Densest Subgraphs in Dual Networks"],"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":[[2021,1,5]]},"reference":[{"issue":"2","key":"47_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. J. Algorithms 34(2), 203\u2013221 (2000)","journal-title":"J. Algorithms"},{"key":"47_CR2","unstructured":"Balalau, O.D., Bonchi, F., Chan, T.H., Gullo, F., Sozio, M.: Finding subgraphs with maximum total density and limited overlap. In: Cheng, X., Li, H., Gabrilovich, E., Tang, J. (eds.) Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, WSDM 2015, Shanghai, China, February 2-6, 2015, pp. 379\u2013388. ACM (2015)"},{"issue":"3","key":"47_CR3","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.future.2009.08.001","volume":"26","author":"M Cannataro","year":"2010","unstructured":"Cannataro, M., Guzzi, P.H., Veltri, P.: Impreco: distributed prediction of protein complexes. Fut. Gener. Comput. Syst. 26(3), 434\u2013440 (2010)","journal-title":"Fut. Gener. Comput. Syst."},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: All-pairs shortest paths for unweighted undirected graphs in o(mn) time. ACM Trans. Algorithms 8(4) (2012)","DOI":"10.1145\/2344422.2344424"},{"key":"47_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Proceedings","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Proceedings. Lecture Notes in Computer Science, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000)"},{"key":"47_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization. APPROX 2000","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy Approximation Algorithms for Finding Dense Components in a Graph. In: Jansen, K., Khuller, S. (eds.) Approximation Algorithms for Combinatorial Optimization. APPROX 2000. Lecture Notes in Computer Science, vol. 1913, pp. 84\u201395. Springer, Berlin, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_10"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Cho, E., Myers, S.A., Leskovec, J.: Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 1082\u20131090. ACM (2011)","DOI":"10.1145\/2020408.2020579"},{"key":"47_CR8","unstructured":"Dondi, R., Hosseinzadeh, M.M., Mauri, G., Zoppis, I.: Top-k overlapping densest subgraphs: Approximation and complexity. In: Proceedings of the 20th Italian Conference on Theoretical Computer Science, ICTCS 2019, Como, Italy, September 9-11, 2019, pp. 110\u2013121 (2019)"},{"issue":"2","key":"47_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.7155\/jgaa.00491","volume":"23","author":"R Dondi","year":"2019","unstructured":"Dondi, R., Mauri, G., Sikora, F., Zoppis, I.: Covering a graph with clubs. J. Graph Algorithms Appl. 23(2), 271\u2013292 (2019)","journal-title":"J. Graph Algorithms Appl."},{"issue":"5","key":"47_CR10","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":"47_CR11","unstructured":"Goldberg, A.: Finding a maximum density subgraph. Technical report. Uni. California, Berkeley (1984)"},{"issue":"1","key":"47_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1186\/1471-2105-11-315","volume":"11","author":"PH Guzzi","year":"2010","unstructured":"Guzzi, P.H., Cannataro, M.: $$\\mu $$-cs: An extension of the TM4 platform to manage Affymetrix binary data. BMC Bioinform. 11(1), 315 (2010)","journal-title":"BMC Bioinform."},{"key":"47_CR13","doi-asserted-by":"crossref","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 in Bioinformatics p. bbw132 (2017)","DOI":"10.1093\/bib\/bbw132"},{"key":"47_CR14","unstructured":"Hagberg, A., Swart, P., S\u00a0Chult, D.: Exploring network structure, dynamics, and function using networkx. Technical report, Los Alamos National Lab.(LANL), Los Alamos, NM (United States) (2008)"},{"key":"47_CR15","unstructured":"Hastad, J.: Clique is hard to approximate within n\/sup 1-\/spl epsiv. In: Proceedings of 37th Conference on Foundations of Computer Science, pp. 627\u2013636. IEEE (1996)"},{"key":"47_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/978-3-030-38919-2_60","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science. SOFSEM 2020","author":"MM Hosseinzadeh","year":"2020","unstructured":"Hosseinzadeh, M.M.: Dense Subgraphs in Biological Networks. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020: Theory and Practice of Computer Science. SOFSEM 2020. Lecture Notes in Computer Science, vol. 12011, pp. 711\u2013719. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_60"},{"issue":"12","key":"47_CR17","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":"1","key":"47_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3390\/a9010021","volume":"9","author":"C Komusiewicz","year":"2016","unstructured":"Komusiewicz, C.: Multivariate Algorithmics for Finding Cohesive Subnetworks. Algorithms 9(1), 21 (2016)","journal-title":"Algorithms"},{"key":"47_CR19","series-title":"Advances in Database Systems","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-1-4419-6045-0_10","volume-title":"Managing and Mining Graph Data","author":"VE Lee","year":"2010","unstructured":"Lee, V.E., Ruan, N., Jin, R., Aggarwal, C.: A survey of algorithms for dense subgraph discovery. In: Aggarwal, C., Wang, H. (eds.) Managing and Mining Graph Data. Advances in Database Systems, vol. 40, pp. 303\u2013336. Springer, Boston, MA (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6045-0_10"},{"issue":"1","key":"47_CR20","first-page":"2","volume":"13","author":"X Liu","year":"2018","unstructured":"Liu, X., Shen, C., Guan, X., Zhou, Y.: Digger: detect similar groups in heterogeneous social networks. ACM Trans. Knowl. Disc. Data (TKDD) 13(1), 2 (2018)","journal-title":"ACM Trans. Knowl. Disc. Data (TKDD)"},{"issue":"1","key":"47_CR21","first-page":"3901","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. Reports 10(1), 3901 (2020)","journal-title":"Sci. Reports"},{"issue":"11","key":"47_CR22","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1038\/nrg2452","volume":"9","author":"PC Phillips","year":"2008","unstructured":"Phillips, P.C.: Epistasis \u2014 the essential role of gene interactions in the structure and evolution of genetic systems. Nat. Rev. Genet. 9(11), 855\u2013867 (2008)","journal-title":"Nat. Rev. Genet."},{"key":"47_CR23","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1016\/j.future.2016.10.019","volume":"86","author":"A Sapountzi","year":"2018","unstructured":"Sapountzi, A., Psannis, K.E.: Social networking data analysis tools & challenges. Fut. Gener. Comput. Syst. 86, 893\u2013913 (2018)","journal-title":"Fut. Gener. Comput. Syst."},{"key":"47_CR24","doi-asserted-by":"crossref","unstructured":"Szklarczyk, D., Morris, J.H., Cook, H., Kuhn, M., Wyder, S., Simonovic, M., Santos, A., Doncheva, N.T., Roth, A., Bork, P., et\u00a0al.: The string database in 2017: quality-controlled protein\u2013protein association networks, made broadly accessible. Nucleic acids research p. gkw937 (2016)","DOI":"10.1093\/nar\/gkw937"},{"key":"47_CR25","doi-asserted-by":"crossref","unstructured":"Wu, Y., Zhu, X., Li, L., Fan, W., Jin, R., Zhang, X.: Mining Dual Networks - Models, Algorithms, and Applications. TKDD (2016)","DOI":"10.1145\/2785970"},{"key":"47_CR26","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Community-affiliation graph model for overlapping network community detection. In: 2012 IEEE 12th International Conference on Data Mining, pp. 1170\u20131175. IEEE (2012)","DOI":"10.1109\/ICDM.2012.139"},{"key":"47_CR27","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the in-approximability of max clique and chromatic number. In: Kleinberg, J.M. (ed.) Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 681\u2013690. ACM (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65351-4_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T21:09:22Z","timestamp":1697490562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65351-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030653507","9783030653514"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65351-4_47","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2020","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2020","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"}}]}}