{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:30:17Z","timestamp":1763458217271,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP17K12646, JP19K20218, JP20K19739, JP21K17708, JP21H03397"],"award-info":[{"award-number":["JP17K12646, JP19K20218, JP20K19739, JP21K17708, JP21H03397"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJPR2122"],"award-info":[{"award-number":["JPMJPR2122"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,2,27]]},"DOI":"10.1145\/3539597.3570444","type":"proceedings-article","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T23:27:00Z","timestamp":1677108420000},"page":"886-894","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5626-779X","authenticated-orcid":false,"given":"Yasushi","family":"Kawase","sequence":"first","affiliation":[{"name":"The University of Tokyo, Bunkyo-ku, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6033-6433","authenticated-orcid":false,"given":"Atsushi","family":"Miyauchi","sequence":"additional","affiliation":[{"name":"The University of Tokyo, Bunkyo-ku, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4005-3206","authenticated-orcid":false,"given":"Hanna","family":"Sumita","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology, Meguro-ku, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,2,27]]},"reference":[{"volume-title":"Proceedings of VLDB. 574--585","author":"Angel A.","key":"e_1_3_2_2_1_1","unstructured":"A. Angel, N. Sarkas, N. Koudas, and D. Srivastava. 2012. Dense subgraph maintenance under streaming edge weight updates for real-time story identification. In Proceedings of VLDB. 574--585."},{"key":"e_1_3_2_2_2_1","volume-title":"Dynamic Noncooperative Game Theory. Classics in Applied Mathematics","volume":"23","author":"Bacsar T.","unstructured":"T. Bacsar and G. J. Olsder. 1999. Dynamic Noncooperative Game Theory. Classics in Applied Mathematics, Vol. 23. SIAM."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-4-2"},{"volume-title":"Proceedings of WSDM. 379--388","author":"Balalau O. D.","key":"e_1_3_2_2_4_1","unstructured":"O. D. Balalau, F. Bonchi, T-H. H. Chan, F. Gullo, and M. Sozio. 2015. Finding subgraphs with maximum total density and limited overlap. In Proceedings of WSDM. 379--388."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2017.2775152"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009615"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2014.07.001"},{"key":"e_1_3_2_2_8_1","volume-title":"Proceedings of The Web Conference","author":"Boob D.","year":"2020","unstructured":"D. Boob, Y. Gao, R. Peng, S. Sawlani, C. E. Tsourakakis, D. Wang, and J. Wang. 2020. Flowless: Extracting densest subgraphs without flow computations. In Proceedings of The Web Conference 2020. 573--583."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_2_2_10_1","unstructured":"M. Charikar Y. Naamad and J. Wu. 2018. On finding dense common subgraphs. arXiv preprint arXiv:1802.06361 (2018)."},{"volume-title":"Proceedings of SODA. 1531--1555","author":"Chekuri C.","key":"e_1_3_2_2_11_1","unstructured":"C. Chekuri, K. Quanrud, and M. R. Torres. 2022. Densest subgraph: Supermodularity, iterative peeling, and flow. In Proceedings of SODA. 1531--1555."},{"key":"e_1_3_2_2_12_1","first-page":"15879","article-title":"The average distances in random graphs with given expected degrees","volume":"1","author":"Chung F.","year":"2002","unstructured":"F. Chung and L. Lu. 2002. The average distances in random graphs with given expected degrees. Internet Mathematics, Vol. 1 (2002), 15879--15882.","journal-title":"Internet Mathematics"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.95.042317"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphys3865"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.3.041022"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms7868"},{"volume-title":"Proceedings of WWW. 461--470","author":"Dourisboure Y.","key":"e_1_3_2_2_17_1","unstructured":"Y. Dourisboure, F. Geraci, and M. Pellegrini. 2007. Extraction and classification of dense communities in the web. In Proceedings of WWW. 461--470."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspb.2014.2350"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1089\/brain.2011.0008"},{"volume-title":"Proceedings of CIKM. 1807--1816","author":"Galimberti E.","key":"e_1_3_2_2_20_1","unstructured":"E. Galimberti, F. Bonchi, and F. Gullo. 2017. Core decomposition and densest subgraph in multilayer networks. In Proceedings of CIKM. 1807--1816."},{"volume-title":"Proceedings of VLDB. 721--732","author":"Gibson D.","key":"e_1_3_2_2_21_1","unstructured":"D. Gibson, R. Kumar, and A. Tomkins. 2005. Discovering large dense subgraphs in massive graphs. In Proceedings of VLDB. 721--732."},{"volume-title":"Proceedings of KDD. 2313--2314","author":"Gionis A.","key":"e_1_3_2_2_22_1","unstructured":"A. Gionis and C. E. Tsourakakis. 2015. Dense subgraph discovery: KDD 2015 Tutorial. In Proceedings of KDD. 2313--2314."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512205"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-017-0525-y"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsos.160863"},{"volume-title":"Proceedings of ECML PKDD. 641--654","author":"Jethava V.","key":"e_1_3_2_2_27_1","unstructured":"V. Jethava and N. Beerenwinkel. 2015. Finding dense subgraphs in relational graphs. In Proceedings of ECML PKDD. 641--654."},{"volume-title":"Proceedings of IJCAI. 1272--1279","author":"Kawase Y.","key":"e_1_3_2_2_28_1","unstructured":"Y. Kawase, Y. Kuroki, and A. Miyauchi. 2019. Graph mining meets crowdsourcing: Extracting experts for answer aggregation. In Proceedings of IJCAI. 1272--1279."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/3288645.3288671"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu016"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1032"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"V. E. Lee N. Ruan R. Jin and C. Aggarwal. 2010. A survey of algorithms for dense subgraph discovery. 303--336.","DOI":"10.1007\/978-1-4419-6045-0_10"},{"volume-title":"Proceedings of KDD. 177--187","author":"Leskovec J.","key":"e_1_3_2_2_33_1","unstructured":"J. Leskovec, J. Kleinberg, and C. Faloutsos. 2005. Graphs over time: Densification laws, shrinking diameters and possible explanations. In Proceedings of KDD. 177--187."},{"volume-title":"Proceedings of CIKM. 547--556","author":"Miyauchi A.","key":"e_1_3_2_2_34_1","unstructured":"A. Miyauchi and N. Kakimura. 2018. Finding a dense subgraph with sparse cut. In Proceedings of CIKM. 547--556."},{"volume-title":"Proceedings of ICDM. 1188--1193","author":"Miyauchi A.","key":"e_1_3_2_2_35_1","unstructured":"A. Miyauchi and A. Takeda. 2018. Robust densest subgraph discovery. In Proceedings of ICDM. 1188--1193."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2015.00059"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2015.2425961"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-018-0602-x"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-017-0528-8"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"volume-title":"Proceedings of ECML PKDD. 378--394","author":"Tsourakakis C. E.","key":"e_1_3_2_2_41_1","unstructured":"C. E. Tsourakakis, T. Chen, N. Kakimura, and J. Pachocki. 2019. Novel dense subgraph discovery primitives: Risk aversion and exclusion queries. In Proceedings of ECML PKDD. 378--394."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39415-8"},{"volume-title":"Proceedings of KDD. 1604--1614","author":"Veldt N.","key":"e_1_3_2_2_43_1","unstructured":"N. Veldt, A. R. Benson, and J. Kleinberg. 2021. The generalized mean densest subgraph problem. In Proceedings of KDD. 1604--1614."},{"key":"e_1_3_2_2_44_1","volume-title":"Proceedings of MLG. No","author":"Zou Z.","year":"2013","unstructured":"Z. Zou. 2013. Polynomial-time algorithm for finding densest subgraphs in uncertain graphs. In Proceedings of MLG. No page numbers."}],"event":{"name":"WSDM '23: The Sixteenth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Singapore Singapore","acronym":"WSDM '23"},"container-title":["Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539597.3570444","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3539597.3570444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:14Z","timestamp":1750186934000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539597.3570444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,27]]},"references-count":43,"alternative-id":["10.1145\/3539597.3570444","10.1145\/3539597"],"URL":"https:\/\/doi.org\/10.1145\/3539597.3570444","relation":{},"subject":[],"published":{"date-parts":[[2023,2,27]]},"assertion":[{"value":"2023-02-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}