{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:01Z","timestamp":1725558841100},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_21","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"195-205","source":"Crossref","is-referenced-by-count":15,"title":["Simultaneous Embedding of Planar Graphs with Few Bends"],"prefix":"10.1007","author":[{"given":"Cesim","family":"Erten","sequence":"first","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Brandes, U., Corman, S.R.: Visual unrolling of network evolution and the analysis of dynamic discourse. In: IEEE Symposium on Information Visualization (INFOVIS 2002), pp. 145\u2013151 (2002)","DOI":"10.1109\/INFVIS.2002.1173160"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Brass, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous graph embedding. In: 8th Workshop on Algorithms and Data Structures, pp. 243\u2013255 (2003)","DOI":"10.1007\/978-3-540-45078-8_22"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput.\u00a014, 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0196-6774(89)90012-6","volume":"10","author":"N. Chiba","year":"1989","unstructured":"Chiba, N., Nishizeki, T.: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs. Journal of Algorithms\u00a010(2), 187\u2013211 (1989)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"3","key":"21_CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7155\/jgaa.00023","volume":"4","author":"M.B. Dillencourt","year":"2000","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. Journal of Graph Algorithms and Applications\u00a04(3), 5\u201317 (2000)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: 20th Annual ACM-SIAM Symposium on Computational Geometry (SCG), pp. 340\u2013346 (2004)","DOI":"10.1145\/997817.997868"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Erten, C., Kobourov, S.G., Navabia, A., Le., V.: Simultaneous graph drawing: Layout algorithms and visualization schemes. In: 11th Symposium on Graph Drawing (GD), pp. 437\u2013449 (2003)","DOI":"10.1007\/978-3-540-24595-7_41"},{"key":"21_CR9","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight lines representation of planar graphs. Acta Scientiarum Mathematicarum\u00a011, 229\u2013233 (1948)","journal-title":"Acta Scientiarum Mathematicarum"},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. Journal of the ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"Journal of the ACM"},{"issue":"1","key":"21_CR11","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"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/PL00007219","volume":"14","author":"P. Mutzel","year":"1998","unstructured":"Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of graphs: a survey. Graphs Combin.\u00a014(1), 59\u201373 (1998)","journal-title":"Graphs Combin"},{"key":"21_CR13","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":"21_CR14","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 138\u2013148 (1990)"},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1090\/S0002-9939-1951-0041425-5","volume":"2","author":"S.K. Stein","year":"1951","unstructured":"Stein, S.K.: Convex maps. Proceedings of the American Mathematical Society\u00a02(3), 464\u2013466 (1951)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"52","key":"21_CR16","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. London Math. Society\u00a013(52), 743\u2013768 (1963)","journal-title":"Proc. London Math. Society"},{"key":"21_CR17","first-page":"26","volume":"46","author":"K. Wagner","year":"1936","unstructured":"Wagner, K.: Bemerkungen zum vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung\u00a046, 26\u201332 (1936)","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:28:15Z","timestamp":1605760095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}