{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:25:58Z","timestamp":1725643558550},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_5","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T02:23:04Z","timestamp":1323915784000},"page":"39-51","source":"Crossref","is-referenced-by-count":2,"title":["Embedding Plane 3-Trees in \u211d2 and \u211d3"],"prefix":"10.1007","author":[{"given":"Stephane","family":"Durocher","sequence":"first","affiliation":[]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Rahnuma Islam","family":"Nishat","sequence":"additional","affiliation":[]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"5_CR1","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":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00002","volume":"1","author":"P. Bose","year":"1997","unstructured":"Bose, P., McAllister, M., Snoeyink, J.: Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications\u00a01(2), 1\u201315 (1997)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"2","key":"5_CR3","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"},{"doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, N., Urrutia, J.: Straight line embeddings of planar graphs on point sets. In: Proc. of CCCG, pp. 312\u2013318 (1996)","key":"5_CR4","DOI":"10.1515\/9780773591134-055"},{"issue":"5&6","key":"5_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF01758854","volume":"8","author":"B. Chazelle","year":"1992","unstructured":"Chazelle, B., Sharir, M., Welzl, E.: Quasi-optimal upper bounds for simplex range searching and new zone theorems. Algorithmica\u00a08(5&6), 407\u2013429 (1992)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Schulz, A.: Embedding stacked polytopes on a polynomial-size grid. In: Proc. of ACM-SIAM SODA, pp. 77\u201380 (2011)","key":"5_CR6","DOI":"10.1137\/1.9781611973082.89"},{"key":"5_CR7","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. Freeman, San Francisco (1979)"},{"issue":"5","key":"5_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1142\/S021819591000344X","volume":"20","author":"E.D. Giacomo","year":"2010","unstructured":"Giacomo, E.D., Didimo, W., Liotta, G., Meijer, H., Wismath, S.K.: Constrained point-set embeddability of planar graphs. International Journal of Computational Geometry and Applications\u00a020(5), 577\u2013600 (2010)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"1","key":"5_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"},{"unstructured":"Moosa, T.M., Rahman, M.S.: Improved algorithms for the point-set embeddability problem for plane 3-trees. CoRR abs\/1012.0230 (2010), http:\/\/arxiv.org\/abs\/1012.0230","key":"5_CR10"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-18469-7_29","volume-title":"Graph Drawing","author":"R.I. Nishat","year":"2011","unstructured":"Nishat, R.I., Mondal, D., Rahman, M. S.: Point-set embeddings of plane 3-trees. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 317\u2013328. Springer, Heidelberg (2011)"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J. Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs and Combinatorics\u00a017(4), 717\u2013728 (2001)","journal-title":"Graphs and Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T22:22:26Z","timestamp":1713219746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}