{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:44:20Z","timestamp":1743133460700,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319272603"},{"type":"electronic","value":"9783319272610"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","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":[[2015]]},"DOI":"10.1007\/978-3-319-27261-0_35","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T01:24:59Z","timestamp":1448501099000},"page":"423-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Linear-Size Universal Point Sets for One-Bend Drawings"],"prefix":"10.1007","author":[{"given":"Maarten","family":"L\u00f6ffler","sequence":"first","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":[[2015,11,27]]},"reference":[{"issue":"2","key":"35_CR1","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.: Superpatterns and universal point sets. J. Graph Algorithms Appl. 18(2), 177\u2013209 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"35_CR2","unstructured":"Cardinal, J., Hoffmann, M., Kusters, V., T\u00f3th, C.D., Wettstein, M.: Arc diagrams, flip distances, and Hamiltonian triangulations. In: Mayr, E.W., Ollinger, N. (eds.) Proceedings of 32nd STACS. LiPIcs, vol. 30, pp. 197\u2013210. Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2015)"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M Chrobak","year":"1997","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Internat. J. Comput. Geom. Appl. 7, 211\u2013223 (1997)","journal-title":"Internat. J. Comput. Geom. Appl."},{"issue":"1","key":"35_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H Fraysseix de","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)","journal-title":"Combinatorica"},{"issue":"1","key":"35_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-007-9117-3","volume":"54","author":"G Battista Di","year":"2009","unstructured":"Di Battista, G., Frati, F.: Small area drawings of outerplanar graphs. Algorithmica 54(1), 25\u201353 (2009)","journal-title":"Algorithmica"},{"key":"35_CR6","first-page":"147","volume-title":"Advances in Computing Research","author":"D Dolev","year":"1984","unstructured":"Dolev, D., Leighton, F.T., Trickey, H.: Planar embedding of planar graphs. In: Preparata, F. (ed.) Advances in Computing Research, vol. 2, pp. 147\u2013161. JAI Press Inc., London (1984)"},{"issue":"1","key":"35_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.comgeo.2012.03.003","volume":"46","author":"V Dujmovi\u0107","year":"2013","unstructured":"Dujmovi\u0107, V., Evans, W., Lazard, S., Lenhart, W., Liotta, G., Rappaport, D., Wismath, S.: On point-sets that support planar graphs. Comput. Geom. Theory Appl. 46(1), 29\u201350 (2013)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"35_CR8","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/s00454-009-9149-3","volume":"43","author":"H Everett","year":"2010","unstructured":"Everett, H., Lazard, S., Liotta, G., Wismath, S.: Universal sets of \n                      \n                        \n                      \n                      $$n$$\n                     points for one-bend drawings of planar graphs with \n                      \n                        \n                      \n                      $$n$$\n                     vertices. Discrete Comput. Geom. 43(2), 272\u2013288 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"35_CR9","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight lines representation of plane graphs. Acta Scientiarum Mathematicarum (Szeged) 11, 229\u2013233 (1948)","journal-title":"Acta Scientiarum Mathematicarum (Szeged)"},{"issue":"5","key":"35_CR10","first-page":"139","volume":"12","author":"F Frati","year":"2010","unstructured":"Frati, F.: Lower bounds on the area requirements of series-parallel graphs. Discrete Math. Theoret. Comput. Sci. 12(5), 139\u2013174 (2010)","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-540-77537-9_33","volume-title":"Graph Drawing","author":"F Frati","year":"2008","unstructured":"Frati, F., Patrignani, M.: A note on minimum-area straight-line drawings of planar graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 339\u2013344. Springer, Heidelberg (2008)"},{"issue":"1","key":"35_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2004.04.002","volume":"30","author":"E Giacomo Di","year":"2005","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Curve-constrained drawings of planar graphs. Comput. Geom. Theory Appl. 30(1), 1\u201323 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"35_CR13","first-page":"247","volume-title":"Handbook of Graph Drawing and Visualization, Chap. 8","author":"E Giacomo Di","year":"2013","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G.: Spine and radial drawings. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, Chap. 8, pp. 247\u2013284. CRC Press, Boca Raton (2013)"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ipl.2004.06.009","volume":"92","author":"M Kurowski","year":"2004","unstructured":"Kurowski, M.: A 1.235 lower bound on the number of points needed to draw all \n                      \n                        \n                      \n                      $$n$$\n                    -vertex planar graphs. Inf. Process. Lett. 92, 95\u201398 (2004)","journal-title":"Inf. Process. Lett."},{"key":"35_CR15","unstructured":"Schnyder, W.: Embedding planar graphs in the grid. In: Proceedings of the 1st Symposium on Discrete Algorithms, pp. 138\u2013147. ACM Press, New York, NY (1990)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27261-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T20:12:58Z","timestamp":1569269578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}