{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:30Z","timestamp":1725761130213},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_26","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"292-303","source":"Crossref","is-referenced-by-count":4,"title":["Drawing Non-Planar Graphs with Crossing-Free Subgraphs"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Carla","family":"Binucci","sequence":"additional","affiliation":[]},{"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Grilli","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00454-009-9143-9","volume":"41","author":"E. Ackerman","year":"2009","unstructured":"Ackerman, E.: On the maximum number of edges in topological graphs with no four pairwise crossing edges. Discrete & Computational Geometry\u00a041(3), 365\u2013375 (2009)","journal-title":"Discrete & Computational Geometry"},{"issue":"3","key":"26_CR2","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. Journal of Combinatorial Theory, Ser. A\u00a0114(3), 563\u2013571 (2007)","journal-title":"Journal of Combinatorial Theory, Ser. A"},{"key":"26_CR3","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. Journal of Discrete Algorithms\u00a014, 150\u2013172 (2012)","journal-title":"Journal of Discrete Algorithms"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Angelini, P., Binucci, C., Da Lozzo, G., Didimo, W., Grilli, L., Montecchiani, F., Patrignani, M., Tollis, I.G.: Drawings of non-planar graphs with crossing-free subgraphs. ArXiv e-prints 1308.6706 (September 2013)","DOI":"10.1007\/978-3-319-03841-4_26"},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"369","DOI":"10.4171\/dm\/214","volume":"11","author":"I. B\u00e1r\u00e1ny","year":"2006","unstructured":"B\u00e1r\u00e1ny, I., Rote, G.: Strictly convex drawings of planar graphs. Documenta. Math.\u00a011, 369\u2013391 (2006)","journal-title":"Documenta. Math."},{"key":"26_CR6","unstructured":"Blasi\u00fcs, 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":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-36763-2_29","volume-title":"Graph Drawing","author":"F.J. Brandenburg","year":"2013","unstructured":"Brandenburg, F.J., Eppstein, D., Glei\u00dfner, A., Goodrich, M.T., Hanauer, K., Reislhuber, J.: On the density of maximal 1-planar graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 327\u2013338. Springer, Heidelberg (2013)"},{"key":"26_CR8","unstructured":"Buchheim, C., Chimani, M., Gutwenger, C., J\u00fcnger, M., Mutzel, P.: Crossings and planarization. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. CRC Press (2013)"},{"key":"26_CR9","volume-title":"Graph Drawing","author":"G. Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-34611-8_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Giacomo Di","year":"2012","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F.: h-quasi planar drawings of bounded treewidth graphs in linear area. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol.\u00a07551, pp. 91\u2013102. Springer, Heidelberg (2012)"},{"issue":"8","key":"26_CR11","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1016\/j.comgeo.2013.03.001","volume":"46","author":"E. Di Giacomo","year":"2013","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F.: Area requirement of graph drawings with few crossings per edge. Computational Geometry\u00a046(8), 909\u2013916 (2013)","journal-title":"Computational Geometry"},{"issue":"7","key":"26_CR12","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.ipl.2013.01.013","volume":"113","author":"W. Didimo","year":"2013","unstructured":"Didimo, W.: Density of straight-line 1-planar graph drawings. Information Processing Letters\u00a0113(7), 236\u2013240 (2013)","journal-title":"Information Processing Letters"},{"issue":"39","key":"26_CR13","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. Theoretical Computer Science\u00a0412(39), 5156\u20135166 (2011)","journal-title":"Theoretical Computer Science"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Didimo, W., Liotta, G.: The crossing angle resolution in graph drawing. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Springer (2013)","DOI":"10.1007\/978-1-4614-0110-0_10"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-36763-2_30","volume-title":"Graph Drawing","author":"P. Eades","year":"2013","unstructured":"Eades, P., Hong, S.H., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: Testing maximal 1-planarity of graphs with a rotation system in linear time - (extended abstract). In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 339\u2013345. Springer, Heidelberg (2013)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-32241-9_29","volume-title":"Computing and Combinatorics","author":"S.-H. Hong","year":"2012","unstructured":"Hong, S.-H., Eades, P., Liotta, G., Poon, S.-H.: F\u00e1ry\u2019s theorem for 1-planar graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol.\u00a07434, pp. 335\u2013346. Springer, Heidelberg (2012)"},{"issue":"4","key":"26_CR17","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BF01990536","volume":"33","author":"K. Jansen","year":"1993","unstructured":"Jansen, K., Woeginger, G.J.: The complexity of detecting crossingfree configurations in the plane. BIT Numerical Mathematics\u00a033(4), 580\u2013595 (1993)","journal-title":"BIT Numerical Mathematics"},{"issue":"1","key":"26_CR18","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica\u00a016(1), 4\u201332 (1996)","journal-title":"Algorithmica"},{"issue":"2","key":"26_CR19","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.comgeo.2006.06.001","volume":"37","author":"C. Knauer","year":"2007","unstructured":"Knauer, C., Schramm, \u00c9., Spillner, A., Wolff, A.: Configurations with few crossings in topological graphs. Computational Geometry\u00a037(2), 104\u2013114 (2007)","journal-title":"Computational Geometry"},{"issue":"1","key":"26_CR20","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"V.P. Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. Journal of Graph Theory\u00a072(1), 30\u201371 (2013)","journal-title":"Journal of Graph Theory"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Kowalik, L., Kurowski, M.: Short path queries in planar graphs in constant time. In: Larmore, L.L., Goemans, M.X. (eds.) STOC 2003, pp. 143\u2013148. ACM (2003)","DOI":"10.1145\/780564.780565"},{"issue":"2","key":"26_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/0404022","volume":"4","author":"J. Kratochv\u00ecl","year":"1991","unstructured":"Kratochv\u00ecl, J., Lubiv, A., Ne\u0161et\u0159il, J.: Noncrossing subgraphs in topological layouts. SIAM Journal on Discrete Mathematics\u00a04(2), 223\u2013244 (1991)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"26_CR23","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02086610","volume":"16","author":"J. Pach","year":"1996","unstructured":"Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. Algorithmica\u00a016(1), 111\u2013117 (1996)","journal-title":"Algorithmica"},{"issue":"3","key":"26_CR24","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J. Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica\u00a017(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"issue":"1","key":"26_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2012.02.006","volume":"46","author":"E. Rivera-Campo","year":"2013","unstructured":"Rivera-Campo, E., Urrutia-Galicia, V.: A sufficient condition for the existence of plane spanning trees on geometric graphs. Computational Geometry\u00a046(1), 1\u20136 (2013)","journal-title":"Computational Geometry"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","first-page":"266","volume-title":"GD 2011","author":"A. Suk","year":"2011","unstructured":"Suk, A.: k-quasi-planar graphs. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 266\u2013277. Springer, Heidelberg (2011)"},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: How to draw a graph. Proceedings of the London Mathematical Society s3-13(1), 743\u2013767 (1963)","DOI":"10.1112\/plms\/s3-13.1.743"},{"issue":"3","key":"26_CR28","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","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T15:42:18Z","timestamp":1688830938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}