{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T22:40:30Z","timestamp":1760740830681,"version":"build-2065373602"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819534616"},{"type":"electronic","value":"9789819534623"}],"license":[{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-3462-3_13","type":"book-chapter","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T17:18:40Z","timestamp":1760635120000},"page":"177-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Size-Constrained Community Search over\u00a0Directed Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3280-7794","authenticated-orcid":false,"given":"Chenxi","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2077-8269","authenticated-orcid":false,"given":"Junchang","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengna","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoqi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0095-0378","authenticated-orcid":false,"given":"Zhiqiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"issue":"11","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.14778\/3137628.3137640","volume":"10","author":"E Akbas","year":"2017","unstructured":"Akbas, E., Zhao, P.: Truss-based community search: a truss-equivalence based indexing approach. Proc. VLDB Endow. 10(11), 1298\u20131309 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1007\/s10618-015-0422-1","volume":"29","author":"N Barbieri","year":"2015","unstructured":"Barbieri, N., Bonchi, F., Galimberti, E., Gullo, F.: Efficient and effective community search. Data Min. Knowl. Disc. 29(5), 1406\u20131433 (2015). https:\/\/doi.org\/10.1007\/s10618-015-0422-1","journal-title":"Data Min. Knowl. Disc."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.dam.2020.05.027","volume":"303","author":"A Conte","year":"2021","unstructured":"Conte, A., Kant\u00e9, M.M., Uno, T., Wasa, K.: Maximal strongly connected cliques in directed graphs: algorithms and bounds. Discret. Appl. Math. 303, 237\u2013252 (2021)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang, Y., et al.: A survey of community search over big graphs. VLDB J. 29(1), 353\u2013392 (2020)","journal-title":"VLDB J."},{"issue":"11","key":"13_CR5","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1109\/TKDE.2018.2872982","volume":"31","author":"Y Fang","year":"2019","unstructured":"Fang, Y., Wang, Z., Cheng, R., Wang, H., Hu, J.: Effective and efficient community search over large directed graphs. IEEE Trans. Knowl. Data Eng. 31(11), 2093\u20132107 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10115-012-0539-0","volume":"35","author":"C Giatsidis","year":"2013","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: D-cores: measuring collaboration of directed graphs based on degeneracy. Knowl. Inf. Syst. 35(2), 311\u2013343 (2013)","journal-title":"Knowl. Inf. Syst."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Jiang, M., Cui, P., Beutel, A., Faloutsos, C., Yang, S.: Catchsync: catching synchronized behavior in large directed graphs. In: KDD, pp. 941\u2013950. ACM (2014)","DOI":"10.1145\/2623330.2623632"},{"issue":"8","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1816","DOI":"10.14778\/3659437.3659440","volume":"17","author":"X Liao","year":"2024","unstructured":"Liao, X., Liu, Q., Huang, X., Xu, J.: Truss-based community search over streaming directed graphs. Proc. VLDB Endow. 17(8), 1816\u20131829 (2024)","journal-title":"Proc. VLDB Endow."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Liu, B., Zhang, F., Zhang, W., Lin, X., Zhang, Y.: Efficient community search with size constraint. In: ICDE, pp. 97\u2013108. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00016"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhao, M., Huang, X., Xu, J., Gao, Y.: Truss-based community search over large directed graphs. In: SIGMOD Conference, pp. 2183\u20132197. ACM (2020)","DOI":"10.1145\/3318464.3380587"},{"issue":"11","key":"13_CR11","doi-asserted-by":"publisher","DOI":"10.1098\/rsos.160270","volume":"3","author":"T Takaguchi","year":"2016","unstructured":"Takaguchi, T., Yoshida, Y.: Cycle and flow trusses in directed networks. Royal Society Open Sci. 3(11), 160270 (2016)","journal-title":"Royal Society Open Sci."},{"issue":"9","key":"13_CR12","doi-asserted-by":"publisher","first-page":"2199","DOI":"10.14778\/3598581.3598592","volume":"16","author":"A Tian","year":"2023","unstructured":"Tian, A., Zhou, A., Wang, Y., Chen, L.: Maximal d-truss search in dynamic directed graphs. Proc. VLDB Endow. 16(9), 2199\u20132211 (2023)","journal-title":"Proc. VLDB Endow."},{"issue":"8","key":"13_CR13","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.14778\/3457390.3457407","volume":"14","author":"K Yao","year":"2021","unstructured":"Yao, K., Chang, L.: Efficient size-bounded community search over large networks. Proc. VLDB Endow. 14(8), 1441\u20131453 (2021)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1109\/TKDE.2023.3280483","volume":"36","author":"F Zhang","year":"2024","unstructured":"Zhang, F., Guo, H., Ouyang, D., Yang, S., Lin, X., Tian, Z.: Size-constrained community search on large networks: an effective and efficient solution. IEEE Trans. Knowl. Data Eng. 36(1), 356\u2013371 (2024)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"13_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119511","volume":"647","author":"K Zhou","year":"2023","unstructured":"Zhou, K., Xin, J., Chen, J., Zhang, X., Wang, B., Wang, Z.: Effective and efficient community search with size constraint on bipartite graphs. Inf. Sci. 647, 119511 (2023)","journal-title":"Inf. Sci."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Zong, C., Gong, P., Zhang, X., Qiu, T., Zhang, A., Wang, M.: Efficient size-constrained (k, d)-truss community search. In: ADMA (5). LNCS, vol. 14180, pp. 405\u2013420. Springer (2023)","DOI":"10.1007\/978-3-031-46677-9_28"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-3462-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T22:03:33Z","timestamp":1760738613000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3462-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"ISBN":["9789819534616","9789819534623"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3462-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"17 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2025.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}