{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T11:45:10Z","timestamp":1747136710120},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_29","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"317-328","source":"Crossref","is-referenced-by-count":5,"title":["Point-Set Embeddings of Plane 3-Trees"],"prefix":"10.1007","author":[{"given":"Rahnuma Islam","family":"Nishat","sequence":"first","affiliation":[]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2000)"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-11805-0_30","volume-title":"Graph Drawing","author":"T. Biedl","year":"2010","unstructured":"Biedl, T., Vel\u00e1zquez, L.E.R.: Drawing planar 3-trees with given face-areas. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 316\u2013322. Springer, Heidelberg (2010)"},{"issue":"3","key":"29_CR3","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"},{"issue":"2","key":"29_CR4","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":"29_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF02712873","volume":"16","author":"T.M. Chan","year":"1996","unstructured":"Chan, T.M.: Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete & Computational Geometry\u00a016(4), 361\u2013368 (1996)","journal-title":"Discrete & Computational Geometry"},{"key":"29_CR6","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, 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.endm.2007.07.081","volume":"29","author":"A. Garc\u00eda","year":"2007","unstructured":"Garc\u00eda, A., Hurtado, F., Huemer, C., Tejel, J., Valtr, P.: On embedding triconnected cubic graphs on point sets. Electronic Notes in Discrete Mathematics\u00a029, 531\u2013538 (2007)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF02573994","volume":"11","author":"Y. Ikebe","year":"1994","unstructured":"Ikebe, Y., Perles, M.A., Tamura, A., Tokunaga, S.: The rooted tree embedding problem into points in the plane. Discrete & Computational Geometry\u00a011, 51\u201363 (1994)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M. Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. Journal of Graph Algorithms and Applications\u00a06(1), 115\u2013129 (2002)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"29_CR10","doi-asserted-by":"publisher","DOI":"10.1142\/5648","volume-title":"Planar Graph Drawing","author":"T. Nishizeki","year":"2004","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"J. Pach","year":"1991","unstructured":"Pach, J., Gritzmann, P., Mohar, B., Pollack, R.: Embedding a planar triangulation with vertices at specified points. American Mathematical Monthly\u00a098, 165\u2013166 (1991)","journal-title":"American Mathematical Monthly"},{"key":"29_CR12","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: The first annual ACM-SIAM symposium on Discrete algorithms, pp. 138\u2013148 (1990)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T04:04:49Z","timestamp":1553400289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}