{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:45Z","timestamp":1759639065474},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_29","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T10:50:06Z","timestamp":1470307806000},"page":"406-421","source":"Crossref","is-referenced-by-count":9,"title":["Testing Full Outer-2-planarity in Linear Time"],"prefix":"10.1007","author":[{"given":"Seok-Hee","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"crossref","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 Comput. Geom. 41(3), 365\u2013375 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"29_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"PK 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 17(1), 1\u20139 (1997)","journal-title":"Combinatorica"},{"issue":"2","key":"29_CR3","doi-asserted-by":"crossref","first-page":"569","DOI":"10.7155\/jgaa.00274","volume":"16","author":"EN 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. 16(2), 569\u2013597 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"29_CR4","first-page":"2014","volume":"107\u2013118","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. GD 107\u2013118, 2014 (2013)","journal-title":"GD"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-662-45803-7_17","volume-title":"Graph Drawing","author":"MA Bekos","year":"2014","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. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 198\u2013209. Springer, Heidelberg (2014)"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-662-45803-7_16","volume-title":"Graph Drawing","author":"C Binucci","year":"2014","unstructured":"Binucci, C., Di Giacomo, E., Didimo, W., Montecchiani, F., Patrignani, M., Tollis, I.G.: Fan-planar graphs: combinatorial properties and complexity results. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 186\u2013197. Springer, Heidelberg (2014)"},{"key":"29_CR7","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":"Algorithms and Computation","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.) Algorithms and Computation. LNCS, vol. 8283, pp. 163\u2013173. Springer, Heidelberg (2013)"},{"issue":"5","key":"29_CR8","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"issue":"39","key":"29_CR9","doi-asserted-by":"crossref","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. 412(39), 5156\u20135166 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR10","doi-asserted-by":"crossref","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. 513, 65\u201376 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"29_CR11","doi-asserted-by":"crossref","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. 27(1), 550\u2013561 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"29_CR12","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight line representations of planar graphs. Acta Sci. Math. Szeged 11, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. Szeged"},{"key":"29_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"issue":"1","key":"29_CR14","doi-asserted-by":"crossref","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 49(1), 1\u201311 (2007)","journal-title":"Algorithmica"},{"issue":"1","key":"29_CR15","first-page":"1","volume":"49","author":"S Hong","year":"2014","unstructured":"Hong, S., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear-time algorithm for testing outer-1-planarity. Algorithmica 49(1), 1\u201311 (2014)","journal-title":"Algorithmica"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 7434, pp. 335\u2013346. Springer, Heidelberg (2012)"},{"unstructured":"Hong, S., Nagamochi, H.: Beyond planarity: testing full outer-2-planarity in linear time. Technical report [2014-003], Department of Applied Mathematics and Physics, Kyoto University (2014)","key":"29_CR17"},{"unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs, CoRR abs\/1403.6184 (2014)","key":"29_CR18"},{"issue":"1","key":"29_CR19","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"VP Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. J. Graph Theor. 72(1), 30\u201371 (2013)","journal-title":"J. Graph Theor."},{"unstructured":"Nagamochi, H.: Straight-line drawability of embedded graphs. Technical report [2013-005], Department of Applied Mathematics and Physics, Kyoto University (2013)","key":"29_CR20"},{"issue":"3","key":"29_CR21","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., Toth, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"issue":"3","key":"29_CR22","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/jgt.3190120306","volume":"12","author":"C Thomassen","year":"1988","unstructured":"Thomassen, C.: Rectilinear drawings of graphs. J. Graph Theor. 12(3), 335\u2013341 (1988)","journal-title":"J. Graph Theor."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T15:57:46Z","timestamp":1498319866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}