{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:43:42Z","timestamp":1768110222217,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201906030067"],"award-info":[{"award-number":["201906030067"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,6]]},"DOI":"10.1145\/3625007.3627316","type":"proceedings-article","created":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T15:12:42Z","timestamp":1710515562000},"page":"271-275","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient size-prescribed k-core search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0868-6946","authenticated-orcid":false,"given":"Yiping","family":"Liu","sequence":"first","affiliation":[{"name":"University of Auckland, Auckland, New Zealand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4828-7226","authenticated-orcid":false,"given":"Bo","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology,Beijing  Institute of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0899-7516","authenticated-orcid":false,"given":"Bo","family":"Zhao","sequence":"additional","affiliation":[{"name":"Beijing Institute Of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8376-393X","authenticated-orcid":false,"given":"Hongyi","family":"Su","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology,Beijing Institute of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1148-3920","authenticated-orcid":false,"given":"Yang","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Auckland, Auckland, New Zealand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7554-0971","authenticated-orcid":false,"given":"Michael","family":"Witbrock","sequence":"additional","affiliation":[{"name":"University of Auckland, Auckland, New Zealand"}]}],"member":"320","published-online":{"date-parts":[[2024,3,15]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"2005","article-title":"Large scale networks fingerprinting and visualization using the k-core decomposition","volume":"18","author":"Alvarez-Hamelin J. I.","year":"2005","unstructured":"J. I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, and A. Vespignani. 2005. Large scale networks fingerprinting and visualization using the k-core decomposition. In Advances in Neural Information Processing Systems 18, 2005.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.05.001"},{"key":"e_1_3_2_1_3_1","volume-title":"Efficient and effective community search. Data mining and knowledge discovery 29","author":"Barbieri Nicola","year":"2015","unstructured":"Nicola Barbieri, Francesco Bonchi, Edoardo Galimberti, and Francesco Gullo. 2015. Efficient and effective community search. Data mining and knowledge discovery 29 (2015), 1406--1433."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the VLDB Endowment","author":"Li Conggai","year":"2020","unstructured":"Conggai Li, Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, and Xuemin Lin. 2020. Efficient progressive minimum k-core search. Proceedings of the VLDB Endowment (2020)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-019-1905-0"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_1_8_1","unstructured":"Aua Md. H. Mori S. Kanaya K. Nishikata T. Korna T. Miyasato Y. Shinbo A. Md. C. Wada and M. Maeda. 2011. Prediction of Protein Functions Based on K-Cores of Protein-Protein Interaction Networks and Amino Acid Sequences. Genome Informatics 14 (2011)"},{"key":"e_1_3_2_1_9_1","volume-title":"Complex network measures of brain connectivity: uses and interpretations. NEUROIMAGE 3","author":"Rubinov Mikail","year":"2010","unstructured":"Mikail Rubinov and Olaf Sporns. 2010. Complex network measures of brain connectivity: uses and interpretations. NEUROIMAGE 3 (2010)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Mauro Sozio and Aristides Gionis. 2010. The community-search problem and how to plan a successful cocktail party. KDD 939--948.","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_1_11_1","unstructured":"Douglas Brent West et al. 2001. Introduction to graph theory. Vol. 2. Prentice hall Upper Saddle River."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/pmic.200400962"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"K. Yao and L. Chang. 2021. Efficient size-bounded community search over large networks. In Very Large Data Bases.","DOI":"10.14778\/3457390.3457407"},{"key":"e_1_3_2_1_14_1","volume-title":"An o (m) algorithm for cores decomposition of networks[J]. arXiv preprint cs\/0310049","author":"Batagelj","year":"2003","unstructured":"Batagelj V, Zaversnik M. An o (m) algorithm for cores decomposition of networks[J]. arXiv preprint cs\/0310049, 2003."},{"key":"e_1_3_2_1_15_1","volume-title":"Journal of Marketing","author":"Luo","year":"2014","unstructured":"Luo X, Andrews M, Song Y, et al. Group-buying deal popularity[J]. Journal of Marketing, 2014, 78(2): 20--33."},{"key":"e_1_3_2_1_16_1","first-page":"84","article-title":"16th IEEE International Conference on Mobile Data Management","volume":"2015","author":"Boutsis","year":"2015","unstructured":"Boutsis I, Karanikolaou S, Kalogeraki V. Personalized event recommendations using social networks[C]\/\/2015 16th IEEE International Conference on Mobile Data Management. IEEE, 2015, 1: 84--93.","journal-title":"IEEE"},{"key":"e_1_3_2_1_17_1","volume-title":"Theoretical Computer Science","author":"Downey R G","year":"1995","unstructured":"Downey R G, Fellows M R. Fixed-parameter tractability and completeness II: On completeness for W [1][J]. Theoretical Computer Science, 1995, 141(1--2): 109--131."},{"key":"e_1_3_2_1_18_1","volume-title":"Clique is hard to approximate within n\/sup 1-\/spl epsiv[C]\/\/Proceedings of 37th Conference on Foundations of Computer Science","author":"Hastad","year":"1996","unstructured":"Hastad J. Clique is hard to approximate within n\/sup 1-\/spl epsiv[C]\/\/Proceedings of 37th Conference on Foundations of Computer Science. IEEE, 1996: 627--636."}],"event":{"name":"ASONAM '23: International Conference on Advances in Social Networks Analysis and Mining","location":"Kusadasi Turkiye","acronym":"ASONAM '23","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"]},"container-title":["Proceedings of the International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3625007.3627316","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3625007.3627316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:48Z","timestamp":1750178808000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3625007.3627316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"references-count":18,"alternative-id":["10.1145\/3625007.3627316","10.1145\/3625007"],"URL":"https:\/\/doi.org\/10.1145\/3625007.3627316","relation":{},"subject":[],"published":{"date-parts":[[2023,11,6]]},"assertion":[{"value":"2024-03-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}