{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:01:10Z","timestamp":1725897670275},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322402"},{"type":"electronic","value":"9783642322419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32241-9_25","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T15:12:12Z","timestamp":1344870732000},"page":"287-298","source":"Crossref","is-referenced-by-count":2,"title":["Geometric RAC Simultaneous Drawings of Graphs"],"prefix":"10.1007","author":[{"given":"Evmorfia","family":"Argyriou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Bekos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7155\/jgaa.00217","volume":"15","author":"P. Angelini","year":"2011","unstructured":"Angelini, P., Cittadini, L., Di Battista, G., Didimo, W., Frati, F., Kaufmann, M., Symvonis, A.: On the perspectives opened by right angle crossing drawings. JGAA\u00a015(1), 53\u201378 (2011)","journal-title":"JGAA"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-18469-7_4","volume-title":"Graph Drawing","author":"P. Angelini","year":"2011","unstructured":"Angelini, P., Geyer, M., Kaufmann, M., Neuwirth, D.: On a Tree and a Path with No Geometric Simultaneous Embedding. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 38\u201349. Springer, Heidelberg (2011)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-18381-2_6","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"E.N. Argyriou","year":"2011","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: The Straight-Line RAC Drawing Problem Is NP-Hard. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 74\u201385. Springer, Heidelberg (2011)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-16926-7_14","volume-title":"Graph Theoretic Concepts in Computer Science","author":"K. Arikushi","year":"2010","unstructured":"Arikushi, K., Fulek, R., Keszegh, B., Mori\u0107, F., T\u00f3th, C.D.: Graphs that Admit Right Angle Crossing Drawings. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 135\u2013146. Springer, Heidelberg (2010)"},{"issue":"2","key":"25_CR5","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., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Computational Geometry: Theory and Applications\u00a036(2), 117\u2013130 (2007)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"2","key":"25_CR6","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 Journal Discrete Mathematics\u00a06(2), 214\u2013229 (1993)","journal-title":"SIAM Journal Discrete Mathematics"},{"issue":"1","key":"25_CR7","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.J., Liotta, G., Meijer, H., Speckmann, B., Verbeek, K.: Geometric simultaneous embeddings of a graph and a matching. JGAA\u00a015(1), 79\u201396 (2011)","journal-title":"JGAA"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-11805-0_4","volume-title":"Graph Drawing","author":"E. Di Giacomo","year":"2010","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 15\u201320. Springer, Heidelberg (2010)"},{"issue":"16","key":"25_CR9","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.ipl.2010.05.023","volume":"110","author":"W. Didimo","year":"2010","unstructured":"Didimo, W., Eades, P., Liotta, G.: A characterization of complete bipartite graphs. Information Processing Letters\u00a0110(16), 687\u2013691 (2010)","journal-title":"Information Processing Letters"},{"issue":"39","key":"25_CR10","doi-asserted-by":"publisher","first-page":"5156","DOI":"10.1016\/j.tcs.2011.05.025","volume":"412","author":"W. Didimo","year":"2011","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theor. Comp. Sci.\u00a0412(39), 5156\u20135166 (2011)","journal-title":"Theor. Comp. Sci."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Eades, P., Liotta, G.: Right angle crossing graphs and 1-planarity. In: 27th European Workshop on Computational Geometry (2011)","DOI":"10.1007\/978-3-642-25878-7_15"},{"issue":"3","key":"25_CR12","first-page":"313","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 Computing\u00a038(3), 313\u2013327 (2005)","journal-title":"Theory Computing"},{"issue":"3","key":"25_CR13","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. JGAA\u00a09(3), 347\u2013364 (2005)","journal-title":"JGAA"},{"key":"25_CR14","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)"},{"issue":"3","key":"25_CR15","doi-asserted-by":"publisher","first-page":"447","DOI":"10.7155\/jgaa.00194","volume":"13","author":"F. Frati","year":"2009","unstructured":"Frati, F., Kaufmann, M., Kobourov, S.G.: Constrained simultaneous and near-simultaneous embeddings. JGAA\u00a013(3), 447\u2013465 (2009)","journal-title":"JGAA"},{"issue":"7","key":"25_CR16","doi-asserted-by":"publisher","first-page":"1909","DOI":"10.1016\/j.disc.2008.01.033","volume":"309","author":"M. Geyer","year":"2009","unstructured":"Geyer, M., Kaufmann, M., Vrto, I.: Two trees which are self-intersecting when drawn simultaneously. Discrete Mathematics\u00a0309(7), 1909\u20131916 (2009)","journal-title":"Discrete Mathematics"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: IEEE Pacific Visualization Symp., pp. 41\u201346. IEEE (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-642-18469-7_34","volume-title":"Graph Drawing","author":"M. Kreveld van","year":"2011","unstructured":"van Kreveld, M.: The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 371\u2013376. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32241-9_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:58:51Z","timestamp":1620129531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32241-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322402","9783642322419"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32241-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}