{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:37:30Z","timestamp":1725817050133},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319156118"},{"type":"electronic","value":"9783319156125"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15612-5_20","type":"book-chapter","created":{"date-parts":[[2015,2,22]],"date-time":"2015-02-22T23:05:18Z","timestamp":1424646318000},"page":"222-233","source":"Crossref","is-referenced-by-count":4,"title":["Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas C.","family":"van Dijk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","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., Battista, G.D., Frati, F., Patrignani, M., Rutter, I.: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. J.\u00a0Discrete Algorithms\u00a014, 150\u2013172 (2012)","journal-title":"J.\u00a0Discrete Algorithms"},{"issue":"1","key":"20_CR2","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."},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.7155\/jgaa.00282","volume":"17","author":"E.N. Argyriou","year":"2013","unstructured":"Argyriou, E.N., Bekos, M.A., Kaufmann, M., Symvonis, A.: Geometric RAC simultaneous drawings of graphs. J. Graph Algorithms Appl.\u00a017(1), 11\u201334 (2013)","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR4","unstructured":"Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous drawing of planar graphs with right-angle crossings and few bends. Arxiv report (2014), \n                    \n                      http:\/\/arxiv.org\/abs\/1408.3325"},{"key":"20_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, ch. 11, pp. 349\u2013381. CRC Press (2013)"},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P. Brass","year":"2007","unstructured":"Brass, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D.P., Kobourov, S.G., Lubiw, A., Mitchell, J.S.: On simultaneous planar graph embeddings. Comput. Geom. Theory Appl.\u00a036(2), 117\u2013130 (2007)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0406017","volume":"6","author":"G. Brightwell","year":"1993","unstructured":"Brightwell, G., Scheinerman, E.R.: Representations of planar graphs. SIAM J. Discrete Math.\u00a06(2), 214\u2013229 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.7155\/jgaa.00218","volume":"15","author":"S. Cabello","year":"2011","unstructured":"Cabello, S., van Kreveld, M., Liotta, G., Meijer, H., Speckmann, B., Verbeek, K.: Geometric simultaneous embeddings of a graph and a matching. J. Graph Algorithms Appl.\u00a015(1), 79\u201396 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00224-005-1143-4","volume":"38","author":"C. Erten","year":"2005","unstructured":"Erten, C., Kobourov, S.G.: Simultaneous embedding of a planar graph and its dual on the grid. Theory Comput. Syst.\u00a038(3), 313\u2013327 (2005)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"20_CR10","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.\u00a0Graph Algorithms Appl.\u00a09(3), 347\u2013364 (2005)","journal-title":"J.\u00a0Graph Algorithms Appl."},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/11785293_25","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"F. Kammer","year":"2006","unstructured":"Kammer, F.: Simultaneous embedding with two bends per edge in polynomial area. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 255\u2013267. Springer, Heidelberg (2006)"},{"issue":"1","key":"20_CR12","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":"20_CR13","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"C. Nash-Williams","year":"1964","unstructured":"Nash-Williams, C.: Decomposition of finite graphs into forests. J. London Math. Soc.\u00a039, 12 (1964)","journal-title":"J. London Math. Soc."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15612-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:57:04Z","timestamp":1559109424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-15612-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319156118","9783319156125"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15612-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}