{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:28:42Z","timestamp":1742383722110},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,8,20]]},"DOI":"10.1145\/1150402.1150427","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T22:04:00Z","timestamp":1161209040000},"page":"197-206","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Frequent subgraph mining in outerplanar graphs"],"prefix":"10.1145","author":[{"given":"Tam\u00e1s","family":"Horv\u00e1th","sequence":"first","affiliation":[{"name":"University of Bonn & Fraunhofer Institute IAIS, Sankt Augustin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[{"name":"Katholieke Universiteit, Leuven, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Wrobel","sequence":"additional","affiliation":[{"name":"Fraunhofer Institute IAIS & University of Bonn, Sankt Augustin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Agrawal R.","year":"1996","unstructured":"R. Agrawal , H. Mannila , R. Srikant , H. Toivonen , and A. I. Verkamo . Fast discovery of association rules . In Advances in Knowledge Discovery and Data Mining , pp. 307 -- 328 . AAAI\/MIT Press , 1996 . R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pp. 307--328. AAAI\/MIT Press, 1996."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2370136.2370144"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-004-0180-7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1618595.1618605"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.127"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1997.1812"},{"key":"e_1_3_2_1_7_1","volume-title":"Computers and Intractability: A Guide to NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: A Guide to NP-Completeness . Freeman , San Francisco, CA , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to NP-Completeness. Freeman, San Francisco, CA, 1979."},{"key":"e_1_3_2_1_8_1","volume-title":"Graph Theory. Addison--Wesley","author":"Harary F.","year":"1971","unstructured":"F. Harary . Graph Theory. Addison--Wesley , Reading, Massachusetts , 1971 . F. Harary. Graph Theory. Addison--Wesley, Reading, Massachusetts, 1971."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803896"},{"key":"e_1_3_2_1_10_1","volume-title":"Frequent hypergraph mining. Unpublished manuscript","author":"Horv\u00e1th T.","year":"2004","unstructured":"T. Horv\u00e1th , B. Bringmann , and L. D. Raedt . Frequent hypergraph mining. Unpublished manuscript , 2004 . T. Horv\u00e1th, B. Bringmann, and L. D. Raedt. Frequent hypergraph mining. Unpublished manuscript, 2004."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021726221443"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90011-X"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70324-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90075-9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.1975.5.3.237"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1044"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90133-5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_3_2_1_20_1","first-page":"721","volume-title":"Proc. of the IEEE Int. Conf. on Data Mining","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han . gspan: Graph-based substructure pattern mining . In Proc. of the IEEE Int. Conf. on Data Mining , pp. 721 -- 724 , IEEE Comp. Society , 2002 . X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Proc. of the IEEE Int. Conf. on Data Mining, pp. 721--724, IEEE Comp. Society, 2002."}],"event":{"name":"KDD06: The 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"],"location":"Philadelphia PA USA","acronym":"KDD06"},"container-title":["Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1150402.1150427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T09:23:51Z","timestamp":1673169831000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1150402.1150427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,20]]},"references-count":20,"alternative-id":["10.1145\/1150402.1150427","10.1145\/1150402"],"URL":"https:\/\/doi.org\/10.1145\/1150402.1150427","relation":{},"subject":[],"published":{"date-parts":[[2006,8,20]]},"assertion":[{"value":"2006-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}