{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:03:57Z","timestamp":1725807837252},"publisher-location":"Cham","reference-count":13,"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_5","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T06:12:53Z","timestamp":1417414373000},"page":"52-63","source":"Crossref","is-referenced-by-count":1,"title":["Planar and Quasi Planar Simultaneous Geometric Embedding"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.jcta.2006.08.002","volume":"114","author":"E. Ackerman","year":"2007","unstructured":"Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. of Combinatorial Theory, Series A\u00a0114(3), 563\u2013571 (2007)","journal-title":"J. of Combinatorial Theory, Series A"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica\u00a017(1), 1\u20139 (1997)","journal-title":"Combinatorica"},{"issue":"1","key":"5_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. of Graph Algorithms and Applications\u00a016(1), 37\u201383 (2012)","journal-title":"J. of Graph Algorithms and Applications"},{"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 (2014)","key":"5_CR4"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-540-45078-8_22","volume-title":"Algorithms and Data Structures","author":"P. Brass","year":"2003","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. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 243\u2013255. Springer, Heidelberg (2003)"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P. Bra\u00df","year":"2007","unstructured":"Bra\u00df, 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. Comput. Geom.\u00a036(2), 117\u2013130 (2007)","journal-title":"Comput. Geom."},{"issue":"1","key":"5_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. J. Graph Algorithms and Applications\u00a015(1), 79\u201396 (2011)","journal-title":"J. Graph Algorithms and Applications"},{"issue":"16","key":"5_CR8","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.ipl.2012.05.006","volume":"112","author":"W. Didimo","year":"2012","unstructured":"Didimo, W., Kaufmann, M., Liotta, G., Okamoto, Y., Spillner, A.: Vertex angle and crossing angle resolution of leveled tree drawings. Inform. Process. Lett.\u00a0112(16), 630\u2013635 (2012)","journal-title":"Inform. Process. Lett."},{"issue":"6-7","key":"5_CR9","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1016\/j.comgeo.2008.12.006","volume":"42","author":"A. Estrella-Balderrama","year":"2009","unstructured":"Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: Characterization of unlabeled level planar trees. Computational Geometry\u00a042(6-7), 704\u2013721 (2009)","journal-title":"Computational Geometry"},{"key":"5_CR10","series-title":"LNCS","first-page":"259","volume-title":"GD 2014","author":"W. Evans","year":"2014","unstructured":"Evans, W., Kusters, V., Saumell, M., Speckmann, B.: Column planarity and partial simultaneous geometric embedding. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol.\u00a08871, pp. 259\u2013271. Springer, Heidelberg (2014)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-77537-9_7","volume-title":"Graph Drawing","author":"J.J. Fowler","year":"2008","unstructured":"Fowler, J.J., Kobourov, S.G.: Characterization of unlabeled level planar graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 37\u201349. Springer, Heidelberg (2008)"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/110858586","volume":"27","author":"J. Fox","year":"2013","unstructured":"Fox, J., Pach, J., Suk, A.: The number of edges in k-quasi-planar graphs. SIAM J. on Discrete Mathematics\u00a027(1), 550\u2013561 (2013)","journal-title":"SIAM J. on Discrete Mathematics"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/PL00009364","volume":"19","author":"P. Valtr","year":"1998","unstructured":"Valtr, P.: On geometric graphs with no k pairwise parallel edges. Discrete & Computational Geometry\u00a019(3), 461\u2013469 (1998)","journal-title":"Discrete & Computational Geometry"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T17:08:17Z","timestamp":1559063297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}