{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:54Z","timestamp":1759639074306},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45803-7_4","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:12:53Z","timestamp":1417432373000},"page":"40-51","source":"Crossref","is-referenced-by-count":3,"title":["Drawing Simultaneously Embedded Graphs with Few Bends"],"prefix":"10.1007","author":[{"given":"Luca","family":"Grilli","sequence":"first","affiliation":[]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Di Battista, G., Frati, F., Jel\u00ednek, V., Kratochv\u00edl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. In: Discrete Algorithms (SODA 2010), pp. 202\u2013221. SIAM (2010)","DOI":"10.1137\/1.9781611973075.19"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.jda.2011.12.015","volume":"14","author":"P. Angelini","year":"2012","unstructured":"Angelini, P., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. J. Discrete Alg.\u00a014, 150\u2013172 (2012)","journal-title":"J. Discrete Alg."},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.7155\/jgaa.00250","volume":"16","author":"P. Angelini","year":"2012","unstructured":"Angelini, P., Geyer, M., Kaufmann, M., Neuwirth, D.: On a tree and a path with no geometric simultaneous embedding. J. Graph Algorithms Appl.\u00a016(1), 37\u201383 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-319-03841-4_20","volume-title":"Graph Drawing","author":"T. Bl\u00e4sius","year":"2013","unstructured":"Bl\u00e4sius, T., Karrer, A., Rutter, I.: Simultaneous embedding: Edge orderings, relative positions, cutvertices. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 220\u2013231. Springer, Heidelberg (2013)"},{"key":"4_CR5","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. CRC Press (2013)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Bl\u00e4sius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. In: Discrete Algorithms (SODA 2013), pp. 1030\u20131043. SIAM (2013)","DOI":"10.1137\/1.9781611973105.74"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"347","DOI":"10.7155\/jgaa.00113","volume":"9","author":"C. Erten","year":"2005","unstructured":"Erten, C., Kobourov, S.G.: Simultaneous embedding of planar graphs with few bends. J. Graph Algorithms Appl.\u00a09(3), 347\u2013364 (2005)","journal-title":"J. Graph Algorithms Appl."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-77537-9_28","volume-title":"Graph Drawing","author":"A. Estrella-Balderrama","year":"2008","unstructured":"Estrella-Balderrama, A., Gassner, E., J\u00fcnger, M., Percan, M., Schaefer, M., Schulz, M.: Simultaneous geometric graph embeddings. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 280\u2013290. Springer, Heidelberg (2008)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/11917496_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Gassner","year":"2006","unstructured":"Gassner, E., J\u00fcnger, M., Percan, M., Schaefer, M., Schulz, M.: Simultaneous graph embeddings with fixed edges. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 325\u2013335. Springer, Heidelberg (2006)"},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.7155\/jgaa.00289","volume":"17","author":"B. Haeupler","year":"2013","unstructured":"Haeupler, B., Jampani, K.R., Lubiw, A.: Testing simultaneous planarity when the common graph is 2-connected. J. Graph Algorithms Appl.\u00a017(3), 147\u2013171 (2013)","journal-title":"J. Graph Algorithms Appl."},{"issue":"12","key":"4_CR11","doi-asserted-by":"publisher","first-page":"2368","DOI":"10.1016\/j.dam.2007.10.012","volume":"156","author":"S.H. Hong","year":"2008","unstructured":"Hong, S.H., Nagamochi, H.: Convex drawings of graphs with non-convex boundary constraints. Discrete Appl. Math.\u00a0156(12), 2368\u20132380 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"4_CR12","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.comgeo.2012.07.005","volume":"46","author":"V. Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Kratochv\u00edl, J., Rutter, I.: A kuratowski-type theorem for planarity of partially embedded graphs. Computational Geometry Theory & Applications\u00a046(4), 466\u2013492 (2013)","journal-title":"Computational Geometry Theory & Applications"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.7155\/jgaa.00184","volume":"13","author":"M. J\u00fcnger","year":"2009","unstructured":"J\u00fcnger, M., Schulz, M.: Intersection graphs in simultaneous embedding with fixed edges. J. Graph Algorithms Appl.\u00a013(2), 205\u2013218 (2009)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(91)90050-T","volume":"53","author":"J. Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: String graphs requiring exponential representations. J. Comb. Theory, Ser. B\u00a053(1), 1\u20134 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-319-03841-4_28","volume-title":"Graph Drawing","author":"T. Mchedlidze","year":"2013","unstructured":"Mchedlidze, T., N\u00f6llenburg, M., Rutter, I.: Drawing planar graphs with a prescribed inner face. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 316\u2013327. Springer, Heidelberg (2013)"},{"key":"4_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"},{"issue":"5","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1142\/S0129054106004261","volume":"17","author":"M. Patrignani","year":"2006","unstructured":"Patrignani, M.: On extending a partial straight-line drawing. International Journal of Foundations of Computer Science\u00a017(5), 1061\u20131069 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"4","key":"4_CR18","doi-asserted-by":"publisher","first-page":"367","DOI":"10.7155\/jgaa.00298","volume":"17","author":"M. Schaefer","year":"2013","unstructured":"Schaefer, M.: Toward a theory of planarity: Hanani-tutte and planarity variants. J. Graph Algorithms Appl.\u00a017(4), 367\u2013440 (2013)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"s3-13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. London Math. Soc.\u00a0s3-13(1), 743\u2013767 (1963)","journal-title":"London Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T20:58:30Z","timestamp":1559077110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}