{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T13:08:05Z","timestamp":1783429685963,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T00:00:00Z","timestamp":1517529600000},"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":[[2018,2,2]]},"DOI":"10.1145\/3159652.3159678","type":"proceedings-article","created":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T18:12:23Z","timestamp":1517940743000},"page":"504-512","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":84,"title":["Peeling Bipartite Networks for Dense Subgraph Discovery"],"prefix":"10.1145","author":[{"given":"Ahmet Erdem","family":"Sar\u0131y\u00fcce","sequence":"first","affiliation":[{"name":"University at Buffalo, Buffalo, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali","family":"Pinar","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Livermore, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,2,2]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"(www.imdb.com\/interfaces)","year":"2016"},{"key":"e_1_3_2_1_2_1","unstructured":"2017. Konect network dataset. (2017). (http:\/\/www.discogs.com\/).  2017. Konect network dataset. (2017). (http:\/\/www.discogs.com\/)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx001"},{"key":"e_1_3_2_1_4_1","volume-title":"Marvel Universe looks almost like a real social network. CoRR abs\/cond-mat\/0202174","author":"Alberich R.","year":"2002"},{"key":"e_1_3_2_1_5_1","volume-title":"CoRR cs.DS\/0202039","author":"Batagelj Vladimir","year":"2002"},{"key":"e_1_3_2_1_6_1","unstructured":"V. Batagelj and M. Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. CoRR cs\/0310049 (2003).  V. Batagelj and M. Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. CoRR cs\/0310049 (2003)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"A. R. Benson D. F. Gleich and J. Leskovec. 2016. Higher-order organization of complex networks. Science 353 6295 (2016) 163--166.  A. R. Benson D. F. Gleich and J. Leskovec. 2016. Higher-order organization of complex networks. Science 353 6295 (2016) 163--166.","DOI":"10.1126\/science.aad9029"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488400"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(96)00301-2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2015.04.001"},{"key":"e_1_3_2_1_12_1","unstructured":"S. Chacon. 2009. The 2009 GitHub Contest. (2009). (github.com\/blog\/466-the-2009-github-contest).  S. Chacon. 2009. The 2009 GitHub Contest. (2009). (github.com\/blog\/466-the-2009-github-contest)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"e_1_3_2_1_14_1","unstructured":"A. Clauset E. Tucker and M. Sainz. 2016. The Colorado Index of Complex Networks. (2016). (icon.colorado.edu).  A. Clauset E. Tucker and M. Sainz. 2016. The Colorado Index of Complex Networks. (2016). (icon.colorado.edu)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2012.05.004"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/bult.1720320206"},{"key":"e_1_3_2_1_19_1","volume-title":"Exploiting Burstiness in Reviews for Review Spammer Detection","author":"Fei G."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.65"},{"key":"e_1_3_2_1_21_1","unstructured":"D. Gibson R. Kumar and A. Tomkins. 2005. Discovering Large Dense Subgraphs in Massive Graphs. In VLDB. 721--732.   D. Gibson R. Kumar and A. Tomkins. 2005. Discovering Large Dense Subgraphs in Massive Graphs. In VLDB. 721--732."},{"key":"e_1_3_2_1_22_1","volume-title":"International Conf. on Communication Systems and Networks (COMSNETS). 1--10","author":"Gregori E."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"R. Kumar P. Raghavan S. Rajagopalan and A. Tomkins. 1999. Trawling the Web for Emerging Cyber-communities. In WWW. 1481--1493.   R. Kumar P. Raghavan S. Rajagopalan and A. Tomkins. 1999. Trawling the Web for Emerging Cyber-communities. In WWW. 1481--1493.","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Jerome Kunegis. 2017. Konect network dataset. (2017). (http:\/\/konect.uni-koblenz.de).  Jerome Kunegis. 2017. Konect network dataset. (2017). (http:\/\/konect.uni-koblenz.de).","DOI":"10.1007\/978-1-4614-7163-9_122-1"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.04.006"},{"key":"e_1_3_2_1_27_1","volume-title":"SNAP Datasets: Stanford Large Network Dataset Collection. (June","author":"Leskovec Jure","year":"2014"},{"key":"e_1_3_2_1_28_1","volume-title":"DBLP computer science bibliography. (Sept","author":"Ley Michael","year":"2016"},{"key":"e_1_3_2_1_29_1","volume-title":"Truss Decomposition for Extracting Communities in Bipartite Graph. In IMMM 2013 : The Third International Conference on Advances in Information Mining and Management.","author":"Li Y."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.Congress.2014.105"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.016131"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.016132"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.98.2.404"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2011.07.001"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:CMOT.0000032580.12184.c0"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2006.76"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021927"},{"key":"e_1_3_2_1_40_1","unstructured":"A. E. Sar\u0131y\u00fcce and A. Pinar. 2017. Peeling Bipartite Networks for Dense Subgraph Discovery. CoRR 1611.02756 (2017). (Extended version).  A. E. Sar\u0131y\u00fcce and A. Pinar. 2017. Peeling Bipartite Networks for Dense Subgraph Discovery. CoRR 1611.02756 (2017). (Extended version)."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.v2:4"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_3_2_1_46_1","volume-title":"DIMACS Workshop. 129--140","author":"Verma A."},{"key":"e_1_3_2_1_47_1","volume-title":"IEEE High Performance Extreme Computing Conference, HPEC.","author":"Wolf M. M."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.35"}],"event":{"name":"WSDM 2018: The Eleventh ACM International Conference on Web Search and Data Mining","location":"Marina Del Rey CA USA","acronym":"WSDM 2018","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 Eleventh ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3159652.3159678","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3159652.3159678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:12Z","timestamp":1750213572000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3159652.3159678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,2]]},"references-count":47,"alternative-id":["10.1145\/3159652.3159678","10.1145\/3159652"],"URL":"https:\/\/doi.org\/10.1145\/3159652.3159678","relation":{},"subject":[],"published":{"date-parts":[[2018,2,2]]},"assertion":[{"value":"2018-02-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}