{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:46Z","timestamp":1725502066213},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-77537-9_31","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T09:50:55Z","timestamp":1201686655000},"page":"315-326","source":"Crossref","is-referenced-by-count":1,"title":["Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Trotta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/978-3-540-73951-7_10","volume-title":"WADS","author":"M. Badent","year":"2007","unstructured":"Badent, M., Di Giacomo, E., Liotta, G.: Drawing colored graphs on colored points. In: Dehne, F.K.H.A., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 102\u2013113. Springer, Heidelberg (2007)"},{"key":"31_CR2","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, NJ (1999)"},{"key":"31_CR3","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)"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2004.04.002","volume":"30","author":"E. Giacomo Di","year":"2005","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Curve-constrained drawings of planar graphs. Computational Geometry\u00a030, 1\u201323 (2005)","journal-title":"Computational Geometry"},{"issue":"5","key":"31_CR5","first-page":"1071","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. IJFCS, Special Issue on Graph Drawing\u00a017(5), 1071\u20131094 (2006)","journal-title":"IJFCS, Special Issue on Graph Drawing"},{"key":"31_CR6","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/978-3-642-55566-4_25","volume-title":"Discrete & Computational Geometry, Algorithms and Combinatories","author":"A. Kaneko","year":"2003","unstructured":"Kaneko, A., Kano, M.: Discrete geometry on red and blue points in the plane - a survey. In: Discrete & Computational Geometry, Algorithms and Combinatories, vol.\u00a025, pp. 551\u2013570. Springer, Heidelberg (2003)"},{"key":"31_CR7","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_CR8","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_CR9","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"}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T21:25:28Z","timestamp":1551389128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540775362","9783540775379"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}