{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:58Z","timestamp":1725600478998},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"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-22685-4_18","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T08:54:39Z","timestamp":1312966479000},"page":"204-212","source":"Crossref","is-referenced-by-count":3,"title":["Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees"],"prefix":"10.1007","author":[{"given":"Tanaeem M.","family":"Moosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sohel Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-73951-7_10","volume-title":"Algorithms and Data Structures","author":"M. Badent","year":"2007","unstructured":"Badent, M., Giacomo, E.D., Liotta, G.: Drawing colored graphs on colored points. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 102\u2013113. Springer, Heidelberg (2007)"},{"key":"18_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.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)"},{"key":"18_CR3","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.C. Biedl","year":"2010","unstructured":"Biedl, T.C., 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":"18_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. Comput. Geom.\u00a023(3), 303\u2013312 (2002)","journal-title":"Comput. Geom."},{"issue":"2","key":"18_CR5","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. J. Graph Algorithms Appl.\u00a010(2), 353\u2013363 (2006)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF02770864","volume":"17","author":"B. Chazelle","year":"1997","unstructured":"Chazelle, B.: Lower bounds for off-line range searching. Discrete & Computational Geometry\u00a017(1), 53\u201365 (1997)","journal-title":"Discrete & Computational Geometry"},{"key":"18_CR7","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, 407\u2013429 (1992)","journal-title":"Algorithmica"},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7155\/jgaa.00158","volume":"12","author":"E.D. Giacomo","year":"2008","unstructured":"Giacomo, E.D., Didimo, W., Liotta, G., Meijer, H., Trotta, F., Wismath, S.K.: k-colored point-set embeddability of outerplanar graphs. J. Graph Algorithms Appl.\u00a012(1), 29\u201349 (2008)","journal-title":"J. Graph Algorithms Appl."},{"issue":"5","key":"18_CR9","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1142\/S0129054106004273","volume":"17","author":"E.D. Giacomo","year":"2006","unstructured":"Giacomo, E.D., Liotta, G., Trotta, F.: On embedding a graph on two sets of points. Int. J. Found. Comput. Sci.\u00a017(5), 1071\u20131094 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR10","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"},{"key":"18_CR11","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-3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0166-218X(99)00191-2","volume":"101","author":"A. Kaneko","year":"2000","unstructured":"Kaneko, A., Kano, M.: Straight line embeddings of rooted star forests in the plane. Discrete Applied Mathematics\u00a0101(1-3), 167\u2013175 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"18_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1142\/S0218195905001671","volume":"15","author":"A. Kaneko","year":"2005","unstructured":"Kaneko, A., Kano, M.: Semi-balanced partitions of two sets of points and embeddings of rooted forests. Int. J. Comput. Geometry Appl.\u00a015(3), 229\u2013238 (2005)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"18_CR14","unstructured":"Mondal, D., Nishat, R.I., Rahman, M., Alam, J.: Minimum-area drawings of plane 3-trees. In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), pp. 191\u2013194 (2010)"},{"key":"18_CR15","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)"},{"key":"18_CR16","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 Pub. Co. Inc., Singapore (2004)"},{"issue":"4","key":"18_CR17","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"},{"issue":"3","key":"18_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0196-6774(86)90033-7","volume":"7","author":"M.S. Paterson","year":"1986","unstructured":"Paterson, M.S., Yao, F.F.: Point retrieval for polygons. Journal of Algorithms\u00a07(3), 441\u2013447 (1986)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T09:05:29Z","timestamp":1554023129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}