{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:26:30Z","timestamp":1763810790331,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030950170"},{"type":"electronic","value":"9783030950187"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95018-7_13","type":"book-chapter","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:04Z","timestamp":1642982704000},"page":"152-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Covering a\u00a0Graph with\u00a0Densest Subgraphs"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Dondi","sequence":"first","affiliation":[]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-95995-3_3","volume-title":"Algorithms and Models for the Web-Graph","author":"R Andersen","year":"2009","unstructured":"Andersen, R., Chellapilla, K.: Finding dense subgraphs with size bounds. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol. 5427, pp. 25\u201337. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-95995-3_3"},{"issue":"1\u20133","key":"13_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y Asahiro","year":"2002","unstructured":"Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discret. Appl. Math. 121(1\u20133), 15\u201326 (2002)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"13_CR3","first-page":"454","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani, B., Kumar, R., Vassilvitskii, S.: Densest subgraph in streaming and mapreduce. PVLDB 5(5), 454\u2013465 (2012)","journal-title":"PVLDB"},{"key":"13_CR4","doi-asserted-by":"crossref","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, pp. 379\u2013388. ACM (2015)","DOI":"10.1145\/2684822.2685298"},{"key":"13_CR5","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","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_10"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1","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), 1\u201317 (2021). https:\/\/doi.org\/10.1007\/s41109-021-00381-8","journal-title":"Appl. Netw. Sci."},{"issue":"1","key":"13_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":"2","key":"13_CR8","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":"14","key":"13_CR9","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1093\/bioinformatics\/btl243","volume":"22","author":"E Fratkin","year":"2006","unstructured":"Fratkin, E., Naughton, B.T., Brutlag, D.L., Batzoglou, S.: Motifcut: regulatory motifs finding with maximum density subgraphs. Bioinformatics 22(14), 156\u2013157 (2006)","journal-title":"Bioinformatics"},{"issue":"5","key":"13_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."},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1), 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"13_CR12","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph. Technical report, Berkeley, CA, USA (1984)"},{"key":"13_CR13","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Proceedings of a Symposium on the Complexity of Computer Computations, The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"12","key":"13_CR14","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"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-642-02927-1_50","volume-title":"Automata, Languages and Programming","author":"S Khuller","year":"2009","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 597\u2013608. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_50"},{"issue":"1","key":"13_CR16","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"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/jagm.1994.1032","volume":"17","author":"G Kortsarz","year":"1994","unstructured":"Kortsarz, G., Peleg, D.: Generating sparse 2-spanners. J. Algorithms 17(2), 222\u2013236 (1994)","journal-title":"J. Algorithms"},{"issue":"11\u201316","key":"13_CR18","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"R Kumar","year":"1999","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the web for emerging cyber-communities. Comput. Netw. 31(11\u201316), 1481\u20131493 (1999)","journal-title":"Comput. Netw."},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29\u2013123 (2009)","journal-title":"Internet Math."},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce, R.D., Perry, A.D.: A method of matrix analysis of group structure. Psychometrika 14(2), 95\u2013116 (1949)","journal-title":"Psychometrika"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Nasir, M.A.U., Gionis, A., Morales, G.D.F., Girdzijauskas, S.: Fully dynamic algorithm for top-k densest subgraphs. In: Lim, E., (eds.) Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM 2017, pp. 1817\u20131826. ACM (2017)","DOI":"10.1145\/3132847.3132966"},{"issue":"4","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1007\/s10115-019-01403-9","volume":"62","author":"P Rozenshtein","year":"2019","unstructured":"Rozenshtein, P., Bonchi, F., Gionis, A., Sozio, M., Tatti, N.: Finding events in temporal networks: segmentation meets densest subgraph discovery. Knowl. Inf. Syst. 62(4), 1611\u20131639 (2019). https:\/\/doi.org\/10.1007\/s10115-019-01403-9","journal-title":"Knowl. Inf. Syst."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: Rao, B., Krishnapuram, B., Tomkins, A., Yang, Q. (eds.) Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, 25\u201328 July 2010, pp. 939\u2013948. ACM (2010)","DOI":"10.1145\/1835804.1835923"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Tatti, N., Gionis, A.: Density-friendly graph decomposition. In: Gangemi, A., Leonardi, S., Panconesi, A. (eds.) Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, 18\u201322 May 2015, pp. 1089\u20131099. ACM (2015)","DOI":"10.1145\/2736277.2741119"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-31235-9_14","volume-title":"Scientific and Statistical Database Management","author":"E Valari","year":"2012","unstructured":"Valari, E., Kontaki, M., Papadopoulos, A.N.: Discovery of top-k dense subgraphs in dynamic graph collections. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol. 7338, pp. 213\u2013230. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31235-9_14"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2017.10.018","volume":"734","author":"P Zou","year":"2018","unstructured":"Zou, P., Li, H., Wang, W., Xin, C., Zhu, B.: Finding disjoint dense clubs in a social network. Theor. Comput. Sci. 734, 15\u201323 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR27","unstructured":"Zou, Z.: Polynomial-time algorithm for finding densest subgraphs in uncertain graphs. In: Proceedings of Internation Workshop on Mining and Learning with Graphs (2013)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95018-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:23:31Z","timestamp":1726514611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95018-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030950170","9783030950187"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95018-7_13","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":"24 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puducherry","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acsdm.org\/caldam\/2022\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","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":"25","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":"31% - 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","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":"6","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)"}},{"value":"Conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}