{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:10:09Z","timestamp":1743041409097,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662458020"},{"type":"electronic","value":"9783662458037"}],"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_16","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:12:53Z","timestamp":1417432373000},"page":"186-197","source":"Crossref","is-referenced-by-count":4,"title":["Fan-Planar Graphs: Combinatorial Properties and Complexity Results"],"prefix":"10.1007","author":[{"given":"Carla","family":"Binucci","sequence":"first","affiliation":[]},{"given":"Emilio","family":"Di Giacomo","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Didimo","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":"16_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":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/100819564","volume":"26","author":"E. Ackerman","year":"2012","unstructured":"Ackerman, E., Fulek, R., T\u00f3th, C.D.: Graphs that admit polyline drawings with few crossing angles. SIAM J. on Discrete Mathematics\u00a026(1), 305\u2013320 (2012)","journal-title":"SIAM J. on Discrete Mathematics"},{"issue":"3","key":"16_CR3","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":"16_CR4","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"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-03841-4_8","volume-title":"Graph Drawing","author":"M.J. Alam","year":"2013","unstructured":"Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: Straight-line grid drawings of 3-connected 1-planar graphs. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 83\u201394. Springer, Heidelberg (2013)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-642-34191-5_19","volume-title":"Computational Geometry","author":"P. Angelini","year":"2012","unstructured":"Angelini, P., Di Battista, G., Didimo, W., Frati, F., Hong, S.H., Kaufmann, M., Liotta, G., Lubiw, A.: Large angle crossing drawings of planar graphs in subquadratic area. In: M\u00e1rquez, A., Ramos, P., Urrutia, J. (eds.) EGC 2011. LNCS, vol.\u00a07579, pp. 200\u2013209. Springer, Heidelberg (2012)"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.3190100102","volume":"10","author":"K. Asano","year":"1986","unstructured":"Asano, K.: The crossing number of K 1,3,n and K 2,3,n . J. of Graph Theory\u00a010(1), 1\u20138 (1986)","journal-title":"J. of Graph Theory"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-319-03841-4_10","volume-title":"Graph Drawing","author":"C. Auer","year":"2013","unstructured":"Auer, C., Bachmaier, C., Brandenburg, F.J., Glei\u00dfner, A., Hanauer, K., Neuwirth, D., Reislhuber, J.: Recognizing outer 1-planar graphs in linear time. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 107\u2013118. Springer, Heidelberg (2013)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-642-36763-2_50","volume-title":"Graph Drawing","author":"C. Auer","year":"2013","unstructured":"Auer, C., Brandenburg, F.J., Glei\u00dfner, A., Hanauer, K.: On sparse maximal 2-planar graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 555\u2013556. Springer, Heidelberg (2013)"},{"key":"16_CR10","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":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-3-642-45030-3_16","volume-title":"ISAAC 2013","author":"O. Cheong","year":"2013","unstructured":"Cheong, O., Har-Peled, S., Kim, H., Kim, H.S.: On the number of edges of fan-crossing free graphs. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol.\u00a08283, pp. 163\u2013173. Springer, Heidelberg (2013)"},{"issue":"6","key":"16_CR12","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1142\/S021819591250015X","volume":"22","author":"H.R. Dehkordi","year":"2012","unstructured":"Dehkordi, H.R., Eades, P.: Every outer-1-plane graph has a right angle crossing drawing. International J. on Computational Geometry and Appl.\u00a022(6), 543\u2013558 (2012)","journal-title":"International J. on Computational Geometry and Appl."},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1007\/s00453-012-9706-7","volume":"68","author":"E. Di Giacomo","year":"2014","unstructured":"Di Giacomo, E., Didimo, W., Eades, P., Liotta, G.: 2-layer right angle crossing drawings. Algorithmica\u00a068(4), 954\u2013997 (2014)","journal-title":"Algorithmica"},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00224-010-9275-6","volume":"49","author":"E. Giacomo Di","year":"2011","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing resolution of non-planar graph drawings. Theory of Computing Syst.\u00a049(3), 565\u2013575 (2011)","journal-title":"Theory of Computing Syst."},{"key":"16_CR15","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":"16_CR16","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":"1","key":"16_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.7155\/jgaa.00099","volume":"9","author":"M. Dickerson","year":"2005","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: Visualizing non-planar diagrams in a planar way. J. of Graph Algorithms and Appl.\u00a09(1), 31\u201352 (2005)","journal-title":"J. of Graph Algorithms and Appl."},{"issue":"7","key":"16_CR18","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":"16_CR19","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. Comput. Sci.\u00a0412(39), 5156\u20135166 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR20","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 (2012)","DOI":"10.1007\/978-1-4614-0110-0_10"},{"key":"16_CR21","unstructured":"Dujmovi\u0107, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. Chicago J. on Theoretical Computer Science 2011 (2011)"},{"issue":"7-8","key":"16_CR22","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1016\/j.dam.2012.11.019","volume":"161","author":"P. Eades","year":"2013","unstructured":"Eades, P., Liotta, G.: Right angle crossing graphs and 1-planarity. Discrete Applied Mathematics\u00a0161(7-8), 961\u2013969 (2013)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"16_CR23","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00453-006-0159-8","volume":"47","author":"D. Eppstein","year":"2007","unstructured":"Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent layered drawings. Algorithmica\u00a047(4), 439\u2013452 (2007)","journal-title":"Algorithmica"},{"issue":"1","key":"16_CR24","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":"1","key":"16_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","volume":"49","author":"A. Grigoriev","year":"2007","unstructured":"Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica\u00a049(1), 1\u201311 (2007)","journal-title":"Algorithmica"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-03841-4_7","volume-title":"Graph Drawing","author":"S.H. Hong","year":"2013","unstructured":"Hong, S.H., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear-time algorithm for testing outer-1-planarity. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 71\u201382. Springer, Heidelberg (2013)"},{"key":"16_CR27","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)"},{"key":"16_CR28","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR abs\/1403.6184 (2014), http:\/\/arxiv.org\/abs\/1403.6184"},{"issue":"1","key":"16_CR29","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. J. of Graph Theory\u00a072(1), 30\u201371 (2013)","journal-title":"J. of Graph Theory"},{"issue":"3","key":"16_CR30","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"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: The graph crossing number and its variants: A survey. Electronic J. of Combinatorics 20(2) (2013)","DOI":"10.37236\/2713"},{"issue":"4","key":"16_CR32","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1137\/090746835","volume":"24","author":"Y. Suzuki","year":"2010","unstructured":"Suzuki, Y.: Re-embeddings of maximum 1-planar graphs. SIAM J. on Discrete Mathematics\u00a024(4), 1527\u20131540 (2010)","journal-title":"SIAM J. on Discrete Mathematics"},{"issue":"3","key":"16_CR33","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"},{"issue":"3","key":"16_CR34","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M. Garey","year":"1983","unstructured":"Garey, M., Johnson, D.: Crossing Number is NP-Complete. SIAM Journal on Algebraic Discrete Methods\u00a04(3), 312\u2013316 (1983), doi:10.1137\/0604033","journal-title":"SIAM Journal on Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T10:27:12Z","timestamp":1598524032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662458020","9783662458037"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}