{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T07:32:09Z","timestamp":1778916729298,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1750760,1823005"],"award-info":[{"award-number":["1750760,1823005"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,3]]},"DOI":"10.1145\/3711896.3736966","type":"proceedings-article","created":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T21:05:41Z","timestamp":1754255141000},"page":"2514-2525","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["FLEXIS: FLEXible Frequent Subgraph Mining using Maximal Independent Sets"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7361-812X","authenticated-orcid":false,"given":"Akshit","family":"Sharma","sequence":"first","affiliation":[{"name":"Colorado School of Mines, Golden, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1472-117X","authenticated-orcid":false,"given":"Sam","family":"Reinehr","sequence":"additional","affiliation":[{"name":"Colorado School of Mines, Golden, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7521-5781","authenticated-orcid":false,"given":"Dinesh","family":"Mehta","sequence":"additional","affiliation":[{"name":"Colorado School of Mines, Golden, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1696-4272","authenticated-orcid":false,"given":"Bo","family":"Wu","sequence":"additional","affiliation":[{"name":"Colorado School of Mines, Golden, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44584-3_5"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.02.021"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-97785-0_30"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2019.07.001"},{"key":"e_1_3_2_2_6_1","first-page":"857","volume-title":"16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22)","author":"Xuhao","unstructured":"Xuhao Chen et al., 2022. Efficient and Scalable Graph Pattern Mining on {GPUs}. In 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22). UNENIX Association, 2560 Ninth St. Suite 215 Berkeley, CA, 857-877."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3460359"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389137"},{"key":"e_1_3_2_2_9_1","volume-title":"A first look at graph theory. World Scientific","author":"Clark John","unstructured":"John Clark and Derek Allan Holton. 2005. A first look at graph theory. World Scientific, Singapore."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3470496.3527388"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732289"},{"key":"e_1_3_2_2_12_1","volume-title":"Support computation for mining frequent subgraphs in a single graph","author":"Fiedler Mathias","unstructured":"Mathias Fiedler and Christian Borgelt. 2007. Support computation for mining frequent subgraphs in a single graph. In MLG. Association for Computing Machinery, New York, NY, USA."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389699"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3035564"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387548"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888912000331"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.13"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791188.2791201"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19754-3_16"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629550"},{"key":"e_1_3_2_2_21_1","volume-title":"Graphs and Networks","author":"Kingan Sandra R.","unstructured":"Sandra R. Kingan. 2022. Graphs and Networks. Wiley, Hoboken, NJ."},{"key":"e_1_3_2_2_22_1","first-page":"2550","article-title":"Molecule generation by principal subgraph mining and assembling","volume":"35","author":"Kong Xiangzhe","year":"2022","unstructured":"Xiangzhe Kong, Wenbing Huang, Zhixing Tan, and Yang Liu. 2022. Molecule generation by principal subgraph mining and assembling. Advances in Neural Information Processing Systems, Vol. 35 (2022), 2550-2563.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.11"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.33"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.08.008"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512196"},{"key":"e_1_3_2_2_28_1","first-page":"268","volume-title":"International Workshop on Data Privacy Management. Springer","author":"Martinelli Fabio","year":"2013","unstructured":"Fabio Martinelli, Andrea Saracino, and Daniele Sgandurra. 2013. Classifying android malware through subgraph mining. In International Workshop on Data Privacy Management. Springer, Berlin, Heidelberg, 268-283."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40596-4_46"},{"key":"e_1_3_2_2_30_1","volume-title":"Grasping frequent subgraph mining for bioinformatics applications. BioData mining","author":"Mrzic Aida","year":"2018","unstructured":"Aida Mrzic, Pieter Meysman, Wout Bittremieux, Pieter Moris, Boris Cule, Bart Goethals, and Kris Laukens. 2018. Grasping frequent subgraph mining for bioinformatics applications. BioData mining, Vol. 11, 1 (2018), 1-24."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-03164-5"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103539"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.13164\/mendel.2021.2.090"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1454"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1839490.1839491"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00208"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00687-0"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1184038"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588928"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00064"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711896.3736966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T18:15:44Z","timestamp":1777572944000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711896.3736966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"references-count":42,"alternative-id":["10.1145\/3711896.3736966","10.1145\/3711896"],"URL":"https:\/\/doi.org\/10.1145\/3711896.3736966","relation":{},"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"2025-08-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}