{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:50Z","timestamp":1770921410446,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17801-5_44","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:21Z","timestamp":1770918801000},"page":"607-620","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Counting Large Patterns in\u00a0Degenerate Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-3550-1727","authenticated-orcid":false,"given":"Christine","family":"Awofeso","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0752-0526","authenticated-orcid":false,"given":"Patrick","family":"Greaves","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5406-8121","authenticated-orcid":false,"given":"Oded","family":"Lachish","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2354-3003","authenticated-orcid":false,"given":"Felix","family":"Reidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Williams, V.V.: Popular conjectures imply strong lower bounds for dynamic problems. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 434\u2013443. IEEE (2014)","DOI":"10.1109\/FOCS.2014.53"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Bera, S.K., Gishboliner, L., Levanzov, Y., Seshadhri, C., Shapira, A.: Counting subgraphs in degenerate graphs. J. ACM, 69(3) (2022)","DOI":"10.1145\/3520240"},{"key":"44_CR3","unstructured":"Bera, S. K., Pashanasangi, N., Seshadhri, C.: Linear time subgraph counting, graph degeneracy, and the chasm at size six. In: Vidick, T., (ed.), 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), volume 151 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 38:1\u201338:20, Dagstuhl (2020). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik"},{"key":"44_CR4","doi-asserted-by":"publisher","unstructured":"Bressan, M.: Faster algorithms for counting subgraphs in sparse graphs. Algorithmica 83(8), 2578\u20132605 (2021). https:\/\/doi.org\/10.1007\/s00453-021-00811-0","DOI":"10.1007\/s00453-021-00811-0"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Bressan, M., Roth, M.: Exact and approximate pattern counting in degenerate graphs: new algorithms, hardness results, and complexity dichotomies. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 276\u2013285. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00036"},{"key":"44_CR6","doi-asserted-by":"publisher","unstructured":"Chen, Y., Thurley, M., Weyer, M.: Understanding the complexity of induced subgraph isomorphisms. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 587\u2013596. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_48","DOI":"10.1007\/978-3-540-70575-8_48"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Curticapean, R., Marx, D.: Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 130\u2013139 (2014)","DOI":"10.1109\/FOCS.2014.22"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Dalmau, V., Jonsson, P.: The complexity of counting homomorphisms seen from the other side. Theor. Comput. Sci. 329(1\u20133), 315\u2013323 (2004","DOI":"10.1016\/j.tcs.2004.08.008"},{"key":"44_CR9","unstructured":"Drange, P.G., Greaves, P., Muzi, I., Reidl, F.: Computing complexity measures of degenerate graphs. In: 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), volume 285 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 14:1\u201314:21, Dagstuhl, Germany (2023). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik"},{"issue":"4","key":"44_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Inf. Process. Lett. 51(4), 207\u2013211 (1994)","journal-title":"Inf. Process. Lett."},{"key":"44_CR11","doi-asserted-by":"publisher","unstructured":"Habib, M., Paul, C., Viennoti, L.: A synthesis on partition refinement: a useful routine for strings, graphs, boolean matrices and automata. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 25\u201338. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028546","DOI":"10.1007\/BFb0028546"},{"issue":"1","key":"44_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.4086\/toc.2010.v006a005","volume":"6","author":"D Marx","year":"2010","unstructured":"Marx, D.: Can you beat treewidth? Theory Comput. 6(1), 85\u2013112 (2010)","journal-title":"Theory Comput."},{"issue":"3","key":"44_CR13","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM (JACM) 30(3), 417\u2013427 (1983)","journal-title":"J. ACM (JACM)"},{"issue":"6","key":"44_CR14","doi-asserted-by":"publisher","first-page":"S20","DOI":"10.1137\/20M1365624","volume":"53","author":"M Roth","year":"2024","unstructured":"Roth, M., Schmitt, J., Wellnitz, P.: Counting small induced subgraphs satisfying monotone properties. SIAM J. Comput. 53(6), S20-139 (2024)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:24Z","timestamp":1770918804000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}