{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:42:21Z","timestamp":1777596141820,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,12,2]],"date-time":"2008-12-02T00:00:00Z","timestamp":1228176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s00453-008-9255-2","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T16:16:33Z","timestamp":1228148193000},"page":"796-818","source":"Crossref","is-referenced-by-count":18,"title":["Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge"],"prefix":"10.1007","volume":"57","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Trotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,2]]},"reference":[{"key":"9255_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":"10th International Workshop on Algorithms and Data Structures","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.) 10th International Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 4619, pp. 102\u2013113. Springer, Berlin (2007). To appear in Theor. Comput. Sci."},{"key":"9255_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0164-1212(84)90006-2","volume":"4","author":"C. Batini","year":"1984","unstructured":"Batini, C., Talamo, M., Tamassia, R.: Computer aided layout of entity-relationship diagrams. J. Syst. Softw. 4, 163\u2013173 (1984)","journal-title":"J. Syst. Softw."},{"issue":"2","key":"9255_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/TVCG.2003.1196010","volume":"9","author":"U. Brandes","year":"2003","unstructured":"Brandes, U., Kenis, P., Wagner, D.: Communicating centrality in policy network drawings. IEEE Trans. Vis. Comput. Graph. 9(2), 241\u2013253 (2003)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"9255_CR4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-642-18638-7_15","volume-title":"Graph Drawing Software","author":"U. Brandes","year":"2004","unstructured":"Brandes, U., Wagner, D.: Visone\u2014analysis and visualization of social networks. In: J\u00fcnger, M., Mutzel, P. (eds.) Graph Drawing Software, pp. 321\u2013340. Springer, Berlin (2004)"},{"key":"9255_CR5","volume-title":"Graph Drawing","author":"G. Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Upper Saddle River (1999)"},{"issue":"1","key":"9255_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.7155\/jgaa.00158","volume":"12","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. 12(1), 29\u201349 (2008)","journal-title":"J. Graph Algorithms Appl."},{"key":"9255_CR7","doi-asserted-by":"crossref","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. 30, 1\u201323 (2005)","journal-title":"Comput. Geom."},{"issue":"4","key":"9255_CR8","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s00453-005-1185-7","volume":"45","author":"E. Di Giacomo","year":"2006","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Book embeddability of series-parallel digraphs. Algorithmica 45(4), 531\u2013547 (2006)","journal-title":"Algorithmica"},{"issue":"5","key":"9255_CR9","first-page":"1071","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. IJFCS 17(5), 1071\u20131094 (2006). Special Issue on Graph Drawing","journal-title":"IJFCS"},{"key":"9255_CR10","volume-title":"Evolution of Networks, From Biological Nets to the Internet and www","author":"S.N. Dorogstev","year":"2003","unstructured":"Dorogstev, S.N., Mendes, J.F.F.: Evolution of Networks, From Biological Nets to the Internet and www. Oxford University Press, Oxford (2003)"},{"key":"9255_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/VISSOF.2002.1019791","volume-title":"Proceedings of the First IEEE International Workshop on Visualizing Software for Understanding and Analysis","author":"H. Eichelberger","year":"2002","unstructured":"Eichelberger, H.: Aesthetics of class diagrams. In: Proceedings of the First IEEE International Workshop on Visualizing Software for Understanding and Analysis, pp. 23\u201331. IEEE, New York (2002)"},{"key":"9255_CR12","unstructured":"Eichelberger, H., von Gudenberg, J.W.: UML class diagrams\u2014state of the art in layout techniques. In: Proceedings of Vissoft 2003, International Workshop on Visualizing Software for Understanding and Analysis, pp. 30\u201334 (2003)"},{"issue":"3","key":"9255_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1057\/palgrave.ivs.9500078","volume":"3","author":"M. Eiglsperger","year":"2004","unstructured":"Eiglsperger, M., Gutwenger, C., Kaufmann, M., Kupke, J., J\u00fcnger, M., Leipert, S., Klein, K., Mutzel, P., Siebenhaller, M.: Automatic layout of UML class diagrams in orthogonal style. Inf. Vis. 3(3), 189\u2013208 (2004)","journal-title":"Inf. Vis."},{"issue":"3","key":"9255_CR14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1137\/S0895480195280319","volume":"12","author":"H. Enomoto","year":"1999","unstructured":"Enomoto, H., Miyauchi, M.S.: Embedding graphs into a three page book with O(mlog\u2009n) crossings of edges over the spine. SIAM J. Discrete Math. 12(3), 337\u2013341 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"9255_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-540-77120-3_17","volume-title":"18th International Symposium on Algorithms and Computation","author":"F. Giordano","year":"2007","unstructured":"Giordano, F., Liotta, G., Mchedlidze, T., Symvonis, A.: Computing upward topological book embeddings of upward planar digraphs. In: Tokuyama, T. (ed.) 18th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 4835, pp. 172\u2013183. Springer, Berlin (2007)"},{"key":"9255_CR16","doi-asserted-by":"crossref","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. Inf. Sci. 54, 219\u2013238 (1991)","journal-title":"Inf. Sci."},{"key":"9255_CR17","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/978-3-642-55566-4_25","volume-title":"Discrete & Computational Geometry","author":"A. Kaneko","year":"2003","unstructured":"Kaneko, A., Kano, M.: Discrete geometry on red and blue points in the plane\u2014a survey. In: Discrete & Computational Geometry. Algorithms and Combinatorics, vol. 25, pp. 551\u2013570. Springer, Berlin (2003)"},{"key":"9255_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. Lecture Notes in Computer Science, vol. 2025. Springer, Berlin (2001)"},{"issue":"1","key":"9255_CR19","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. J. Graph Algorithms Appl. 6(1), 115\u2013129 (2002)","journal-title":"J. Graph Algorithms Appl."},{"key":"9255_CR20","series-title":"Lecture Notes Series on Computing","volume-title":"Planar Graph Drawing","year":"2004","unstructured":"Nishizeki, T., Rahman, M.S. (eds.): Planar Graph Drawing. Lecture Notes Series on Computing, vol.\u00a012. World Scientific, Singapore (2004)"},{"key":"9255_CR21","doi-asserted-by":"crossref","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 Comb. 17, 717\u2013728 (2001)","journal-title":"Graph Comb."},{"key":"9255_CR22","series-title":"Lecture Notes in Computer Science","first-page":"248","volume-title":"Procceedings of GD \u201997","author":"H.C. Purchase","year":"1998","unstructured":"Purchase, H.C.: Which aesthetic has the greatest effect on human understanding? In: Procceedings of GD \u201997. Lecture Notes in Computer Science, vol. 1353, pp. 248\u2013261. Springer, Berlin (1998)"},{"issue":"2","key":"9255_CR23","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0953-5438(00)00032-1","volume":"13","author":"H.C. Purchase","year":"2000","unstructured":"Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interact. Comput. 13(2), 147\u2013162 (2000)","journal-title":"Interact. Comput."},{"key":"9255_CR24","series-title":"Lecture Notes in Computer Science","first-page":"252","volume-title":"Graph Drawing","author":"M. Siebenhaller","year":"2006","unstructured":"Siebenhaller, M.: Partitioned drawings. In: Kaufmann, M., Wagner, D. (eds.) Graph Drawing. Lecture Notes in Computer Science, vol. 4372, pp. 252\u2013257. Springer, Berlin (2006)"},{"key":"9255_CR25","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)"},{"issue":"1","key":"9255_CR26","doi-asserted-by":"crossref","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. Syst. Man. Cybern. 18(1), 61\u201379 (1988)","journal-title":"IEEE Trans. Syst. Man. Cybern."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9255-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9255-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9255-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:03Z","timestamp":1559137503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9255-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,2]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["9255"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9255-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,2]]}}}