{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:02:23Z","timestamp":1772906543400,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"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":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055502","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"210-223","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Homomorphisms are a good basis for counting small subgraphs"],"prefix":"10.1145","author":[{"given":"Radu","family":"Curticapean","sequence":"first","affiliation":[{"name":"Hungarian Academy of Sciences, Hungary"}]},{"given":"Holger","family":"Dell","sequence":"additional","affiliation":[{"name":"Saarland University, Germany"}]},{"given":"D\u00e1niel","family":"Marx","sequence":"additional","affiliation":[{"name":"Hungarian Academy of Sciences, Hungary"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.16"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn163"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04128-0_52"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634119"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33293-7_17"},{"key":"e_1_3_2_2_7_1","volume-title":"Springer","author":"Borgs Christian","year":"2006"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58747-9_10"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.05.001"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150418"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Yijia Chen Martin Grohe and Bingkai Lin. The hardness of embedding grids and walls. arXiv preprint arXiv:1703.06423 2017.  Yijia Chen Martin Grohe and Bingkai Lin. The hardness of embedding grids and walls. arXiv preprint arXiv:1703.06423 2017.","DOI":"10.1007\/978-3-319-68705-6_14"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_48"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39206-1_30"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.22"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Marek Cygan Fedor V. Fomin Lukasz Kowalik Daniel Lokshtanov D\u00e1niel Marx Marcin Pilipczuk Michal Pilipczuk and Saket Saurabh. Parameterized Algorithms. Springer 2015.   Marek Cygan Fedor V. Fomin Lukasz Kowalik Daniel Lokshtanov D\u00e1niel Marx Marcin Pilipczuk Michal Pilipczuk and Saket Saurabh. Parameterized Algorithms. Springer 2015.","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.08.008"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635812"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00017-8"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1017569"},{"key":"e_1_3_2_2_21_1","unstructured":"STOC\u201917 June 2017 Montreal Canada Radu Curticapean Holger Dell and D\u00e1niel Marx  STOC\u201917 June 2017 Montreal Canada Radu Curticapean Holger Dell and D\u00e1niel Marx"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.05.009"},{"key":"e_1_3_2_2_23_1","volume-title":"Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag","author":"Flum J\u00f6rg","year":"2006"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_2_25_1","first-page":"106","volume-title":"Annual International Conference on Research in Computational Molecular Biology","author":"Grochow Joshua A"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1206035.1206036"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1727"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207033"},{"key":"e_1_3_2_2_29_1","first-page":"629","volume-title":"Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Bart M.","year":"2015"},{"key":"e_1_3_2_2_30_1","unstructured":"Mark Jerrum and Kitty Meeks. The parameterised complexity of counting even and odd induced subgraphs. CoRR abs\/1410.3375 2014.  Mark Jerrum and Kitty Meeks. The parameterised complexity of counting even and odd induced subgraphs. CoRR abs\/1410.3375 2014."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.11.015"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786017"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-318"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth163"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00047-8"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2885499"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859798"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722170"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz. Operations with structures. Acta Mathematica Hungarica 18(3- 4): 321\u2013328 1967.  L\u00e1szl\u00f3 Lov\u00e1sz. Operations with structures. Acta Mathematica Hungarica 18(3- 4):321\u2013328 1967.","DOI":"10.1007\/BF02280291"},{"key":"e_1_3_2_2_40_1","volume-title":"American Mathematical Society Providence","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"2012"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2010.v006a005"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.06.019"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"issue":"2","key":"e_1_3_2_2_44_1","first-page":"415","article-title":"On the complexity of the subgraph problem","volume":"26","author":"Ne\u0161et\u0159il Jaroslav","year":"1985","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Rolf\n       \n      Niedermeier\n    .\n      \n  \n   \n  Invitation to fixed-parameter algorithms volume \n  31\n   of \n  Oxford Lecture Series in Mathematics and its Applications\n  . \n  Oxford University Press Oxford 2006\n  .  Rolf Niedermeier. Invitation to fixed-parameter algorithms volume 31 of Oxford Lecture Series in Mathematics and its Applications. Oxford University Press Oxford 2006.","DOI":"10.1093\/acprof:oso\/9780198566076.003.0001"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Saeed Omidi Falk Schreiber and Ali Masoudi-Nejad. MODA: An efficient algorithm for network motif discovery in biological networks. Genes & genetic systems 84(5):385\u2013395 2009.  Saeed Omidi Falk Schreiber and Ali Masoudi-Nejad. MODA: An efficient algorithm for network motif discovery in biological networks. Genes & genetic systems 84(5):385\u2013395 2009.","DOI":"10.1266\/ggs.84.385"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21233-3_5"},{"key":"e_1_3_2_2_48_1","volume-title":"Springer","author":"Schreiber Falk","year":"2005"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2007.08.001"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.51"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.67"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/09076619X"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055502","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:20Z","timestamp":1750217780000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":55,"alternative-id":["10.1145\/3055399.3055502","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055502","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}