{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:01:31Z","timestamp":1750309291573,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T00:00:00Z","timestamp":1729468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"South Big Data Innovation Hub","award":["S.E.E.D.S. Small"],"award-info":[{"award-number":["S.E.E.D.S. Small"]}]},{"name":"NSF","award":["2229394,2414474,2414185"],"award-info":[{"award-number":["2229394,2414474,2414185"]}]},{"name":"DOE","award":["ECRP 0000278892"],"award-info":[{"award-number":["ECRP 0000278892"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,10,21]]},"DOI":"10.1145\/3627673.3679207","type":"proceedings-article","created":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T19:34:21Z","timestamp":1729452861000},"page":"5225-5229","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["DirDense: A Tool for Mining Dense Subgraphs from a Big Directed Graph"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9853-2352","authenticated-orcid":false,"given":"Jalal","family":"Khalil","sequence":"first","affiliation":[{"name":"St. Cloud State University, St. Cloud, Minnesota, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6988-5335","authenticated-orcid":false,"given":"Ahmad","family":"Akhlaque","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4653-0408","authenticated-orcid":false,"given":"Da","family":"Yan","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4374-8161","authenticated-orcid":false,"given":"Lyuheng","family":"Yuan","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7846-2200","authenticated-orcid":false,"given":"Saugat","family":"Adhikari","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7839-4933","authenticated-orcid":false,"given":"Yang","family":"Zhou","sequence":"additional","affiliation":[{"name":"Auburn University, Auburn, Alabama, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3576-6976","authenticated-orcid":false,"given":"Zhe","family":"Jiang","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, Florida, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Maximal Directed Quasi-Clique Mining","author":"Guo Guimu","year":"1900","unstructured":"Guimu Guo, Da Yan, Lyuheng Yuan, Jalal Khalil, Cheng Long, Zhe Jiang, and Yang Zhou. 2022. Maximal Directed Quasi-Clique Mining. In ICDE. IEEE, 1900--1913."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00712-2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87481-2_3"},{"key":"e_1_3_2_1_4_1","volume-title":"Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs. In SIGMOD Conference. ACM, 1051--1066","author":"Ma Chenhao","year":"2020","unstructured":"Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks V. S. Lakshmanan, Wenjie Zhang, and Xuemin Lin. 2020. Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs. In SIGMOD Conference. ACM, 1051--1066."},{"volume-title":"Enumerating Top-k Quasi-Cliques","author":"Sanei-Mehri Seyed-Vahid","key":"e_1_3_2_1_5_1","unstructured":"Seyed-Vahid Sanei-Mehri, Apurba Das, and Srikanta Tirthapura. 2018. Enumerating Top-k Quasi-Cliques. In IEEE BigData. IEEE, 1107--1112."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Zhengren Wang Yi Zhou Mingyu Xiao and Bakhadyr Khoussainov. 2022. Listing Maximal k-Plexes in Large Real-World Graphs. In WWW. ACM 1517--1527.","DOI":"10.1145\/3485447.3512198"},{"key":"e_1_3_2_1_7_1","unstructured":"Da Yan Akhlaque Ahmad Jiao Han Jalal Khalil Lyuheng Yuan and Saugat Adhikari. 2024. Technical Report on $(k_1 k_2)$-Plex. https:\/\/homes.luddy.indiana.edu\/yanda\/papers\/k1k2plex.pdf."},{"key":"e_1_3_2_1_8_1","volume-title":"M. Tamer \u00d6zsu, John C. S. Lui, and Weida Tan.","author":"Yan Da","year":"2019","unstructured":"Da Yan, Guimu Guo, Md Mashiur Rahman Chowdhury, M. Tamer \u00d6zsu, John C. S. Lui, and Weida Tan. 2019. T-thinker: a task-centric distributed framework for compute-intensive divide-and-conquer algorithms. In PPoPP. ACM, 411--412."},{"volume-title":"Enumerating Maximal k-Plexes with Worst-Case Time Guarantee","author":"Zhou Yi","key":"e_1_3_2_1_9_1","unstructured":"Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, and Yan Jin. 2020. Enumerating Maximal k-Plexes with Worst-Case Time Guarantee. In AAAI. AAAI Press, 2442--2449."}],"event":{"name":"CIKM '24: The 33rd ACM International Conference on Information and Knowledge Management","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Boise ID USA","acronym":"CIKM '24"},"container-title":["Proceedings of the 33rd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627673.3679207","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627673.3679207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:28Z","timestamp":1750291408000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627673.3679207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,21]]},"references-count":9,"alternative-id":["10.1145\/3627673.3679207","10.1145\/3627673"],"URL":"https:\/\/doi.org\/10.1145\/3627673.3679207","relation":{},"subject":[],"published":{"date-parts":[[2024,10,21]]},"assertion":[{"value":"2024-10-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}