{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:44:54Z","timestamp":1743111894509,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_6","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"71-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reachability Problems for Transmission Graphs"],"prefix":"10.1007","author":[{"given":"Shinwoo","family":"An","sequence":"first","affiliation":[]},{"given":"Eunjin","family":"Oh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Afshani, P., Chan, T.: Optimal halfspace range reporting in three dimensions. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pp. 180\u2013186 (2009)","DOI":"10.1137\/1.9781611973068.21"},{"key":"6_CR2","unstructured":"Ashur, S., Carmi, P.: t-Spanners for transmission graphs using the path-greedy algorithm. In: 36th European Workshop on Computational Geometry (EuroCG 2020), Book of Abstracts, pp. 60:1\u201360:6 (2020)"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.comgeo.2014.12.003","volume":"48","author":"S Cabello","year":"2015","unstructured":"Cabello, S., Jej\u010di\u010d, M.: Shortest paths in intersection graphs of unit disks. Comput. Geom. 48(4), 360\u2013367 (2015)","journal-title":"Comput. Geom."},{"key":"6_CR4","unstructured":"Chan, T.M.: Dynamic geometric data structures via shallow cuttings. In: Proceedings of the 35th International Symposium on Computational Geometry (SoCG 2019), pp. 24:1\u201324:13 (2019)"},{"issue":"2","key":"6_CR5","first-page":"3","volume":"10","author":"TM Chan","year":"2019","unstructured":"Chan, T.M., Skrepetos, D.: Approximate shortest paths and distance oracles in weighted unit-disk graphs. J. Comput. Geom. 10(2), 3\u201320 (2019)","journal-title":"J. Comput. Geom."},{"key":"6_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1016\/j.aim.2008.06.002","volume":"219","author":"J Fox","year":"2008","unstructured":"Fox, J., Pach, J.: Separator theorems and tur\u00e1n-type results for planar intersection graphs. Adv. Math. 219(3), 1070\u20131080 (2008)","journal-title":"Adv. Math."},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1328911.1328921","volume":"4","author":"J Gudmundsson","year":"2008","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G., Smid, M.: Approximate distance oracles for geometric spanners. ACM Trans. Algorithms 4(1), 1\u201334 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Holm, J., Rotenberg, E., Thorup, M.: Planar reachability in linear space and constant time. In: Proceedings of the 56th Annual Symposium on Foundations of Computer Science (FOCS 2015), pp. 370\u2013389 (2015)","DOI":"10.1109\/FOCS.2015.30"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/0214006","volume":"14","author":"H Imai","year":"1985","unstructured":"Imai, H., Iri, M., Murota, K.: Voronoi diagram in the Laguerre geometry and its applications. SIAM J. Comput. 14(1), 93\u2013105 (1985)","journal-title":"SIAM J. Comput."},{"key":"6_CR11","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P.: Spanners and reachability oracles for directed transmission graphs. In; Proceedings of the 31st International Symposium on Computational Geometry (SoCG 2015), pp. 156\u2013170 (2015)"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1007\/s00453-017-0308-2","volume":"80","author":"H Kaplan","year":"2018","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P.: Routing in unit disk graphs. Algorithmica 80(3), 830\u2013848 (2018)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1137\/16M1059692","volume":"47","author":"H Kaplan","year":"2018","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P.: Spanners for directed transmission graphs. SIAM J. Comput. 47(4), 1585\u20131609 (2018)","journal-title":"SIAM J. Comput."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P., Sharir, M.: Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pp. 2495\u20132504 (2017)","DOI":"10.1137\/1.9781611974782.165"},{"key":"6_CR15","unstructured":"Miller, G., Teng, S.-H., Varasis, S.: A unified geometric approach to graph separators. In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS 1991), pp. 538\u2013547 (1991)"},{"key":"6_CR16","unstructured":"Moidu, N., Agarwal, J., Kothapalli, K.: Planar convex hull range query and related problems. In: Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013) (2013)"},{"key":"6_CR17","unstructured":"Oh, E.: Shortest-path queries in geometric networks. In: Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020), pp. 52:1\u201352:15 (2020)"},{"issue":"3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1807048.1807054","volume":"7","author":"D Peleg","year":"2010","unstructured":"Peleg, D., Roditty, L.: Localized spanner construction for ad hoc networks with variable transmission range. ACM Trans. Sens. Netw. 7(3), 1\u201314 (2010)","journal-title":"ACM Trans. Sens. Netw."},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/s00453-011-9580-8","volume":"65","author":"D Peleg","year":"2013","unstructured":"Peleg, D., Roditty, L.: Relaxed spanners for directed disk graphs. Algorithmica 65(1), 146\u2013158 (2013)","journal-title":"Algorithmica"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TNET.2008.926506","volume":"17","author":"P Von Rickenbach","year":"2009","unstructured":"Von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Algorithmic models of interference in wireless ad hoc and sensor networks. IEEE\/ACM Trans. Network. 17(1), 172\u2013185 (2009)","journal-title":"IEEE\/ACM Trans. Network."},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1007\/s00454-020-00219-7","volume":"64","author":"H Wang","year":"2020","unstructured":"Wang, H., Xue, J.: Near-optimal algorithms for shortest paths in weighted unit-disk graphs. Discrete Comput. Geom. 64(4), 1141\u20131166 (2020)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:25:23Z","timestamp":1645183523000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"123","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}