{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T10:26:00Z","timestamp":1769077560542,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540775362","type":"print"},{"value":"9783540775379","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-77537-9_14","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T09:50:55Z","timestamp":1201686655000},"page":"113-124","source":"Crossref","is-referenced-by-count":2,"title":["Point-Set Embedding of Trees with Edge Constraints"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"WADS 2007","author":"M. Badent","year":"2007","unstructured":"Badent, M., Di Giacomo, E., Liotta, G.: Drawing colored graphs on colored points. In: WADS 2007. LNCS, Springer, Heidelberg (2007)"},{"key":"14_CR2","doi-asserted-by":"crossref","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 on a point set. Computational Geometry: Theory and Applications\u00a023, 303\u2013312 (2002)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"14_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00002","volume":"2","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\u00a02(1), 1\u201315 (1997)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"14_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Upper Saddle River (1999)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-540-70904-6_31","volume-title":"Graph Drawing","author":"E. Giacomo Di","year":"2007","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Trotta, F., Wismath, S.K.: k-colored point-set embeddability of outerplanar graphs. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 318\u2013329. Springer, Heidelberg (2007)"},{"issue":"5","key":"14_CR6","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1142\/S0129054106004273","volume":"17","author":"E. Giacomo Di","year":"2006","unstructured":"Di Giacomo, E., Liotta, G., Trotta, F.: On embedding a graph on two sets of points. International Journal of Foundations of Computer Science, Special Issue on Graph Drawing\u00a017(5), 1071\u20131094 (2006)","journal-title":"International Journal of Foundations of Computer Science, Special Issue on Graph Drawing"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0255(91)90052-V","volume":"54","author":"J.H. Halton","year":"1991","unstructured":"Halton, J.H.: On the thickness of graphs of given degree. Information Sciences\u00a054, 219\u2013238 (1991)","journal-title":"Information Sciences"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF02573994","volume":"11","author":"Y. Ikebe","year":"1994","unstructured":"Ikebe, Y., Perles, M., Tamura, A., Tokunaga, S.: The rooted tree embedding problem into points in the plane. Discrete Comput. Geometry\u00a011, 51\u201363 (1994)","journal-title":"Discrete Comput. Geometry"},{"key":"14_CR9","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 Appl. Mathematics\u00a0101, 167\u2013175 (2000)","journal-title":"Discrete Appl. Mathematics"},{"issue":"3","key":"14_CR10","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. Geom. Appl.\u00a015(3), 229\u2013238 (2005)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"issue":"1","key":"14_CR12","doi-asserted-by":"crossref","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":"14_CR13","series-title":"Lecture Notes Series on Computing","doi-asserted-by":"crossref","DOI":"10.1142\/5648","volume-title":"Planar Graph Drawing","author":"T. Nishizeki","year":"2004","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. Lecture Notes Series on Computing, vol.\u00a012. World Scientific, Singapore (2004)"},{"key":"14_CR14","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford Univ. Press, Oxford (1987)"},{"key":"14_CR15","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, 717\u2013728 (2001)","journal-title":"Graphs and Combinatorics"},{"issue":"5","key":"14_CR16","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1142\/S0129054106004261","volume":"17","author":"M. Patrignani","year":"2006","unstructured":"Patrignani, M.: On extending a partial straight-line drawing. International Journal of Foundations of Computer Science, Special Issue on Graph Drawing\u00a017(5), 1061\u20131069 (2006)","journal-title":"International Journal of Foundations of Computer Science, Special Issue on Graph Drawing"},{"key":"14_CR17","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1990","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction, 3rd edn. Springer, Heidelberg (1990)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77537-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T21:22:10Z","timestamp":1551388930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540775362","9783540775379"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}