{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:53Z","timestamp":1725740513083},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_30","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T05:36:30Z","timestamp":1373520990000},"page":"341-352","source":"Crossref","is-referenced-by-count":2,"title":["Universal Point Sets for Planar Three-Trees"],"prefix":"10.1007","author":[{"given":"Radoslav","family":"Fulek","sequence":"first","affiliation":[]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-25878-7_8","volume-title":"Graph Drawing","author":"P. Angelini","year":"2011","unstructured":"Angelini, P., Di Battista, G., Kaufmann, M., Mchedlidze, T., Roselli, V., Squarcella, C.: Small point sets for simply-nested planar graphs. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 75\u201385. Springer, Heidelberg (2011)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00454-010-9310-z","volume":"45","author":"T. Biedl","year":"2011","unstructured":"Biedl, T.: Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs. Discrete Computational Geometry\u00a045, 141\u2013160 (2011)","journal-title":"Discrete Computational Geometry"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Biedl, T., Vatshelle, M.: The point-set embeddability problem for plane graphs, in. In: Proc. Symposuim on Computational Geometry, pp. 41\u201350. ACM Press (2011)","DOI":"10.1145\/2261250.2261257"},{"issue":"3","key":"30_CR4","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. Computational Geometry: Theory and Applications\u00a023(3), 303\u2013312 (2002)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.endm.2008.06.005","volume":"31","author":"F.-J. Brandenburg","year":"2008","unstructured":"Brandenburg, F.-J.: Drawing planar graphs on \n                  \n                    \n                  \n                  $\\frac{8}{9}n^2$\n                 area. Electronic Notes in Discrete Mathematics\u00a031, 37\u201340 (2008)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"30_CR6","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 Journal of Mathematics\u00a0182, 199\u2013228 (2011)","journal-title":"Israel Journal of Mathematics"},{"issue":"2","key":"30_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.7155\/jgaa.00132","volume":"10","author":"S. Cabello","year":"2006","unstructured":"Cabello, S.: Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. Journal of Graph Algorithms and Applications\u00a010(2), 353\u2013363 (2006)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"4","key":"30_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/74074.74088","volume":"20","author":"M. Chrobak","year":"1989","unstructured":"Chrobak, M., Karloff, H.J.: A lower bound on the size of universal sets for planar graphs. SIGACT News\u00a020(4), 83\u201386 (1989)","journal-title":"SIGACT News"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M. Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.: A linear time algorithm for drawing a planar graph on a grid. Information Processing Letters\u00a054, 241\u2013246 (1995)","journal-title":"Information Processing Letters"},{"issue":"1","key":"30_CR10","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\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"1","key":"30_CR11","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\u00a054(1), 25\u201353 (2009)","journal-title":"Algorithmica"},{"key":"30_CR12","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.\u00a02. JAI Press Inc., London (1984)"},{"issue":"1","key":"30_CR13","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. Computational Geometry: Theory and Applications\u00a046(1), 29\u201350 (2013)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-28076-4_16","volume-title":"WALCOM: Algorithms and Computation","author":"S. Durocher","year":"2012","unstructured":"Durocher, S., Mondal, D.: On the hardness of point-set embeddability. In: Rahman, M.S., Nakano, S.-I. (eds.) WALCOM 2012. LNCS, vol.\u00a07157, pp. 148\u2013159. Springer, Heidelberg (2012)"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-25878-7_5","volume-title":"Graph Drawing","author":"S. Durocher","year":"2011","unstructured":"Durocher, S., Mondal, D., Nishat, R.I., Rahman, M.S., Whitesides, S.: Embedding plane 3-trees in \u211d2 and \u211d3. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 39\u201351. Springer, Heidelberg (2011)"},{"issue":"2","key":"30_CR16","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 points for one-bend drawings of planar graphs with n vertices. Discrete and Computational Geometry\u00a043(2), 272\u2013288 (2010)","journal-title":"Discrete and Computational Geometry"},{"key":"30_CR17","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)\u00a011, 229\u2013233 (1948)","journal-title":"Acta Scientiarum Mathematicarum (Szeged)"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-28076-4_15","volume-title":"WALCOM: Algorithms and Computation","author":"M.. I. Hossain","year":"2012","unstructured":"Hossain, M. I., Mondal, D., Rahman, M. S., Salma, S.A.: Universal line-sets for drawing planar 3-trees. In: Rahman, M.S., Nakano, S.-I. (eds.) WALCOM 2012. LNCS, vol.\u00a07157, pp. 136\u2013147. Springer, Heidelberg (2012)"},{"issue":"5","key":"30_CR19","first-page":"139","volume":"12","author":"F. Frati","year":"2010","unstructured":"Frati, F.: Lower bounds on the area requirements of series-parallel graphs. Discrete Mathematics and Theoretical Computer Science\u00a012(5), 139\u2013174 (2010)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"30_CR20","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.\u00a04875, pp. 339\u2013344. Springer, Heidelberg (2008)"},{"key":"30_CR21","unstructured":"Fulek, R., T\u00f3th, C.D.: Universal point sets for planar three-tree, \n                  \n                    http:\/\/arxiv.org\/abs\/1212.6148"},{"key":"30_CR22","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 positions. American Mathematic Monthly\u00a098, 165\u2013166 (1991)","journal-title":"American Mathematic Monthly"},{"key":"30_CR23","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-vertex planar graphs. Information Processing Letters\u00a092, 95\u201398 (2004)","journal-title":"Information Processing Letters"},{"issue":"3","key":"30_CR24","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.comgeo.2011.09.002","volume":"45","author":"R. Nishat","year":"2012","unstructured":"Nishat, R., Mondal, D., Rahman, M.S.: Point-set embeddings of plane 3-trees. Computational Geometry: Theory and Applications\u00a045(3), 88\u201398 (2012)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"30_CR25","unstructured":"Schnyder, W.: Embedding planar graphs in the grid, in. In: Proc. 1st Symposium on Discrete Algorithms, pp. 138\u2013147. ACM Press (1990)"},{"issue":"2","key":"30_CR26","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10878-011-9381-7","volume":"24","author":"X. Zhou","year":"2012","unstructured":"Zhou, X., Hikino, T., Nishizeki, T.: Small grid drawings of planar graphs with balanced partition. Journal of Combinatorial Optimization\u00a024(2), 99\u2013115 (2012)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:32:43Z","timestamp":1557945163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}