{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:44Z","timestamp":1750220744517,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T00:00:00Z","timestamp":1594080000000},"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":[[2020,7,7]]},"DOI":"10.1145\/3400903.3400925","type":"proceedings-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T21:20:29Z","timestamp":1596144029000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Cohesive Subgraph Detection in Large Bipartite Networks"],"prefix":"10.1145","author":[{"given":"Yang","family":"Hao","sequence":"first","affiliation":[{"name":"Zhejiang Gongshang University"}]},{"given":"Mengqi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Zhejiang Gongshang University"}]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[{"name":"Zhejiang Gongshang University, China"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang Gongshang University"}]}],"member":"320","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Aistis Atminas Vadim\u00a0V. Lozin and Igor Razgon. 2012. Linear time algorithm for computing a small biclique in graphs without long induced paths. In SWAT.  Aistis Atminas Vadim\u00a0V. Lozin and Igor Razgon. 2012. Linear time algorithm for computing a small biclique in graphs without long induced paths. In SWAT.","DOI":"10.1007\/978-3-642-31155-0_13"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Danhao Ding Hui Li Zhipeng Huang and Nikos Mamoulis. 2017. Efficient Fault-Tolerant Group Recommendation Using alpha-beta-core. In CIKM.  Danhao Ding Hui Li Zhipeng Huang and Nikos Mamoulis. 2017. Efficient Fault-Tolerant Group Recommendation Using alpha-beta-core. In CIKM.","DOI":"10.1145\/3132847.3133130"},{"key":"e_1_3_2_1_3_1","volume-title":"A survey of community search over big graphs. VLDB Journal","author":"Fang Yixiang","year":"2020","unstructured":"Yixiang Fang , Xin Huang , Lu Qin , Ying Zhang , Wenjie Zhang , Reynold Cheng , and Xuemin Lin . 2020. A survey of community search over big graphs. VLDB Journal ( 2020 ). Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, and Xuemin Lin. 2020. A survey of community search over big graphs. VLDB Journal (2020)."},{"key":"e_1_3_2_1_4_1","volume-title":"Efficient Algorithms for Densest Subgraph Discovery. PVLDB","author":"Fang Yixiang","year":"2019","unstructured":"Yixiang Fang , Kaiqiang Yu , Reynold Cheng , Laks V.\u00a0S. Lakshmanan , and Xuemin Lin . 2019. Efficient Algorithms for Densest Subgraph Discovery. PVLDB ( 2019 ). Yixiang Fang, Kaiqiang Yu, Reynold Cheng, Laks V.\u00a0S. Lakshmanan, and Xuemin Lin. 2019. Efficient Algorithms for Densest Subgraph Discovery. PVLDB (2019)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Boge Liu Long Yuan Xuemin Lin Lu Qin Wenjie Zhang and Jingren Zhou. 2019. Efficient (\u03b1 \u03b2)-core Computation: an Index-based Approach. In WWW.  Boge Liu Long Yuan Xuemin Lin Lu Qin Wenjie Zhang and Jingren Zhou. 2019. Efficient (\u03b1 \u03b2)-core Computation: an Index-based Approach. In WWW.","DOI":"10.1145\/3308558.3313522"},{"key":"e_1_3_2_1_6_1","unstructured":"Eirini Ntoutsi Kostas Stefanidis Katharina Rausch and Hans-Peter Kriegel. 2011. Strength Lies in Differences: Diversifying Friends for Recommendations through Subspace Clustering. In ICDM.  Eirini Ntoutsi Kostas Stefanidis Katharina Rausch and Hans-Peter Kriegel. 2011. Strength Lies in Differences: Diversifying Friends for Recommendations through Subspace Clustering. In ICDM."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Ahmet\u00a0Erdem Sariyuce and Ali Pinar. 2018. Peeling Bipartite Networks for Dense Subgraph Discovery. In WSDM.  Ahmet\u00a0Erdem Sariyuce and Ali Pinar. 2018. Peeling Bipartite Networks for Dense Subgraph Discovery. In WSDM.","DOI":"10.1145\/3159652.3159678"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Quan Yuan Gao Cong and Chin-Yew Lin. 2014. COM: a generative model for group recommendation. In KDD.  Quan Yuan Gao Cong and Chin-Yew Lin. 2014. COM: a generative model for group recommendation. In KDD.","DOI":"10.1145\/2623330.2623616"},{"key":"e_1_3_2_1_9_1","unstructured":"Zhaonian Zou. 2016. Bitruss Decomposition of Bipartite Graphs. In DASFAA.  Zhaonian Zou. 2016. Bitruss Decomposition of Bipartite Graphs. In DASFAA."}],"event":{"name":"SSDBM 2020: 32nd International Conference on Scientific and Statistical Database Management","acronym":"SSDBM 2020","location":"Vienna Austria"},"container-title":["32nd International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400903.3400925","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3400903.3400925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:43Z","timestamp":1750199923000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400903.3400925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,7]]},"references-count":9,"alternative-id":["10.1145\/3400903.3400925","10.1145\/3400903"],"URL":"https:\/\/doi.org\/10.1145\/3400903.3400925","relation":{},"subject":[],"published":{"date-parts":[[2020,7,7]]},"assertion":[{"value":"2020-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}