{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:45Z","timestamp":1725512025902},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709039"},{"type":"electronic","value":"9783540709046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70904-6_31","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T11:44:43Z","timestamp":1179402283000},"page":"318-329","source":"Crossref","is-referenced-by-count":4,"title":["k-Colored Point-Set Embeddability of Outerplanar Graphs"],"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":"Francesco","family":"Trotta","sequence":"additional","affiliation":[]},{"given":"Stephen K.","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","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":"31_CR2","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":"31_CR3","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":"31_CR4","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Trotta, F., Wismath, S.K.: k-colored point-set embeddability of outerplanar graphs. Technical Report RT-002-06, Dip. di Ingegneria Elettronica e dell\u2019Informazione, Univ. of Perugia (2006)","DOI":"10.1007\/978-3-540-70904-6_31"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E., Liotta, G., Trotta, F.: On embedding a graph on two sets of points. IJFCS, Special Issue on Graph Drawing 2005 (to appear, 2005)","DOI":"10.1007\/11618058_11"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11618058_11","volume-title":"Graph Drawing","author":"E. Giacomo Di","year":"2006","unstructured":"Di Giacomo, E., Liotta, G., Trotta, F.: How to embed a path onto two sets of points. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 111\u2013116. Springer, Heidelberg (2006)"},{"issue":"2","key":"31_CR7","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 points. Am. Math. Month.\u00a098(2), 165\u2013166 (1991)","journal-title":"Am. Math. Month."},{"key":"31_CR8","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":"31_CR9","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":"31_CR10","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":"31_CR11","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. Graph and Combinatorics\u00a017, 717\u2013728 (2001)","journal-title":"Graph and Combinatorics"},{"key":"31_CR12","doi-asserted-by":"crossref","DOI":"10.1142\/4902","volume-title":"Graph Drawing and Applications for Software and Knowledge Engineers","author":"K. Sugiyama","year":"2002","unstructured":"Sugiyama, K.: Graph Drawing and Applications for Software and Knowledge Engineers. Word Scientific, Singapore (2002)"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"Tamassia, R., Di Battista, G., Batini, C.: Automatic graph drawing and readability of diagrams. IEEE Trans. Sys., Man, and Cyber (SMC)\u00a018, 61\u201379 (1988)","journal-title":"IEEE Trans. Sys., Man, and Cyber. (SMC)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:18:32Z","timestamp":1556410712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709039","9783540709046"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}