{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:03Z","timestamp":1759063683999},"publisher-location":"Cham","reference-count":23,"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_17","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:12:53Z","timestamp":1417432373000},"page":"198-209","source":"Crossref","is-referenced-by-count":13,"title":["On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[]},{"given":"Sabine","family":"Cornelsen","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Grilli","sequence":"additional","affiliation":[]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"17_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":"17_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":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"569","DOI":"10.7155\/jgaa.00274","volume":"16","author":"E.N. Argyriou","year":"2012","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: The straight-line RAC drawing problem is NP-hard. J. Graph Algorithms Appl.\u00a016(2), 569\u2013597 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"17_CR4","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":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., Cornelsen, S., Grilli, L., Hong, S.H., Kaufmann, M.: On the recognition of fan-planar and maximal outer-fan-planar graphs. CoRR abs\/1409.0461 (September 2014)","DOI":"10.1007\/978-3-662-45803-7_17"},{"key":"17_CR6","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)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-36065-7_28","volume-title":"WALCOM: Algorithms and Computation","author":"H. Reisi Dehkordi","year":"2013","unstructured":"Reisi Dehkordi, H., Nguyen, Q., Eades, P., Hong, S.-H.: Circular graph drawings with large crossing angles. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol.\u00a07748, pp. 298\u2013309. Springer, Heidelberg (2013)"},{"issue":"39","key":"17_CR8","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":"17_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2013.09.029","volume":"513","author":"P. Eades","year":"2013","unstructured":"Eades, P., Hong, S.H., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci.\u00a0513, 65\u201376 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"7-8","key":"17_CR10","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"},{"key":"17_CR11","first-page":"149","volume":"29","author":"R. Eggleton","year":"1986","unstructured":"Eggleton, R.: Rectilinear drawings of graphs. Utilitas Mathematica\u00a029, 149\u2013172 (1986)","journal-title":"Utilitas Mathematica"},{"issue":"1","key":"17_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. Discrete Math.\u00a027(1), 550\u2013561 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"1","key":"17_CR14","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":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"key":"17_CR16","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":"17_CR17","unstructured":"Hong, S.H., Nagamochi, H.: Testing full outer-2-planarity in linear time. Technical Report 2014-003, Department of Applied Mathematics and Physics, Kyoto University (2014)"},{"key":"17_CR18","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR abs\/1403.6184 (2014)"},{"issue":"1","key":"17_CR19","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":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-44400-8_24","volume-title":"Discrete and Computational Geometry","author":"J. Pach","year":"2003","unstructured":"Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: Relaxing planarity for topological graphs. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol.\u00a02866, pp. 221\u2013232. Springer, Heidelberg (2003)"},{"issue":"3","key":"17_CR21","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":"2","key":"17_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0953-5438(00)00032-1","volume":"13","author":"H.C. Purchase","year":"2000","unstructured":"Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interacting with Computers\u00a013(2), 147\u2013162 (2000)","journal-title":"Interacting with Computers"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02996313","volume":"29","author":"G. Ringel","year":"1965","unstructured":"Ringel, G.: Ein Sechsfarbenproblem auf der Kugel. Abh. Math. Sem. Univ. Hamburg\u00a029, 107\u2013117 (1965)","journal-title":"Abh. Math. Sem. Univ. Hamburg"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:03:59Z","timestamp":1559077439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}