{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:00:25Z","timestamp":1742983225764,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-60440-0_14","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"174-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universal Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Frati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"unstructured":"Alon, N., Capalbo, M.R.: Optimal universal graphs with deterministic embedding. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 373\u2013378 (2008). https:\/\/dl.acm.org\/doi\/abs\/10.5555\/1347082.1347123","key":"14_CR1"},{"doi-asserted-by":"publisher","unstructured":"Alon, N., Capalbo, M.R., Kohayakawa, Y., R\u00f6dl, V., Rucinski, A., Szemer\u00e9di, E.: Universality and tolerance. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 14\u201321 (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892007","key":"14_CR2","DOI":"10.1109\/SFCS.2000.892007"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-0208(08)73486-8","volume":"12","author":"L Babai","year":"1982","unstructured":"Babai, L., Chung, F.R.K., Erd\u0151s, P., Graham, R.L., Spencer, J.H.: On graphs which contain all sparse graphs. Ann. Discrete Math. 12, 21\u201326 (1982). https:\/\/doi.org\/10.1016\/S0304-0208(08)73486-8","journal-title":"Ann. Discrete Math."},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.7155\/jgaa.00318","volume":"18","author":"MJ Bannister","year":"2014","unstructured":"Bannister, M.J., Cheng, Z., Devanny, W.E., Eppstein, D.: Super patterns and universal point sets. J. Graph Algorithms Appl. 18(2), 177\u2013209 (2014). https:\/\/doi.org\/10.7155\/jgaa.00318","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1137\/0402014","volume":"2","author":"SN Bhatt","year":"1989","unstructured":"Bhatt, S.N., Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Universal graphs for bounded-degree trees and planar graphs. SIAM J. Discrete Math. 2(2), 145\u2013155 (1989). https:\/\/doi.org\/10.1137\/0402014","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(01)00069-4","volume":"23","author":"P Bose","year":"2002","unstructured":"Bose, P.: On embedding an outer-planar graph in a point set. Comput. Geom. 23(3), 303\u2013312 (2002). https:\/\/doi.org\/10.1016\/S0925-7721(01)00069-4","journal-title":"Comput. Geom."},{"issue":"5","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.ejc.2009.10.010","volume":"31","author":"J B\u00f6ttcher","year":"2010","unstructured":"B\u00f6ttcher, J., Pruessmann, K.P., Taraz, A., W\u00fcrfl, A.: Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. Eur. J. Comb. 31(5), 1217\u20131227 (2010). https:\/\/doi.org\/10.1016\/j.ejc.2009.10.010","journal-title":"Eur. J. Comb."},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00208-008-0268-6","volume":"343","author":"J B\u00f6ttcher","year":"2009","unstructured":"B\u00f6ttcher, J., Schacht, M., Taraz, A.: Proof of the bandwidth conjecture of Bollob\u00e1s and Koml\u00f3s. Math. Ann. 343(1), 175\u2013205 (2009). https:\/\/doi.org\/10.1007\/s00208-008-0268-6","journal-title":"Math. Ann."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s11856-011-0029-1","volume":"182","author":"B Bukh","year":"2011","unstructured":"Bukh, B., Matou\u0161ek, J., Nivasch, G.: Lower bounds for weak epsilon-nets and stair-convexity. Israel J. Math. 182, 199\u2013228 (2011). https:\/\/doi.org\/10.1007\/s11856-011-0029-1","journal-title":"Israel J. Math."},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s004930200017","volume":"22","author":"MR Capalbo","year":"2002","unstructured":"Capalbo, M.R.: Small universal graphs for bounded-degree planar graphs. Combinatorica 22(3), 345\u2013359 (2002). https:\/\/doi.org\/10.1007\/s004930200017","journal-title":"Combinatorica"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"529","DOI":"10.7155\/jgaa.00374","volume":"19","author":"J Cardinal","year":"2015","unstructured":"Cardinal, J., Hoffmann, M., Kusters, V.: On universal point sets for planar graphs. J. Graph Algorithms Appl. 19(1), 529\u2013547 (2015). https:\/\/doi.org\/10.7155\/jgaa.00374","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0095-8956(78)90072-2","volume":"24","author":"FRK Chung","year":"1978","unstructured":"Chung, F.R.K., Graham, R.L.: On graphs which contain all small trees. J. Combin. Theory Ser. B 24(1), 14\u201323 (1978). https:\/\/doi.org\/10.1016\/0095-8956(78)90072-2","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1112\/jlms\/s2-27.2.203","volume":"27","author":"FRK Chung","year":"1983","unstructured":"Chung, F.R.K., Graham, R.L.: On universal graphs for spanning trees. J. London Math. Soc. 27(2), 203\u2013211 (1983). https:\/\/doi.org\/10.1112\/jlms\/s2-27.2.203","journal-title":"J. London Math. Soc."},{"unstructured":"Frati, F., Hoffmann, M., T\u00f3th, C.D.: Universal geometric graphs. CoRR abs\/2006.11262 (2020). https:\/\/arxiv.org\/abs\/2006.11262","key":"14_CR14"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.jcss.2019.08.001","volume":"107","author":"F Frati","year":"2020","unstructured":"Frati, F., Patrignani, M., Roselli, V.: LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs. J. Comput. Syst. Sci. 107, 28\u201353 (2020). https:\/\/doi.org\/10.1016\/j.jcss.2019.08.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990). https:\/\/doi.org\/10.1007\/BF02122694","journal-title":"Combinatorica"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.jda.2014.12.005","volume":"30","author":"R Fulek","year":"2015","unstructured":"Fulek, R., T\u00f3th, C.D.: Universal point sets for planar three-trees. J. Discrete Algorithms 30, 101\u2013112 (2015). https:\/\/doi.org\/10.1016\/j.jda.2014.12.005","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P Gritzmann","year":"1991","unstructured":"Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified points. Amer. Math. Monthly 98(2), 165\u2013166 (1991)","journal-title":"Amer. Math. Monthly"},{"doi-asserted-by":"publisher","unstructured":"Kurowski, M.: A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs. Inf. Process. Lett. 92(2), 95\u201398 (2004). https:\/\/doi.org\/10.1016\/j.ipl.2004.06.009","key":"14_CR19","DOI":"10.1016\/j.ipl.2004.06.009"},{"issue":"4","key":"14_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.4064\/aa-9-4-331-340","volume":"9","author":"R Rado","year":"1964","unstructured":"Rado, R.: Universal graphs and universal functions. Acta Arithmetica 9(4), 331\u2013340 (1964). https:\/\/doi.org\/10.4064\/aa-9-4-331-340","journal-title":"Acta Arithmetica"},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"247","DOI":"10.7155\/jgaa.00529","volume":"24","author":"M Scheucher","year":"2020","unstructured":"Scheucher, M., Schrezenmaier, H., Steiner, R.: A note on universal point sets for planar graphs. J. Graph Algorithms Appl. 24(3), 247\u2013267 (2020). https:\/\/doi.org\/10.7155\/jgaa.00529","journal-title":"J. Graph Algorithms Appl."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60440-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:01:00Z","timestamp":1710266460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_14","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":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","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":"94","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":"32","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":"34% - 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.7","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":"2.1","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 held virtually due to the COVID-19 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)"}}]}}