{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:08:31Z","timestamp":1775912911634,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T00:00:00Z","timestamp":1741564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3,10]]},"DOI":"10.1145\/3701551.3703502","type":"proceedings-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T12:33:36Z","timestamp":1740573216000},"page":"194-203","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4781-9761","authenticated-orcid":false,"given":"Tianyi","family":"Chen","sequence":"first","affiliation":[{"name":"Celonis, New York, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6033-6433","authenticated-orcid":false,"given":"Atsushi","family":"Miyauchi","sequence":"additional","affiliation":[{"name":"CENTAI Institute, Turin, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5591-3585","authenticated-orcid":false,"given":"Charalampos E.","family":"Tsourakakis","sequence":"additional","affiliation":[{"name":"RelationalAI, Boston, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,3,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Jon Kleinberg, Zhibin Liang, David Parkes, Mauro Sozio, and Charalampos E. Tsourakakis.","author":"Abebe Rediet","year":"2021","unstructured":"Rediet Abebe, T-H Hubert Chan, Jon Kleinberg, Zhibin Liang, David Parkes, Mauro Sozio, and Charalampos E. Tsourakakis. 2021. Opinion dynamics optimization by varying susceptibility to persuasion via non-convex local search. ACM Transactions on Knowledge Discovery from Data, Vol. 16, 2 (2021), 1--34."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412036"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187907"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2685298"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_1_9_1","volume-title":"STOC '15","author":"Bhattacharya Sayan","unstructured":"Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Charalampos E. Tsourakakis. 2015. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In STOC '15. 173--182."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380140"},{"key":"e_1_3_2_1_11_1","volume-title":"Convex Optimization","author":"Boyd Stephen","unstructured":"Stephen Boyd and Lieven Vandenberghe. 2004. Convex Optimization. Cambridge University Press."},{"key":"e_1_3_2_1_12_1","volume-title":"NeurIPS '20","author":"Brown Tom B.","year":"2020","unstructured":"Tom B. Brown, Benjamin Mann, Nick Ryder, et al. 2020. Language models are few-shot learners. In NeurIPS '20. 1877--1901."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_2_1_14_1","volume-title":"SODA '22","author":"Chekuri Chandra","unstructured":"Chandra Chekuri, Kent Quanrud, and Manuel R. Torres. 2022. Densest subgraph: Supermodularity, iterative peeling, and flow. In SODA '22. 1531--1555."},{"key":"e_1_3_2_1_15_1","volume-title":"ECML PKDD '22","author":"Chen Tianyi","unstructured":"Tianyi Chen, Brian Matejek, Michael Mitzenmacher, and Charalampos E. Tsourakakis. 2022a. Algorithmic tools for understanding the motif structure of networks. In ECML PKDD '22. 3--19."},{"key":"e_1_3_2_1_16_1","volume-title":"Tsourakakis","author":"Chen Tianyi","year":"2024","unstructured":"Tianyi Chen, Atsushi Miyauchi, and Charalampos E. Tsourakakis. 2024. Q-DISCO: Query-centric densest subgraphs in networks with opinion information. arXiv preprint arXiv:2412.11647 (2024)."},{"key":"e_1_3_2_1_17_1","volume-title":"SocInfo '22","author":"Chen Tianyi","unstructured":"Tianyi Chen, Xu Wang, and Charalampos E. Tsourakakis. 2022b. Polarizing opinion dynamics with confirmation bias. In SocInfo '22. 144--158."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1217220110"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052619"},{"key":"e_1_3_2_1_20_1","volume-title":"NAACL-HLT '19","author":"Devlin Jacob","year":"2019","unstructured":"Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of deep bidirectional transformers for language understanding. In NAACL-HLT '19. 4171--4186."},{"key":"e_1_3_2_1_21_1","volume-title":"Woodruff","author":"Esfandiari Hossein","year":"2015","unstructured":"Hossein Esfandiari, MohammadTaghi Hajiaghayi, and David P. Woodruff. 2015. Applications of uniform sampling: Densest subgraph and beyond. arXiv preprint arXiv:1506.04505 (2015)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565843"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399490"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132993"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.43"},{"key":"e_1_3_2_1_27_1","volume-title":"KDD '15","author":"Gionis Aristides","unstructured":"Aristides Gionis and Charalampos E. Tsourakakis. 2015. Dense subgraph discovery: KDD 2015 Tutorial. In KDD '15. 2313--2314."},{"key":"e_1_3_2_1_28_1","unstructured":"Andrew V. Goldberg. 1984. Finding a maximum density subgraph. Technical Report. University of California Berkeley."},{"key":"e_1_3_2_1_29_1","volume-title":"EDTC '95","author":"Dennis","unstructured":"Dennis J.-H. Huang and Andrew B. Kahng. 1995. When clusters meet partitions: New density-based methods for circuit decomposition. In EDTC '95. 60--64."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645624"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23525-7_39"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.bushor.2009.09.003"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570444"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_3_2_1_35_1","volume-title":"Recommender Systems Handbook,","author":"Koren Yehuda","unstructured":"Yehuda Koren, Steffen Rendle, and Robert Bell. 2022. Advances in collaborative filtering. In Recommender Systems Handbook,, Francesco Ricci, Lior Rokach, and Bracha Shapira (Eds.). Springer US, 91--142."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703435753"},{"key":"e_1_3_2_1_37_1","volume-title":"ICML '20","author":"Kuroki Yuko","year":"2020","unstructured":"Yuko Kuroki, Atsushi Miyauchi, Junya Honda, and Masashi Sugiyama. 2020. Online dense subgraph discovery via blurred-graph feedback. In ICML '20. 5522--5532."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3653298"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_3_2_1_41_1","volume-title":"Managing and Mining Graph Data,, Charu C","author":"Lee Victor E.","unstructured":"Victor E. Lee, Ning Ruan, Ruoming Jin, and Charu Aggarwal. 2010. A survey of algorithms for dense subgraph discovery. In Managing and Mining Graph Data,, Charu C. Aggarwal and Haixun Wang (Eds.). Springer US, 303--336."},{"key":"e_1_3_2_1_42_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389697"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055412"},{"key":"e_1_3_2_1_45_1","volume-title":"MFCS '15","author":"McGregor Andrew","unstructured":"Andrew McGregor, David Tench, Sofya Vorotnikova, and Hoa T. Vu. 2015. Densest subgraph in dynamic graph streams. In MFCS '15. 472--482."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0003055423001041"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"key":"e_1_3_2_1_48_1","volume-title":"KDD '23","author":"Miyauchi Atsushi","unstructured":"Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, and Charalampos E. Tsourakakis. 2023. Densest diverse subgraphs: How to plan a successful cocktail party with diversity. In KDD '23. 1710--1721."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271720"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00157"},{"key":"e_1_3_2_1_51_1","volume-title":"TheWebConf '18","author":"Musco Cameron","unstructured":"Cameron Musco, Christopher Musco, and Charalampos E. Tsourakakis. 2018. Minimizing polarization and disagreement in social networks. In TheWebConf '18. 369--378."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589335.3651507"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120206"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2017.03.002"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2018.03.005"},{"key":"e_1_3_2_1_56_1","volume-title":"ECML PKDD '24","author":"Ristache Dragos","unstructured":"Dragos Ristache, Fabian Spaeh, and Charalampos E. Tsourakakis. 2024. Wiser than the wisest of crowds: The Asch effect and polarization revisited. In ECML PKDD '24. 440--458."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341161.3342890"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401962"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_1_61_1","volume-title":"ECML PKDD '19","author":"Tsourakakis Charalampos E.","year":"2019","unstructured":"Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, and Jakub Pachocki. 2019. Novel dense subgraph discovery primitives: Risk aversion and exclusion queries. In ECML PKDD '19. 378--394."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467398"}],"event":{"name":"WSDM '25: The Eighteenth ACM International Conference on Web Search and Data Mining","location":"Hannover Germany","acronym":"WSDM '25","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"]},"container-title":["Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3703502","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3701551.3703502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T09:17:35Z","timestamp":1755767855000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3703502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,10]]},"references-count":62,"alternative-id":["10.1145\/3701551.3703502","10.1145\/3701551"],"URL":"https:\/\/doi.org\/10.1145\/3701551.3703502","relation":{},"subject":[],"published":{"date-parts":[[2025,3,10]]},"assertion":[{"value":"2025-03-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}