{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T05:05:09Z","timestamp":1768626309255,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"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":[[2022,6,9]]},"DOI":"10.1145\/3519935.3520008","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"1543-1551","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Counting small induced subgraphs with hereditary properties"],"prefix":"10.1145","author":[{"given":"Jacob","family":"Focke","sequence":"first","affiliation":[{"name":"CISPA, Germany"}]},{"given":"Marc","family":"Roth","sequence":"additional","affiliation":[{"name":"University of Oxford, UK"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Biomolecular network motif counting and discovery by color coding. Bioinformatics, 24, 13","author":"Alon Noga","year":"2008","unstructured":"Noga Alon , Phuong Dao , Iman Hajirasouliha , Fereydoun Hormozdiari , and S. Cenk Sahinalp . 2008. Biomolecular network motif counting and discovery by color coding. Bioinformatics, 24, 13 ( 2008 ), 07, i241\u2013i249. issn:1367-4803 https:\/\/doi.org\/10.1093\/bioinformatics\/btn163 10.1093\/bioinformatics Noga Alon, Phuong Dao, Iman Hajirasouliha, Fereydoun Hormozdiari, and S. Cenk Sahinalp. 2008. Biomolecular network motif counting and discovery by color coding. Bioinformatics, 24, 13 (2008), 07, i241\u2013i249. issn:1367-4803 https:\/\/doi.org\/10.1093\/bioinformatics\/btn163"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36136-7_40"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902279"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.05.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.04.007"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_48"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055502"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.08.008"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.135"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00894-9"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86593-1_15"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00161-5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X"},{"key":"e_1_3_2_1_15_1","volume-title":"Counting Small Induced Subgraphs with Hereditary Properties. CoRR, abs\/2111.02277","author":"Focke Jacob","year":"2021","unstructured":"Jacob Focke and Marc Roth . 2021. Counting Small Induced Subgraphs with Hereditary Properties. CoRR, abs\/2111.02277 ( 2021 ), arXiv:2111.02277. Jacob Focke and Marc Roth. 2021. Counting Small Induced Subgraphs with Hereditary Properties. CoRR, abs\/2111.02277 (2021), arXiv:2111.02277."},{"key":"e_1_3_2_1_16_1","volume-title":"Grochow and Manolis Kellis","author":"Joshua","year":"2007","unstructured":"Joshua A. Grochow and Manolis Kellis . 2007 . Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking. In Research in Computational Molecular Biology, Terry Speed and Haiyan Huang (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg. 92\u2013106. isbn:978-3-540-71681-5 Joshua A. Grochow and Manolis Kellis. 2007. Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking. In Research in Computational Molecular Biology, Terry Speed and Haiyan Huang (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 92\u2013106. isbn:978-3-540-71681-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380867"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1727"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.11.015"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786017"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-016-3338-5"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0031-8914(61)90063-5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1703953"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00414-5"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.06.019"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1089167"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_1_28_1","first-page":"415","article-title":"On the complexity of the subgraph problem","volume":"26","author":"Ne\u0161et\u0159il Jaroslav","year":"1985","unstructured":"Jaroslav Ne\u0161et\u0159il and Svatopluk Poljak . 1985 . On the complexity of the subgraph problem . Commentationes Mathematicae Universitatis Carolinae , 26 , 2 (1985), 415 \u2013 419 . Jaroslav Ne\u0161et\u0159il and Svatopluk Poljak. 1985. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, 26, 2 (1985), 415\u2013419.","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00676-9"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00128"},{"key":"e_1_3_2_1_31_1","volume-title":"Algorithms for Computational Biology, Adrian-Horia Dediu, Francisco Hern\u00e1ndez-Quiroz, Carlos Mart\u00edn-Vide, and David A","author":"Schiller Benjamin","unstructured":"Benjamin Schiller , Sven Jager , Kay Hamacher , and Thorsten Strufe . 2015. StreaM - A Stream-Based Algorithm for Counting Motifs in Dynamic Graphs . In Algorithms for Computational Biology, Adrian-Horia Dediu, Francisco Hern\u00e1ndez-Quiroz, Carlos Mart\u00edn-Vide, and David A . Rosenblueth (Eds.). Springer International Publishing , Cham . 53\u201367. isbn:978-3-319-21233-3 Benjamin Schiller, Sven Jager, Kay Hamacher, and Thorsten Strufe. 2015. StreaM - A Stream-Based Algorithm for Counting Motifs in Dynamic Graphs. In Algorithms for Computational Biology, Adrian-Horia Dediu, Francisco Hern\u00e1ndez-Quiroz, Carlos Mart\u00edn-Vide, and David A. Rosenblueth (Eds.). Springer International Publishing, Cham. 53\u201367. isbn:978-3-319-21233-3"},{"key":"e_1_3_2_1_32_1","volume-title":"Transactions on Computational Systems Biology III","author":"Schreiber Falk","unstructured":"Falk Schreiber and Henning Schw\u00f6bbermeyer . 2005. Frequency Concepts and Pattern Detection for the Analysis of Motifs in Networks . In Transactions on Computational Systems Biology III , Corrado Priami, Emanuela Merelli, Pablo Gonzalez, and Andrea Omicini (Eds.). Springer Berlin Heidelberg, Berlin , Heidelberg . 89\u2013104. isbn:978-3-540-31446-2 Falk Schreiber and Henning Schw\u00f6bbermeyer. 2005. Frequency Concepts and Pattern Detection for the Analysis of Motifs in Networks. In Transactions on Computational Systems Biology III, Corrado Priami, Emanuela Merelli, Pablo Gonzalez, and Andrea Omicini (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 89\u2013104. isbn:978-3-540-31446-2"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786436108243366"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520008","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3520008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:39Z","timestamp":1750268979000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":33,"alternative-id":["10.1145\/3519935.3520008","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3520008","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}