{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T12:54:31Z","timestamp":1782046471090,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,24]],"date-time":"2010-07-24T00:00:00Z","timestamp":1279929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,24]]},"DOI":"10.1145\/1830252.1830272","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"155-162","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Frequent subgraph discovery in dynamic networks"],"prefix":"10.1145","author":[{"given":"Bianca","family":"Wackersreuther","sequence":"first","affiliation":[{"name":"University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Wackersreuther","sequence":"additional","affiliation":[{"name":"University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Annahita","family":"Oswald","sequence":"additional","affiliation":[{"name":"University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"B\u00f6hm","sequence":"additional","affiliation":[{"name":"University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karsten M.","family":"Borgwardt","sequence":"additional","affiliation":[{"name":"MPIs for Developmental Biology and Biological Cybernetics, T\u00fcbingen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.10.4.431"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1038\/75556"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.124"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1097-2765(00)80114-8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1618595.1618605"},{"key":"e_1_3_2_1_6_1","volume-title":"Mining Temporally Evolving Graphs. In WebKDD Workshop","author":"Desikan P.","year":"2004","unstructured":"P. Desikan and J. Srivastava . Mining Temporally Evolving Graphs. In WebKDD Workshop , 2004 . P. Desikan and J. Srivastava. Mining Temporally Evolving Graphs. In WebKDD Workshop, 2004."},{"key":"e_1_3_2_1_7_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkm909"},{"key":"e_1_3_2_1_9_1","first-page":"230","volume-title":"CPM","author":"Hui L. C. K.","year":"1992","unstructured":"L. C. K. Hui . Color set size problem with application to string matching . In CPM , pages 230 -- 243 , 1992 . L. C. K. Hui. Color set size problem with application to string matching. In CPM, pages 230--243, 1992."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021726221443"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth163"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.32"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1032649.1033500"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIDM.2007.368850"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.2000.5197"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1038\/ng881"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.51"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1038\/ng1242"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/30.1.303"},{"key":"e_1_3_2_1_22_1","first-page":"721","volume-title":"ICDM","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han . gSpan: Graph-Based Substructure Pattern Mining . In ICDM , pages 721 -- 724 , 2002 . X. Yan and J. Han. gSpan: Graph-Based Substructure Pattern Mining. In ICDM, pages 721--724, 2002."}],"event":{"name":"KDD '10: The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Washington, D.C.","acronym":"KDD '10","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the Eighth Workshop on Mining and Learning with Graphs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830252.1830272","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1830252.1830272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:38Z","timestamp":1750246778000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830252.1830272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,24]]},"references-count":22,"alternative-id":["10.1145\/1830252.1830272","10.1145\/1830252"],"URL":"https:\/\/doi.org\/10.1145\/1830252.1830272","relation":{},"subject":[],"published":{"date-parts":[[2010,7,24]]},"assertion":[{"value":"2010-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}