{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:53:55Z","timestamp":1756572835454,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T00:00:00Z","timestamp":1615161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Department of Energy"},{"name":"National Science Foundation","award":["CCF-1919021"],"award-info":[{"award-number":["CCF-1919021"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,3,8]]},"DOI":"10.1145\/3437963.3441790","type":"proceedings-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T04:34:28Z","timestamp":1615005268000},"page":"689-697","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["A Unifying Framework to Identify Dense Subgraphs on Streams: Graph Nuclei to Hypergraph Cores"],"prefix":"10.1145","author":[{"given":"Kasimir","family":"Gabert","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]},{"given":"Ali","family":"Pinar","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Livermore, CA, USA"}]},{"given":"\u00dcmit V.","family":"\u00c7ataly\u00fcrek","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,3,8]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2002. Google Programming Contest.  2002. Google Programming Contest."},{"volume-title":"Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 32--42","author":"Alpern Bowen","key":"e_1_3_2_2_2_1","unstructured":"Bowen Alpern , Roger Hoover , Barry K. Rosen , Peter F. Sweeney , and F. Kenneth Zadeck . 1990. Incremental Evaluation of Computational Circuits . In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 32--42 . Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, and F. Kenneth Zadeck. 1990. Incremental Evaluation of Computational Circuits. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 32--42."},{"key":"e_1_3_2_2_3_1","unstructured":"J Ignacio Alvarez-Hamelin Luca Dall'Asta Alain Barrat and Alessandro Vespignani. 2006. Large scale networks fingerprinting and visualization using the k-core decomposition. In Advances in Neural Information Processing Systems. 41--50.  J Ignacio Alvarez-Hamelin Luca Dall'Asta Alain Barrat and Alessandro Vespignani. 2006. Large scale networks fingerprinting and visualization using the k-core decomposition. In Advances in Neural Information Processing Systems. 41--50."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168658"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526808"},{"key":"e_1_3_2_2_6_1","volume-title":"International Conference on Learning and Intelligent Optimization. Springer, 41--55","author":"Brunato Mauro","year":"2007","unstructured":"Mauro Brunato , Holger H Hoos , and Roberto Battiti . 2007 . On effectively finding maximal quasi-cliques in graphs . In International Conference on Learning and Intelligent Optimization. Springer, 41--55 . Mauro Brunato, Holger H Hoos, and Roberto Battiti. 2007. On effectively finding maximal quasi-cliques in graphs. In International Conference on Learning and Intelligent Optimization. Springer, 41--55."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020579"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463722"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00540-5"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242635"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.062819"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035944"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0482-5"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083676"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0507655102"},{"key":"e_1_3_2_2_18_1","volume-title":"28th USENIX Security Symposium (USENIX Security 19)","author":"Ho Grant","year":"2019","unstructured":"Grant Ho , Asaf Cidon , Lior Gavish , Marco Schweighauser , Vern Paxson , Stefan Savage , Geoffrey M Voelker , and David Wagner . 2019 . Detecting and characterizing lateral phishing at scale . In 28th USENIX Security Symposium (USENIX Security 19) . 1273--1290. Grant Ho, Asaf Cidon, Lior Gavish, Marco Schweighauser, Vern Paxson, Stefan Savage, Geoffrey M Voelker, and David Wagner. 2019. Detecting and characterizing lateral phishing at scale. In 28th USENIX Security Symposium (USENIX Security 19). 1273--1290."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2960226"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2017.151"},{"volume-title":"Complexity of computer computations","author":"Karp Richard M","key":"e_1_3_2_2_23_1","unstructured":"Richard M Karp . 1972. Reducibility among combinatorial problems . In Complexity of computer computations . Springer , 85--103. Richard M Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. Springer, 85--103."},{"key":"e_1_3_2_2_24_1","volume-title":"Trawling the Web for emerging cyber-communities. Computer networks","author":"Kumar Ravi","year":"1999","unstructured":"Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , and Andrew Tomkins . 1999. Trawling the Web for emerging cyber-communities. Computer networks , Vol. 31 , 11--16 ( 1999 ), 1481--1493. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. 1999. Trawling the Web for emerging cyber-communities. Computer networks, Vol. 31, 11--16 (1999), 1481--1493."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/646491.694954"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313522"},{"key":"e_1_3_2_2_29_1","volume-title":"The H-index of a network node and its relation to degree and coreness. Nature communications","author":"L\u00fc Linyuan","year":"2016","unstructured":"Linyuan L\u00fc , Tao Zhou , Qian-Ming Zhang , and H Eugene Stanley . 2016. The H-index of a network node and its relation to degree and coreness. Nature communications , Vol. 7 ( 2016 ), 10168. Linyuan L\u00fc, Tao Zhou, Qian-Ming Zhang, and H Eugene Stanley. 2016. The H-index of a network node and its relation to degree and coreness. Nature communications, Vol. 7 (2016), 10168."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00079-8"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0423-8"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021927"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159678"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_2_37_1","volume-title":"Network structure and minimum degree. Social networks","author":"Seidman Stephen B","year":"1983","unstructured":"Stephen B Seidman . 1983. Network structure and minimum degree. Social networks , Vol. 5 , 3 ( 1983 ), 269--287. Stephen B Seidman. 1983. Network structure and minimum degree. Social networks, Vol. 5, 3 (1983), 269--287."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593665"},{"key":"e_1_3_2_2_39_1","volume-title":"T-H Hubert Chan, and Mauro Sozio","author":"Sun Bintao","year":"2020","unstructured":"Bintao Sun , T-H Hubert Chan, and Mauro Sozio . 2020 . Fully Dynamic Approximate k-Core Decomposition in Hypergraphs. ACM Transactions on Knowledge Discovery from Data (TKDD) , Vol. 14 , 4 (2020), 1--21. Bintao Sun, T-H Hubert Chan, and Mauro Sozio. 2020. Fully Dynamic Approximate k-Core Decomposition in Hypergraphs. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 14, 4 (2020), 1--21."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00023"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300082"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.93"}],"event":{"name":"WSDM '21: The Fourteenth 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":"Virtual Event Israel","acronym":"WSDM '21"},"container-title":["Proceedings of the 14th ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441790","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441790","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:36Z","timestamp":1750193256000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,8]]},"references-count":42,"alternative-id":["10.1145\/3437963.3441790","10.1145\/3437963"],"URL":"https:\/\/doi.org\/10.1145\/3437963.3441790","relation":{},"subject":[],"published":{"date-parts":[[2021,3,8]]},"assertion":[{"value":"2021-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}