{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:27Z","timestamp":1770921387150,"version":"3.50.1"},"publisher-location":"Cham","reference-count":12,"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_43","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:00Z","timestamp":1770918780000},"page":"593-606","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Trace Frequency Queries in\u00a0Sparse 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\/0000-0001-7228-6640","authenticated-orcid":false,"given":"P\u00e5l","family":"Gr\u00f8n\u00e5s Drange","sequence":"additional","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":"43_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Williams, V., Wang, J.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201916, pp. 377\u2013391, USA, January 2016. Society for Industrial and Applied Mathematics","DOI":"10.1137\/1.9781611974331.ch28"},{"key":"43_CR2","unstructured":"Awofeso, C., Greaves, P., Lachish, O., Reidl, F.: A practical algorithm for 2-admissibility. In: 23rd International Symposium on Experimental Algorithms, SEA 2025, July 22-24, 2025, Venice, Italy, volume 338 of LIPIcs, pp. 3:1\u20133:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025)"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Breen-McKay, M., Lavallee, B., Sullivan, B.D.: Hardness of the generalized coloring numbers. Eur. J. Comb. p. 103709 (2023)","DOI":"10.1016\/j.ejc.2023.103709"},{"issue":"8","key":"43_CR4","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1016\/j.jcss.2006.04.007","volume":"72","author":"J Chen","year":"2006","unstructured":"Chen, J., Huang, X., Kanj, I.A., Xia, G.: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8), 1346\u20131367 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"43_CR5","unstructured":"Drange, P. G., et al.: Kernelization and sparseness: the case of dominating set. In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orl\u00e9ans, France, volume\u00a047 of LIPIcs, pp. 31:1\u201331:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"43_CR6","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"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k, Z.:. Constant-factor approximation of the domination number in sparse graphs. Eur. J. Comb., 34(5):833\u2013840 (2013)","DOI":"10.1016\/j.ejc.2012.12.004"},{"key":"43_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-642-40450-4_45","volume-title":"Algorithms \u2013 ESA 2013","author":"J Gajarsk\u00fd","year":"2013","unstructured":"Gajarsk\u00fd, J., et al.: Kernelization using structural parameters on sparse graph classes. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 529\u2013540. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_45"},{"issue":"3","key":"43_CR9","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 30(3), 417\u2013427 (1983)","journal-title":"J. ACM"},{"key":"43_CR10","doi-asserted-by":"publisher","unstructured":"Sparsity. AC, vol. 28. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4","DOI":"10.1007\/978-3-642-27875-4"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Reidl, F., Villaamil, F., Stavropoulos, K, S.: Characterising bounded expansion by neighbourhood complexity. Eur. J. Comb., 75:152\u2013168 (2019)","DOI":"10.1016\/j.ejc.2018.08.001"},{"issue":"18","key":"43_CR12","doi-asserted-by":"publisher","first-page":"5562","DOI":"10.1016\/j.disc.2008.03.024","volume":"309","author":"X Zhu","year":"2009","unstructured":"Zhu, X.: Colouring graphs with bounded generalized colouring number. Discret. Math. 309(18), 5562\u20135568 (2009)","journal-title":"Discret. Math."}],"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_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:02Z","timestamp":1770918782000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_43","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"}}]}}