{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:41:35Z","timestamp":1742913695258,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_13","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"184-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Embeddability of Unit Disk Graphs onto Straight Lines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4785-7496","authenticated-orcid":false,"given":"Onur","family":"\u00c7a\u011f\u0131r\u0131c\u0131","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jalgor.2003.10.001","volume":"52","author":"J Alber","year":"2004","unstructured":"Alber, J., Fiala, J.: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms 52(2), 134\u2013151 (2004)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Alomari, A., Aslam, N., Phillips, W., Comeau, F.: Three-dimensional path planning model for mobile anchor-assisted localization in Wireless Sensor Networks. In: 30th IEEE Canadian Conference on Electrical and Computer Engineering, CCECE, pp. 1\u20135 (2017)","key":"13_CR2","DOI":"10.1109\/CCECE.2017.7946681"},{"issue":"12","key":"13_CR3","doi-asserted-by":"publisher","first-page":"1663","DOI":"10.1109\/TMC.2006.174","volume":"5","author":"J Aspnes","year":"2006","unstructured":"Aspnes, J., et al.: A theory of network localization. IEEE Trans. Mob. Comput. 5(12), 1663\u20131678 (2006)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"2832","DOI":"10.1007\/978-0-387-74759-0","volume-title":"Encyclopedia of Optimization","author":"B Balasundaram","year":"2009","unstructured":"Balasundaram, B., Butenko, S.: Optimization problems in unit-disk graphs. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, pp. 2832\u20132844. Springer, Boston (2009). \nhttps:\/\/doi.org\/10.1007\/978-0-387-74759-0"},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","volume":"25","author":"SN Bhatt","year":"1987","unstructured":"Bhatt, S.N., Cosmadakis, S.S.: The complexity of minimizing wire lengths in VLSI layouts. Inf. Process. Lett. 25(4), 263\u2013267 (1987)","journal-title":"Inf. Process. Lett."},{"unstructured":"Bonnet, \u00c9., Giannopoulos, P., Kim, E.J., Rz\u0105\u017cewski, P., Sikora, F.: QPTAS and subexponential algorithm for maximum clique on disk graphs. In: Speckmann, B., T\u00f3th, C.D. (eds.) 34th International Symposium on Computational Geometry, SoCG. LIPIcs, vol. 99, pp. 12:1\u201312:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)","key":"13_CR6"},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Breu, H.: Algorithmic aspects of constrained unit disk graphs. Ph.D. thesis, University of British Columbia (1996)","key":"13_CR8"},{"issue":"1\u20132","key":"13_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. 9(1\u20132), 3\u201324 (1998)","journal-title":"Comput. Geom."},{"unstructured":"\u00c7a\u011f\u0131r\u0131c\u0131, O.: Exploiting coplanar clusters to enhance 3D localization in wireless sensor networks. Master\u2019s thesis, Izmir University of Economics (2015). \nhttp:\/\/arxiv.org\/abs\/1502.07790","key":"13_CR10"},{"issue":"1\u20133","key":"13_CR11","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. Discrete Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11669463_14","volume-title":"Wireless Sensor Networks","author":"B Dil","year":"2006","unstructured":"Dil, B., Dulman, S., Havinga, P.: Range-based localization in mobile sensor networks. In: R\u00f6mer, K., Karl, H., Mattern, F. (eds.) EWSN 2006. LNCS, vol. 3868, pp. 164\u2013179. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11669463_14"},{"unstructured":"Evans, W., van Garderen, M., L\u00f6ffler, M., Polishchuk, V.: Recognizing a DOG is hard, but not when it is thin and unit. In: Demaine, E.D., Grandoni, F. (eds.) 8th International Conference on Fun with Algorithms, FUN. LIPIcs, vol. 49, pp. 16:1\u201316:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)","key":"13_CR13"},{"key":"13_CR14","volume-title":"Interval Orders and Interval Graphs \u2013 A Study on Partially Ordered Sets","author":"PC Fishburn","year":"1985","unstructured":"Fishburn, P.C.: Interval Orders and Interval Graphs \u2013 A Study on Partially Ordered Sets. Wiley, Hoboken (1985)"},{"unstructured":"Ito, H., Kadoshita, M.: Tractability and intractability of problems on unit disk graphs parameterized by domain area. In: Zhang, X.S., Liu, D.G., Wu, L.Y., Wang, Y. (eds.) Operations Research and Its Applications, 9th International Symposium, ISORA. Lecture Notes in Operations Research, vol. 12, pp. 120\u2013127 (2010)","key":"13_CR15"},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s00454-012-9394-8","volume":"47","author":"RJ Kang","year":"2012","unstructured":"Kang, R.J., M\u00fcller, T.: Sphere and dot product representations of graphs. Discrete Comput. Geom. 47(3), 548\u2013568 (2012). \nhttps:\/\/doi.org\/10.1007\/s00454-012-9394-8","journal-title":"Discrete Comput. Geom."},{"doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Unit disk graph approximation. In: Basagni, S., Phillips, C.A. (eds.) Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, pp. 17\u201323. ACM (2004)","key":"13_CR17","DOI":"10.1145\/1022630.1022634"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jctb.2012.09.004","volume":"103","author":"C McDiarmid","year":"2013","unstructured":"McDiarmid, C., M\u00fcller, T.: Integer realizations of disk and segment graphs. J. Comb. Theory Ser. B 103(1), 114\u2013143 (2013)","journal-title":"J. Comb. Theory Ser. B"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.comnet.2017.08.023","volume":"127","author":"MF Neto","year":"2017","unstructured":"Neto, M.F., Goussevskaia, O., dos Santos, V.F.: Connectivity with backbone structures in obstructed wireless networks. Comput. Netw. 127, 266\u2013281 (2017)","journal-title":"Comput. Netw."},{"doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A.V. (eds.) Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC, pp. 216\u2013226. ACM (1978)","key":"13_CR20","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:05:51Z","timestamp":1592780751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","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":"49","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":"25","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":"51% - 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","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":"7","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)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}