{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T15:40:05Z","timestamp":1755877205885,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T00:00:00Z","timestamp":1717027200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-sa\/4.0\/"}],"funder":[{"name":"Engineering and Physical Sciences Reserach Council","award":["EP\/X01794X\/1 EP\/T022175\/1"],"award-info":[{"award-number":["EP\/X01794X\/1 EP\/T022175\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,30]]},"DOI":"10.1145\/3650200.3656607","type":"proceedings-article","created":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T14:11:54Z","timestamp":1717423914000},"page":"150-163","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Differentiating Set Intersections in Maximal Clique Enumeration by Function and Subproblem Size"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5868-9259","authenticated-orcid":false,"given":"Hans","family":"Vandierendonck","sequence":"first","affiliation":[{"name":"School of Electronics, Electrical Engineering and Computer Science, Queen's University Belfast, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2024,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. The Network Data Repository with Interactive Graph Analytics and Visualization Vol.\u00a029. https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/9277"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202001"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3524059.3532382"},{"key":"e_1_3_2_1_4_1","volume-title":"Fast intersection algorithms for sorted sequences. Algorithms and Applications: Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday","author":"Baeza-Yates Ricardo","year":"2010","unstructured":"Ricardo Baeza-Yates and Alejandro Salinger. 2010. Fast intersection algorithms for sorted sequences. Algorithms and Applications: Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday (2010), 45\u201361."},{"key":"e_1_3_2_1_5_1","volume-title":"SLAC-PUB-1679","author":"Bentley Jon\u00a0Louis","year":"1976","unstructured":"Jon\u00a0Louis Bentley and Andrew Chi-Chih Yao. 1976. An almost optimal algorithm for unbounded searching. Information processing letters 5, SLAC-PUB-1679 (1976)."},{"volume-title":"High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality","author":"Besta Maciej","key":"e_1_3_2_1_6_1","unstructured":"Maciej Besta, Armon Carigiet, Kacper Janda, Zur Vonarburg-Shmaria, Lukas Gianinazzi, and Torsten Hoefler. 2020. High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality. IEEE Press."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480133"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476252"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407853"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365680"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3611479.3611485"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_13_1","unstructured":"Nathan Bronson and Xiao Shi. 2019. Open-sourcing F14 for faster more memory-efficient hash tables. https:\/\/engineering.fb.com\/2019\/04\/25\/developer-tools\/f14\/."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TST.2015.7040519"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.05.018"},{"volume-title":"Mining graph data","author":"Cook J","key":"e_1_3_2_1_16_1","unstructured":"Diane\u00a0J Cook and Lawrence\u00a0B Holder. 2006. Mining graph data. John Wiley & Sons."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2018.00016"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/PADSW.2014.7097844"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087580"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2006.17"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"D. Eppstein M. L\u00f6ffler and D. Strash. 2010. Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time. arxiv:cs.DS\/1006.5440","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on Machine Learning. PMLR, 1397\u20131406","author":"Esfandiari Hossein","year":"2018","unstructured":"Hossein Esfandiari, Silvio Lattanzi, and Vahab Mirrokni. 2018. Parallel and streaming algorithms for k-core decomposition. In International Conference on Machine Learning. PMLR, 1397\u20131406."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2314"},{"key":"e_1_3_2_1_25_1","unstructured":"Friendster 2011. Friendster Data Set. https:\/\/archive.org\/download\/friendster-dataset-201107."},{"key":"e_1_3_2_1_26_1","unstructured":"Google Inc. 2022. Abseil Containers. https:\/\/abseil.io\/docs\/cpp\/guides\/container#abseil-containers."},{"volume-title":"Data mining: concepts and techniques","author":"Han Jiawei","key":"e_1_3_2_1_27_1","unstructured":"Jiawei Han, Micheline Kamber, and Jian Pei. 2012. Data mining: concepts and techniques, Waltham, MA. Vol.\u00a010. Morgan Kaufman Publishers. 978\u20131 pages."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735518"},{"key":"e_1_3_2_1_29_1","unstructured":"Intel. 2023. Intel 64 and IA-32 Architectures Optimization Reference Manual. https:\/\/www.intel.com\/content\/www\/us\/en\/content-details\/671488\/intel-64-and-ia-32-architectures-optimization-reference-manual-volume-1.html."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371839"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.12.1198"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2402"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/LDAV.2017.8231847"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1970-125-1"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxx046"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.11.016"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850585"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.12.006"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2013.2264869"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.07.019"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC47752.2019.9042069"},{"key":"e_1_3_2_1_44_1","unstructured":"Stanford. 2009. Stanford Large Network Dataset Collection. https:\/\/snap.stanford.edu\/data\/"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2017.35"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.08.011"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SEA.2022.11"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32467-8_30"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1970"},{"key":"e_1_3_2_1_51_1","volume-title":"Yahoo Webscope Datasets. https:\/\/webscope.sandbox.yahoo.com. Last retrieved","author":"Webscope","year":"2023","unstructured":"Webscope [n.d.]. Yahoo Webscope Datasets. https:\/\/webscope.sandbox.yahoo.com. Last retrieved November 2023."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3067053"},{"key":"e_1_3_2_1_53_1","unstructured":"Wikimedia 2011. Wikimedia Downloads. https:\/\/dumps.wikimedia.org."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCST.2009.30"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2019.05.005"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.29"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467219"}],"event":{"name":"ICS '24: 2024 International Conference on Supercomputing","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Kyoto Japan","acronym":"ICS '24"},"container-title":["Proceedings of the 38th ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3650200.3656607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3650200.3656607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T15:23:44Z","timestamp":1755876224000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3650200.3656607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,30]]},"references-count":57,"alternative-id":["10.1145\/3650200.3656607","10.1145\/3650200"],"URL":"https:\/\/doi.org\/10.1145\/3650200.3656607","relation":{},"subject":[],"published":{"date-parts":[[2024,5,30]]},"assertion":[{"value":"2024-06-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}