{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:37:00Z","timestamp":1770921420752,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"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_16","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:31Z","timestamp":1770918811000},"page":"216-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Using Ray-Shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9003-3783","authenticated-orcid":false,"given":"Therese","family":"Biedl","sequence":"first","affiliation":[]},{"given":"Prashant","family":"Gokhale","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/0401032","volume":"1","author":"AA Bertossi","year":"1988","unstructured":"Bertossi, A.A., Gori, A.: Total domination and irredundance in weighted interval graphs. SIAM J. Discret. Math. 1(3), 317\u2013327 (1988). https:\/\/doi.org\/10.1137\/0401032","journal-title":"SIAM J. Discret. Math."},{"key":"16_CR2","unstructured":"Biedl, T., Gokhale, P.: Finding maximum matchings in RDV graphs efficiently. Comput. Geom. Topology (2025). Submitted to special issue for papers from CCCG\u201924"},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0211015","volume":"11","author":"K Booth","year":"1982","unstructured":"Booth, K., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11(1), 191\u2013199 (1982). https:\/\/doi.org\/10.1137\/0211015","journal-title":"SIAM J. Comput."},{"issue":"8\/9","key":"16_CR4","first-page":"471","volume":"23","author":"A Brandst\u00e4dt","year":"1987","unstructured":"Brandst\u00e4dt, A.: The computational complexity of feedback vertex set, hamiltonian circuit, dominating set, steiner tree, and bandwidth on special perfect graphs. J. Inf. Process. Cybern. 23(8\/9), 471\u2013477 (1987)","journal-title":"J. Inf. Process. Cybern."},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1097-0037(199908)34:1","volume":"34","author":"M-S Chang","year":"1999","unstructured":"Chang, M.-S., Peng, S.-L., Liaw, J.-L.: Deferred-query: an efficient approach for some problems on interval graphs. Networks 34(1), 1\u201310 (1999). https:\/\/doi.org\/10.1002\/(SICI)1097-0037(199908)34:1","journal-title":"Networks"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/PL00009197","volume":"20","author":"SW Cheng","year":"1998","unstructured":"Cheng, S.W., Kaminski, M., Zaks, S.: Minimum dominating sets of intervals on lines. Algorithmica 20(3), 294\u2013308 (1998). https:\/\/doi.org\/10.1007\/PL00009197","journal-title":"Algorithmica"},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979). https:\/\/doi.org\/10.1287\/moor.4.3.233","journal-title":"Math. Oper. Res."},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"DG Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discrete Appl. Math. 9(1), 27\u201339 (1984). https:\/\/doi.org\/10.1016\/0166-218X(84)90088-X","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0012-365X(90)90357-N","volume":"86","author":"DG Corneil","year":"1990","unstructured":"Corneil, D.G., Stewart, L.K.: Dominating sets in perfect graphs. Discrete Math. 86(1), 145\u2013164 (1990). https:\/\/doi.org\/10.1016\/0012-365X(90)90357-N","journal-title":"Discrete Math."},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph Theory, 4th Edition, volume 173 of Graduate Texts in Mathematics. Springer, 2012. https:\/\/doi.org\/10.1007\/978-3-642-14279-6","DOI":"10.1007\/978-3-642-14279-6"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","volume":"7","author":"M Farber","year":"1984","unstructured":"Farber, M.: Domination, independent domination, and duality in strongly chordal graphs. Discrete Appl. Math. 7(2), 115\u2013130 (1984). https:\/\/doi.org\/10.1016\/0166-218X(84)90061-1","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","volume":"6","author":"M Farber","year":"1985","unstructured":"Farber, M., Keil, J.M.: Domination in permutation graphs. J. Algorithms 6(3), 309\u2013321 (1985). https:\/\/doi.org\/10.1016\/0196-6774(85)90001-X","journal-title":"J. Algorithms"},{"key":"16_CR13","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combi. Theory Ser. B 16, 47\u201356 (1974). https:\/\/doi.org\/10.1016\/0095-8956(74)90094-X","journal-title":"J. Combi. Theory Ser. B"},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","volume":"13","author":"F Gavril","year":"1975","unstructured":"Gavril, F.: A recognition algorithm for the intersection graphs of directed paths in directed trees. Discret. Math. 13(3), 237\u2013249 (1975). https:\/\/doi.org\/10.1016\/0012-365X(75)90021-7","journal-title":"Discret. Math."},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Giyora, Y., Kaplan, H.: Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. ACM Trans. Algorithms, 5(3), pp. 28:1\u201328:51, 2009. https:\/\/doi.org\/10.1145\/1541885.1541889","DOI":"10.1145\/1541885.1541889"},{"key":"16_CR17","unstructured":"Gokhale, P.: Efficient algorithms for RDV graphs. In: Master\u2019s thesis, David R.\u00a0Cheriton School of Computer Science, University of Waterloo, 2025"},{"key":"16_CR18","volume-title":"Algorithmic graph theory and perfect graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs, 1st edn. Academic Press, New York (1980)","edition":"1"},{"key":"16_CR19","doi-asserted-by":"publisher","unstructured":"Kaplan, H., Molad, E., Tarjan, R.: Dynamic rectangular intersection with priorities. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC \u201903, pp. 639\u2013648, New York (2003). Association for Computing Machinery. https:\/\/doi.org\/10.1145\/780542.780635","DOI":"10.1145\/780542.780635"},{"issue":"4","key":"16_CR20","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(93)90117-R","volume":"45","author":"Y Liang","year":"1993","unstructured":"Liang, Y., Rhee, C.: Finding a maximum matching in a circular-arc graph. Inf. Process. Lett. 45(4), 185\u2013190 (1993). https:\/\/doi.org\/10.1016\/0020-0190(93)90117-R","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"16_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"EM McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority search trees. SIAM J. Comput. 14(2), 257\u2013276 (1985). https:\/\/doi.org\/10.1137\/0214021","journal-title":"SIAM J. Comput."},{"issue":"1\u20134","key":"16_CR22","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01840386","volume":"5","author":"K Mehlhorn","year":"2023","unstructured":"Mehlhorn, K., N\u00e4her, S.: Dynamic fractional cascading. Algorithmica 5(1\u20134), 215\u2013241 (2023). https:\/\/doi.org\/10.1007\/BF01840386","journal-title":"Algorithmica"},{"issue":"2","key":"16_CR23","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","volume":"41","author":"C Monma","year":"1986","unstructured":"Monma, C., Wei, V.: Intersection graphs of paths in a tree. J. Comb. Theor. Ser. B 41(2), 141\u2013181 (1986). https:\/\/doi.org\/10.1016\/0095-8956(86)90042-0","journal-title":"J. Comb. Theor. Ser. B"},{"key":"16_CR24","doi-asserted-by":"publisher","unstructured":"Nekrich, Y.: Dynamic planar point location in optimal time. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, pp. 1003\u20131014 (2021). https:\/\/doi.org\/10.1145\/3406325.3451100","DOI":"10.1145\/3406325.3451100"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Overmars, M.H.: Range searching in a set of line segments. In: Proceedings of the First Annual Symposium on Computational Geometry, SCG \u201985, pp. 177\u2013185, New York (1985). Association for Computing Machinery. https:\/\/doi.org\/10.1145\/323233.323257","DOI":"10.1145\/323233.323257"},{"issue":"5","key":"16_CR26","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","volume":"27","author":"G Ramalingam","year":"1988","unstructured":"Ramalingam, G., Pandu Rangan, C.: A unified approach to domination problems on interval graphs. Inf. Process. Lett. 27(5), 271\u2013274 (1988). https:\/\/doi.org\/10.1016\/0020-0190(88)90091-9","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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:32Z","timestamp":1770918812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_16","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"}}]}}