{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:05:37Z","timestamp":1743156337346,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"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_9","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"115-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Disk Graphs"],"prefix":"10.1007","author":[{"given":"\u00cdvar Marrow","family":"Arn\u00fe\u00f3rsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Chaplick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6kull Sn\u00e6r","family":"Gylfason","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6kull M\u00e1ni","family":"Reynisson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tigran","family":"Tonoyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0925-7721(95)00005-8","volume":"5","author":"PK Agarwal","year":"1995","unstructured":"Agarwal, P.K., Katz, M.J., Sharir, M.: Computing depth orders for fat objects and related problems. Comput. Geom. 5(4), 187\u2013206 (1995)","journal-title":"Comput. Geom."},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/BF01758853","volume":"8","author":"H Alt","year":"1992","unstructured":"Alt, H., et al.: Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. Algorithmica 8(1), 391\u2013406 (1992)","journal-title":"Algorithmica"},{"key":"9_CR3","unstructured":"Aronov, B., Bar-On, G., Katz, M.J.: Resolving SINR queries in a dynamic setting. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.), 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, 9\u201313 July 2018, Prague, Czech Republic, volume 107 of LIPIcs, pp. 145:1\u2013145:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"9_CR4","unstructured":"\u00c1sgeirsson, E.I., Halld\u00f3rsson, M.M., Tonoyan, T.: Universal framework for wireless scheduling problems. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, 10\u201314 July 2017, Warsaw, Poland, pp. 129:1\u2013129:15 (2017)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.dam.2015.08.019","volume":"216","author":"D Catanzaro","year":"2017","unstructured":"Catanzaro, D., et al.: Max point-tolerance graphs. Discret. Appl. Math. 216, 84\u201397 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/S0196-6774(02)00294-8","volume":"46","author":"TM Chan","year":"2003","unstructured":"Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms 46(2), 178\u2013189 (2003)","journal-title":"J. Algorithms"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00454-012-9417-5","volume":"48","author":"TM Chan","year":"2012","unstructured":"Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. Discret. Comput. Geom. 48(2), 373\u2013392 (2012)","journal-title":"Discret. Comput. Geom."},{"issue":"1\u20133","key":"9_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discret. Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discret. Math."},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0925-7721(99)00059-0","volume":"15","author":"A Efrat","year":"2000","unstructured":"Efrat, A., Katz, M.J., Nielsen, F., Sharir, M.: Dynamic data structures for fat objects and their applications. Comput. Geom. 15(4), 215\u2013227 (2000)","journal-title":"Comput. Geom."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/11671541_5","volume-title":"Efficient Approximation and Online Algorithms","author":"T Erlebach","year":"2006","unstructured":"Erlebach, T., Fiala, J.: Independence and coloring problems on intersection graphs of disks. In: Bampis, E., Jansen, K., Kenyon, C. (eds.) Efficient Approximation and Online Algorithms. LNCS, vol. 3484, pp. 135\u2013155. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/11671541_5"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM J. Comput. 34, 1302\u20131323 (2005)","journal-title":"SIAM J. Comput."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Halldorsson, M.M., Tonoyan, T.: How well can graphs represent wireless interference? In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing. STOC 2015, pp. 635\u2013644. Association for Computing Machinery, New York, NY, USA (2015)","DOI":"10.1145\/2746539.2746585"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(99)00231-9","volume":"215","author":"RE Jamison","year":"2000","unstructured":"Jamison, R.E., Mulder, H.M.: Tolerance intersection graphs on binary trees with constant tolerance 3. Discret. Math. 215(1), 115\u2013131 (2000)","journal-title":"Discret. Math."},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/s00453-012-9671-1","volume":"68","author":"F Kammer","year":"2012","unstructured":"Kammer, F., Tholey, T.: Approximation algorithms for intersection graphs. Algorithmica 68(2), 312\u2013336 (2012)","journal-title":"Algorithmica"},{"issue":"5","key":"9_CR16","doi-asserted-by":"publisher","first-page":"37:1","DOI":"10.1145\/2807693","volume":"62","author":"E Kantor","year":"2015","unstructured":"Kantor, E., Lotker, Z., Parter, M., Peleg, D.: The topology of wireless communication. J. ACM 62(5), 37:1-37:32 (2015)","journal-title":"J. ACM"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.comgeo.2016.05.001","volume":"60","author":"JM Keil","year":"2017","unstructured":"Keil, J.M., Mitchell, J.S.B., Pradhan, D., Vatshelle, M.: An algorithm for the maximum weight independent set problem on outerstring graphs. Comput. Geom. 60, 19\u201325 (2017). The Twenty-Seventh Canadian Conference on Computational Geometry August 2015","journal-title":"Comput. Geom."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J.: String graphs. I. The number of critical nonstring graphs is infinite. J. Comb. Theory, Ser. B 52(1), 53\u201366 (1991)","DOI":"10.1016\/0095-8956(91)90090-7"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: INFOCOM, pp. 1\u201313. IEEE (2006)","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Paul, S.: On characterizing proper-max-point tolerance graphs (2020)","DOI":"10.1016\/j.akcej.2020.01.003"},{"issue":"1","key":"9_CR21","first-page":"169","volume":"17","author":"M Soto","year":"2015","unstructured":"Soto, M., Caro, C.T.: p-BOX: a new graph model. Discret. Math. Theor. Comput. Sci. 17(1), 169\u2013186 (2015)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"issue":"4","key":"9_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0925-7721(96)00016-8","volume":"9","author":"M van Kreveld","year":"1998","unstructured":"van Kreveld, M.: On fat partitioning, fat covering and the union size of polygons. Comput. Geom. 9(4), 197\u2013210 (1998)","journal-title":"Comput. Geom."},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2151171.2151177","volume":"8","author":"Y Ye","year":"2012","unstructured":"Ye, Y., Borodin, A.: Elimination graphs. ACM Trans. Algorithms 8, 2 (2012)","journal-title":"ACM Trans. Algorithms"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:25:54Z","timestamp":1645183554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_9","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)"}}]}}