{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:12:01Z","timestamp":1779174721246,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1907738, CCF-1909790, CCF-1813165, CCF-1740850"],"award-info":[{"award-number":["CCF-1907738, CCF-1909790, CCF-1813165, CCF-1740850"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/S03353X\/1"],"award-info":[{"award-number":["EP\/S03353X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3512158","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:13:07Z","timestamp":1650863587000},"page":"1093-1103","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["A New Dynamic Algorithm for Densest Subhypergraphs"],"prefix":"10.1145","author":[{"given":"Suman K.","family":"Bera","sequence":"first","affiliation":[{"name":"Katana Graph, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sayan","family":"Bhattacharya","sequence":"additional","affiliation":[{"name":"University of Warwick, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayesh","family":"Choudhari","sequence":"additional","affiliation":[{"name":"University of Warwick, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prantar","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Dartmouth College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168658"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2685298"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115"},{"key":"e_1_3_2_1_5_1","unstructured":"Suman\u00a0K. Bera Sayan Bhattacharya Jayesh Choudhari and Prantar Ghosh. 2021. A New Dynamic Algorithm for Densest Subhypergraphs. https:\/\/drive.google.com\/file\/d\/1P8rysfIgGnuChrJ_bsZ8l8UXfPBObx5O\/view."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623655"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380140"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0205-0"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178123"},{"key":"e_1_3_2_1_11_1","first-page":"1216","article-title":"Dense Subgraph Extraction with Application to Community Detection","volume":"24","author":"Chen J.","year":"2012","unstructured":"J. Chen and Y. Saad. 2012. Dense Subgraph Extraction with Application to Community Detection. IEEE TKDE 24, 7 (2012), 1216\u20131230.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_12_1","volume-title":"Efficient Densest Subgraph Computation in Evolving Graphs. In The 24th International Conf. on World Wide Web, (WWW). 300\u2013310","author":"Epasto Alessandro","year":"2015","unstructured":"Alessandro Epasto, Silvio Lattanzi, and Mauro Sozio. 2015. Efficient Densest Subgraph Computation in Evolving Graphs. In The 24th International Conf. on World Wide Web, (WWW). 300\u2013310."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1065"},{"key":"e_1_3_2_1_14_1","unstructured":"Schloss Dagstuhl Leibniz\u00a0Center for Informatics. 2020. DBLP dataset. https:\/\/dblp.uni-trier.de\/xml\/."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083676"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536342"},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. 21st Annual SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining. 2313\u20132314","author":"Gionis Aristides","year":"2015","unstructured":"Aristides Gionis and Charalampos\u00a0E. Tsourakakis. 2015. Dense Subgraph Discovery:KDD 2015 tutorial. In Proc. 21st Annual SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining. 2313\u20132314."},{"key":"e_1_3_2_1_18_1","volume-title":"Finding a maximum density subgraph","author":"Goldberg V","unstructured":"Andrew\u00a0V Goldberg. 1984. Finding a maximum density subgraph. University of California Berkeley."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132907"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. 16th ACM Conf. on Information and Knowledge Management, CIKM 2007","author":"J.","year":"2007","unstructured":"Kevin\u00a0J. Lang and Reid Andersen. 2007. Finding dense and isolated submarkets in a sponsored search spending graph. In Proc. 16th ACM Conf. on Information and Knowledge Management, CIKM 2007, Lisbon, Portugal, November 6-10, 2007. ACM, 613\u2013622."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"key":"e_1_3_2_1_22_1","unstructured":"Laurent Perron and Vincent Furnon. [n.d.]. OR-Tools. https:\/\/developers.google.com\/optimization\/"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Barna Saha Allison Hoch Samir Khuller Louiqa Raschid and Xiao-Ning Zhang. 2010. Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs. In Research in Computational Molecular Biology (RECOMB) Vol.\u00a06044. 456\u2013472.","DOI":"10.1007\/978-3-642-12683-3_30"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384327"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742839"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"}],"event":{"name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France","acronym":"WWW '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512158","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512158","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:14Z","timestamp":1750188674000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":27,"alternative-id":["10.1145\/3485447.3512158","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3512158","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}