{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:37Z","timestamp":1725761137983},"publisher-location":"Cham","reference-count":19,"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_7","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"71-82","source":"Crossref","is-referenced-by-count":8,"title":["A Linear-Time Algorithm for Testing Outer-1-Planarity"],"prefix":"10.1007","author":[{"given":"Seok-Hee","family":"Hong","sequence":"first","affiliation":[]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Schweitzer","sequence":"additional","affiliation":[]},{"given":"Yusuke","family":"Suzuki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Hong, S.H., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear-time algorithm for testing outer-1-planarity. TR-IT-IVG-2013-01. Technical Report, School of IT, University of Sydney (June 2013)","DOI":"10.1007\/978-3-319-03841-4_7"},{"key":"7_CR2","series-title":"LNCS","first-page":"107","volume-title":"GD 2013","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":"7_CR3","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"},{"key":"7_CR4","first-page":"12","volume":"41","author":"O.V. Borodin","year":"1984","unstructured":"Borodin, O.V.: Solution of the Ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs. Metody Diskret. Analiz.\u00a041, 12\u201326 (1984)","journal-title":"Metody Diskret. Analiz."},{"key":"7_CR5","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, 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.disc.2005.11.056","volume":"307","author":"I. Fabrici","year":"2007","unstructured":"Fabrici, I., Madaras, T.: The structure of 1-planar graphs. Discrete Mathematics\u00a0307, 854\u2013865 (2007)","journal-title":"Discrete Mathematics"},{"key":"7_CR7","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. Discrete Math.\u00a024, 1527\u20131540 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR8","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, 30\u201371 (2013)","journal-title":"Journal of Graph Theory"},{"key":"7_CR9","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":"7_CR10","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"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/jgt.3190120306","volume":"12","author":"C. Thomassen","year":"1988","unstructured":"Thomassen, C.: Rectilinear drawings of graphs. Journal of Graph Theory\u00a012, 335\u2013341 (1988)","journal-title":"Journal of Graph Theory"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Hong, S.H., Eades, P., Liotta, G., Poon, S.H.: F\u00e1ry\u2019s theorem for 1-planar graphs. In: [19], pp. 335\u2013346","DOI":"10.1007\/978-3-642-32241-9_29"},{"key":"7_CR13","unstructured":"Nagamochi, H.: Straight-line drawability of embedded graphs. Technical Report 2013-005, Department of Applied Mathematics and Physics, Kyoto University, Japan (2013)"},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G.D. Battista","year":"1996","unstructured":"Battista, G.D., Tamassia, R.: On-line maintenance of triconnected components with spqr-trees. Algorithmica\u00a015, 302\u2013318 (1996)","journal-title":"Algorithmica"},{"key":"7_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":"7_CR16","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. Int. J. Comput. Geometry Appl.\u00a022, 543\u2013558 (2012)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.comgeo.2010.03.007","volume":"45","author":"F. Frati","year":"2012","unstructured":"Frati, F.: Straight-line drawings of outerplanar graphs in o(dn log n) area. Comput. Geom.\u00a045, 524\u2013533 (2012)","journal-title":"Comput. Geom."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Knauer, K.B., Micek, P., Walczak, B.: Outerplanar graph drawings with few slopes. In: [19], pp. 323\u2013334","DOI":"10.1007\/978-3-642-32241-9_28"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Computing and Combinatorics","year":"2012","unstructured":"Gudmundsson, J., Mestre, J., Viglas, T. (eds.): COCOON 2012. LNCS, vol.\u00a07434. Springer, Heidelberg (2012)"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T01:31:16Z","timestamp":1558747876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}