{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T18:06:35Z","timestamp":1779818795319,"version":"3.53.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032060655","type":"print"},{"value":"9783032060662","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T00:00:00Z","timestamp":1759536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T00:00:00Z","timestamp":1759536000000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-06066-2_5","type":"book-chapter","created":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T13:28:44Z","timestamp":1759757324000},"page":"75-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial Edge Rewards"],"prefix":"10.1007","author":[{"given":"Vedangi","family":"Bengali","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolaj","family":"Tatti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Iiro","family":"Kumpulainen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Adriaens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nate","family":"Veldt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,4]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Becchetti, L., Fazzone, A., Menghini, C., Schwiegelshohn, C.: Spectral relaxations and fair densest subgraphs. In: CIKM, pp. 35\u201344 (2020)","DOI":"10.1145\/3340531.3412036"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chellapilla, K.: Finding dense subgraphs with size bounds. In: WAW, pp. 25\u201337 (2009)","DOI":"10.1007\/978-3-540-95995-3_3"},{"issue":"5","key":"5_CR3","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0020-0190(79)90072-3","volume":"9","author":"AM Andrew","year":"1979","unstructured":"Andrew, A.M.: Another efficient algorithm for convex hulls in two dimensions. Inf. Process. Lett. 9(5), 216\u2013219 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"5_CR4","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":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bera, S.K., Bhattacharya, S., Choudhari, J., Ghosh, P.: A new dynamic algorithm for densest subhypergraphs. In: TheWebConf, pp. 1093\u20131103 (2022)","DOI":"10.1145\/3485447.3512158"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 84\u201395. Springer (2000)","DOI":"10.1007\/3-540-44436-X_10"},{"key":"5_CR7","unstructured":"Chekuri, C., Quanrud, K.: $$(1-\\epsilon)$$-approximate fully dynamic densest subgraph: linear space and faster update time. arXiv preprint arXiv:2210.02611 (2022)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K., Torres, M.R.: Densest subgraph: supermodularity, iterative peeling, and flow. In: SODA, pp. 1531\u20131555 (2022)","DOI":"10.1137\/1.9781611977073.64"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Chen, T., Tsourakakis, C.: Antibenford subgraphs: unsupervised anomaly detection in financial networks. In: KDD, pp. 2762\u20132770 (2022)","DOI":"10.1145\/3534678.3539100"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Chodrow, P.S., Veldt, N., Benson, A.R.: Hypergraph clustering: from blockmodels to modularity. Sci. Adv. (2021)","DOI":"10.1126\/sciadv.abh1303"},{"issue":"14","key":"5_CR11","doi-asserted-by":"publisher","first-page":"e150","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), e150\u2013e157 (2006)","journal-title":"Bioinformatics"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Gajewar, A., Das\u00a0Sarma, A.: Multi-skill collaborative teams based on densest subgraphs. In: SDM, pp. 165\u2013176 (2012)","DOI":"10.1137\/1.9781611972825.15"},{"key":"5_CR13","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph, Technical report, UC Berkeley (1984)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Hu, S., Wu, X., Chan, T.H.: Maintaining densest subsets efficiently in evolving hypergraphs. In: CIKM, pp. 929\u2013938 (2017)","DOI":"10.1145\/3132847.3132907"},{"key":"5_CR15","unstructured":"Huang, D.H., Kahng, A.B.: When clusters meet partitions: new density-based methods for circuit decomposition. In: ED &TC, pp. 60\u201364 (1995)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Huang, Y., Gleich, D.F., Veldt, N.: Densest subhypergraph: negative supermodular functions and strongly localized methods. In: TheWebConf, pp. 881\u2013892 (2024)","DOI":"10.1145\/3589334.3645624"},{"key":"5_CR17","unstructured":"Kariotakis, E., Sidiropoulos, N.D., Konar, A.: Fairness-aware dense subgraph discovery. TMLR (2025)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: ICALP, pp. 597\u2013608 (2009)","DOI":"10.1007\/978-3-642-02927-1_50"},{"issue":"8","key":"5_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3653298","volume":"56","author":"T Lanciano","year":"2024","unstructured":"Lanciano, T., Miyauchi, A., Fazzone, A., Bonchi, F.: A survey on the densest subgraph problem and its variants. ACM Comput. Surv. 56(8), 1\u201340 (2024)","journal-title":"ACM Comput. Surv."},{"issue":"9","key":"5_CR20","doi-asserted-by":"publisher","first-page":"e0136497","DOI":"10.1371\/journal.pone.0136497","volume":"10","author":"R Mastrandrea","year":"2015","unstructured":"Mastrandrea, R., Fournet, J., Barrat, A.: Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PLoS ONE 10(9), e0136497 (2015)","journal-title":"PLoS ONE"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Miyauchi, A., Chen, T., Sotiropoulos, K., Tsourakakis, C.E.: Densest diverse subgraphs: how to plan a successful cocktail party with diversity. In: KDD, pp. 1710\u20131721 (2023)","DOI":"10.1145\/3580305.3599306"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Rangapuram, S.S., B\u00fchler, T., Hein, M.: Towards realistic team formation in social networks based on densest subgraphs. In: WWW, pp. 1077\u20131088 (2013)","DOI":"10.1145\/2488388.2488482"},{"issue":"8","key":"5_CR23","doi-asserted-by":"publisher","first-page":"e23176","DOI":"10.1371\/journal.pone.0023176","volume":"6","author":"J Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, J., et al.: High-resolution measurements of face-to-face contact patterns in a primary school. PLoS ONE 6(8), e23176 (2011)","journal-title":"PLoS ONE"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.: The k-clique densest subgraph problem. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1122\u20131132 (2015)","DOI":"10.1145\/2736277.2741098"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Veldt, N., Benson, A.R., Kleinberg, J.: The generalized mean densest subgraph problem. In: KDD, pp. 1604\u20131614 (2021)","DOI":"10.1145\/3447548.3467398"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Hu, S., Sheng, Z.: Extracting densest sub-hypergraph with convex edge-weight functions. In: International Conference on Theory and Applications of Models of Computation, pp. 305\u2013321. Springer (2022)","DOI":"10.1007\/978-3-031-20350-3_25"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06066-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T17:42:17Z","timestamp":1779817337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06066-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,4]]},"ISBN":["9783032060655","9783032060662"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06066-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,4]]},"assertion":[{"value":"4 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecmlpkdd.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}