{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:56Z","timestamp":1770921416320,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"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_18","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:27Z","timestamp":1770918807000},"page":"246-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Strictly Output-Sensitive Color Frequency Reporting"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-6645-4240","authenticated-orcid":false,"given":"Erwin","family":"Glazenburg","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-8522-1351","authenticated-orcid":false,"given":"Frank","family":"Staals","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Afshani, P., Cheng, P., Roy, A.B., Wei, Z.: On range summary queries. In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. LIPIcs, vol.\u00a0261, pp. 7:1\u20137:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2023.7","DOI":"10.4230\/LIPICS.ICALP.2023.7"},{"issue":"11","key":"18_CR2","doi-asserted-by":"publisher","first-page":"3192","DOI":"10.1007\/S00453-017-0376-3","volume":"80","author":"P Afshani","year":"2018","unstructured":"Afshani, P., Tsakalidis, K.: Optimal deterministic shallow cuttings for 3-d dominance ranges. Algorithmica 80(11), 3192\u20133206 (2018). https:\/\/doi.org\/10.1007\/S00453-017-0376-3","journal-title":"Algorithmica"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"de\u00a0Berg, M., Cheong, O., van Kreveld, M.J., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","DOI":"10.1007\/978-3-540-77974-2"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-60084-1_97","volume-title":"Automata, Languages and Programming","author":"P Bozanis","year":"1995","unstructured":"Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: New upper bounds for generalized intersection searching problems. In: F\u00fcl\u00f6p, Z., G\u00e9cseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 464\u2013474. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60084-1_97"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Chan, T.M., He, Q., Nekrich, Y.: Further results on colored range searching. In: 36th International Symposium on Computational Geometry, SoCG 2020. LIPIcs, vol.\u00a0164, pp. 28:1\u201328:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPICS.SOCG.2020.28","DOI":"10.4230\/LIPICS.SOCG.2020.28"},{"issue":"3","key":"18_CR6","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B Chazelle","year":"1986","unstructured":"Chazelle, B.: Filtering search: a new approach to query-answering. SIAM J. Comput. 15(3), 703\u2013724 (1986). https:\/\/doi.org\/10.1137\/0215051","journal-title":"SIAM J. Comput."},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Chazelle, B.: Lower bounds for orthogonal range searching: I. the reporting case. J. ACM 37(2), 200\u2013212 (1990). https:\/\/doi.org\/10.1145\/77600.77614","DOI":"10.1145\/77600.77614"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Chazelle, B.: Lower bounds for orthogonal range searching II. the arithmetic model. J. ACM 37(3), 439\u2013463 (1990). https:\/\/doi.org\/10.1145\/79147.79149","DOI":"10.1145\/79147.79149"},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.J.: Fractional cascading: I. A data structuring technique. Algorithmica 1(2), 133\u2013162 (1986). https:\/\/doi.org\/10.1007\/BF01840440","journal-title":"Algorithmica"},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"Ganguly, A., Munro, J.I., Nekrich, Y., Shah, R., Thankachan, S.V.: Categorical range reporting with frequencies. In: 22nd International Conference on Database Theory, ICDT 2019. LIPIcs, vol.\u00a0127, pp. 9:1\u20139:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPICS.ICDT.2019.9","DOI":"10.4230\/LIPICS.ICDT.2019.9"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Gupta, P., Janardan, R., Rahul, S., Smid, M.: Computational geometry: generalized (or colored) intersection searching. In: Handbook of Data Structures and Applications, pp. 1043\u20131058. Chapman and Hall\/CRC (2004). https:\/\/doi.org\/10.1201\/9781420035179","DOI":"10.1201\/9781420035179"},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1006\/JAGM.1995.1038","volume":"19","author":"P Gupta","year":"1995","unstructured":"Gupta, P., Janardan, R., Smid, M.H.M.: Further results on generalized intersection searching problems: counting, reporting, and dynamization. J. Algorithms 19(2), 282\u2013317 (1995). https:\/\/doi.org\/10.1006\/JAGM.1995.1038","journal-title":"J. Algorithms"},{"issue":"5","key":"18_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0020-0190(97)00183-X","volume":"64","author":"P Gupta","year":"1997","unstructured":"Gupta, P., Janardan, R., Smid, M.H.M.: A technique for adding range restrictions to generalized searching problems. Inf. Process. Lett. 64(5), 263\u2013269 (1997). https:\/\/doi.org\/10.1016\/S0020-0190(97)00183-X","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1142\/S021819599300004X","volume":"3","author":"R Janardan","year":"1993","unstructured":"Janardan, R., L\u00f3pez, M.A.: Generalized intersection searching problems. Int. J. Comput. Geom. Appl. 3(1), 39\u201369 (1993). https:\/\/doi.org\/10.1142\/S021819599300004X","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"18_CR15","unstructured":"Rahul, S., Gupta, P., Rajan, K.S.: Data structures for range aggregation by categories. In: Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, 17\u201319 August 2009, pp. 133\u2013136 (2009). http:\/\/cccg.ca\/proceedings\/2009\/cccg09_35.pdf"},{"issue":"3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/J.IPL.2005.04.008","volume":"95","author":"Q Shi","year":"2005","unstructured":"Shi, Q., J\u00e1J\u00e1, J.F.: Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines. Inf. Process. Lett. 95(3), 382\u2013388 (2005). https:\/\/doi.org\/10.1016\/J.IPL.2005.04.008","journal-title":"Inf. Process. Lett."}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:29Z","timestamp":1770918809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_18","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"}}]}}