{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:15Z","timestamp":1725761115931},"publisher-location":"Cham","reference-count":18,"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_10","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T00:28:55Z","timestamp":1385944135000},"page":"107-118","source":"Crossref","is-referenced-by-count":8,"title":["Recognizing Outer 1-Planar Graphs in Linear Time"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Auer","sequence":"first","affiliation":[]},{"given":"Christian","family":"Bachmaier","sequence":"additional","affiliation":[]},{"given":"Franz J.","family":"Brandenburg","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Glei\u00dfner","sequence":"additional","affiliation":[]},{"given":"Kathrin","family":"Hanauer","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Neuwirth","sequence":"additional","affiliation":[]},{"given":"Josef","family":"Reislhuber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"LNCS","first-page":"83","volume-title":"GD 2013","author":"M.J. Alam","year":"2013","unstructured":"Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: Straight-line 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":"10_CR2","unstructured":"Auer, C., Brandenburg, F.J., Glei\u00dfner, A., Reislhuber, J.: On 1-planar graphs with rotation systems. Tech. Rep. MIP 1207, University of Passau (2012)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-40104-6_9","volume-title":"Algorithms and Data Structures","author":"M.J. Bannister","year":"2013","unstructured":"Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol.\u00a08037, pp. 97\u2013108. Springer, Heidelberg (2013)"},{"key":"10_CR4","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":"10_CR5","doi-asserted-by":"crossref","unstructured":"Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. Tech. Rep. arXiv:1203.5944 (cs.CG), Computing Research Repository (CoRR) (March 2012)","DOI":"10.1137\/120872310"},{"issue":"6","key":"10_CR6","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. Internat. J. Comput. Geom. Appl.\u00a022(6), 543\u2013558 (2012)","journal-title":"Internat. J. Comput. Geom. Appl."},{"issue":"5","key":"10_CR7","doi-asserted-by":"publisher","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.\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"key":"10_CR8","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. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 339\u2013345. Springer, Heidelberg (2013)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","first-page":"148","volume-title":"GD 2011","author":"P. Eades","year":"2011","unstructured":"Eades, P., Liotta, G.: Right angle crossing graphs and 1-planarity. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 148\u2013153. Springer, Heidelberg (2011)"},{"key":"10_CR10","first-page":"149","volume":"29","author":"R.B. Eggleton","year":"1986","unstructured":"Eggleton, R.B.: Rectilinear drawings of graphs. Utilitas Math.\u00a029, 149\u2013172 (1986)","journal-title":"Utilitas Math."},{"key":"10_CR11","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)"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.jctb.2005.09.009","volume":"96","author":"P. Hlin\u011bn\u00fd","year":"2006","unstructured":"Hlin\u011bn\u00fd, P.: Crossing number is hard for cubic graphs. J. Combin. Theory, Ser. B\u00a096(4), 455\u2013471 (2006)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10_CR13","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":"10_CR14","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"71","DOI":"10.14257\/astl.2013.29.14","volume-title":"GD 2013","author":"S.H. Hong","year":"2013","unstructured":"Hong, S.H., Eades, P., Naoki, K., 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":"10_CR15","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-immersion and hardness of 1-planarity testing. J. Graph Theor.\u00a072, 30\u201371 (2013)","journal-title":"J. Graph Theor."},{"issue":"5","key":"10_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"S.L. Mitchell","year":"1979","unstructured":"Mitchell, S.L.: Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inform. Process. Lett.\u00a09(5), 229\u2013232 (1979)","journal-title":"Inform. Process. Lett."},{"key":"10_CR17","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. aus dem Math. Seminar der Univ. Hamburg\u00a029, 107\u2013117 (1965)","journal-title":"Abh. aus dem Math. Seminar der Univ. Hamburg"},{"issue":"3","key":"10_CR18","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. J. Graph Theor.\u00a012(3), 335\u2013341 (1988)","journal-title":"J. Graph Theor."}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T21:52:21Z","timestamp":1558734741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}