{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:24:04Z","timestamp":1725524644313},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_35","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"360-371","source":"Crossref","is-referenced-by-count":1,"title":["Constrained Point-Set Embeddability of Planar 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":"Stephen","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-3","key":"35_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2008.08.004","volume":"408","author":"M. Badent","year":"2008","unstructured":"Badent, M., Di Giacomo, E., Liotta, G.: Drawing colored graphs on colored points. Theoret. Comput. Sci.\u00a0408(2-3), 129\u2013142 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR2","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 on a point set. Comput. Geom. Theory Appl.\u00a023, 303\u2013312 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"35_CR3","doi-asserted-by":"publisher","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. J. Graph Algorithms Appl.\u00a02(1), 1\u201315 (1997)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"35_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7155\/jgaa.00158","volume":"11","author":"E. Di Giacomo","year":"2008","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Trotta, F., Wismath, S.K.: k-colored point-set embeddability of outerplanar graphs. J. Graph Algorithms Appl.\u00a011(1), 29\u201349 (2008)","journal-title":"J. Graph Algorithms Appl."},{"issue":"5","key":"35_CR5","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1142\/S0129054106004273","volume":"17","author":"E. Di Giacomo","year":"2006","unstructured":"Di Giacomo, E., Liotta, G., Trotta, F.: On embedding a graph on two sets of points. Internat. J. Found. Comput. Sci.\u00a017(5), 1071\u20131094 (2006)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-77537-9_14","volume-title":"Graph Drawing","author":"E. Giacomo Di","year":"2008","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Wismath, S.K.: Point-set embeddings of trees with edge constraints. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 113\u2013124. Springer, Heidelberg (2008)"},{"issue":"1","key":"35_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2004.04.002","volume":"30","author":"E. Di Giacomo","year":"2005","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Curve-constrained drawings of planar graphs. Comput. Geom. Theory Appl.\u00a030(1), 1\u201323 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-77537-9_31","volume-title":"Graph Drawing","author":"E. Di Giacomo","year":"2008","unstructured":"Di Giacomo, E., Liotta, G., Trotta, F.: Drawing colored graphs with constrained vertex positions and few bends per edge. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 315\u2013326. Springer, Heidelberg (2008)"},{"issue":"2","key":"35_CR9","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. Amer. Math. Monthly\u00a098(2), 165\u2013166 (1991)","journal-title":"Amer. Math. Monthly"},{"key":"35_CR10","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. Inform. Sci.\u00a054, 219\u2013238 (1991)","journal-title":"Inform. Sci."},{"key":"35_CR11","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. Geom.\u00a011, 51\u201363 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"35_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 Appl. Math.\u00a0101, 167\u2013175 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"35_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. Internat. J. Comput. Geom. Appl.\u00a015(3), 229\u2013238 (2005)","journal-title":"Internat. J. Comput. Geom. Appl."},{"issue":"1","key":"35_CR14","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. J. Graph Algorithms Appl.\u00a06(1), 115\u2013129 (2002)","journal-title":"J. Graph Algorithms Appl."},{"key":"35_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1090\/dimacs\/009\/11","volume":"9","author":"J. Pach","year":"1993","unstructured":"Pach, J., T\u00f6r\u0151csik, J.: Layout of rooted trees. DIMACS Series in Discrete Math. and Theoretical Comput. Sci.\u00a09, 131\u2013137 (1993)","journal-title":"DIMACS Series in Discrete Math. and Theoretical Comput. Sci."},{"key":"35_CR16","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"},{"key":"35_CR17","doi-asserted-by":"publisher","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. World Scientific, Singapore (2002)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T00:12:29Z","timestamp":1551744749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}