{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T08:37:43Z","timestamp":1794559063115,"version":"4.9.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319739144","type":"print"},{"value":"9783319739151","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_42","type":"book-chapter","created":{"date-parts":[[2018,1,19]],"date-time":"2018-01-19T22:42:19Z","timestamp":1516401739000},"page":"546-559","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Beyond Outerplanarity"],"prefix":"10.1007","author":[{"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Myroslav","family":"Kryven","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andre","family":"L\u00f6ffler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"issue":"3","key":"42_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 Comput. Geom. 41(3), 365\u2013375 (2009). https:\/\/doi.org\/10.1007\/s00454-009-9143-9","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"42_CR2","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. Combin. Theory Ser. A 114(3), 563\u2013571 (2007). https:\/\/doi.org\/10.1016\/j.jcta.2006.08.002","journal-title":"J. Combin. Theory Ser. A"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-319-68705-6_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Angelini","year":"2017","unstructured":"Angelini, P., et al.: On the Relationship Between k-Planar and k-Quasi-Planar Graphs. In: Bodlaender, Hans L., Woeginger, Gerhard J. (eds.) WG 2017. LNCS, vol. 10520, pp. 59\u201374. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_5"},{"issue":"4","key":"42_CR4","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1007\/s00453-015-0002-1","volume":"74","author":"C Auer","year":"2016","unstructured":"Auer, C., Bachmaier, C., Brandenburg, F.J., Glei\u00dfner, A., Hanauer, K., Neuwirth, D., Reislhuber, J.: Outer $$1$$-planar graphs. Algorithmica 74(4), 1293\u20131320 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0002-1","journal-title":"Algorithmica"},{"key":"42_CR5","unstructured":"Babu, J., Khoury, A., Newman, I.: Every property of outerplanar graphs is testable. In: Jansen, K., Mathieu, C., Rolim, J.D.P., Umans, C. (eds.) APPROX\/RANDOM 2016. LIPIcs, vol. 60, pp. 21:1\u201321:19. Schloss Dagstuhl, Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2016). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2016.21"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-662-45803-7_18","volume-title":"Graph Drawing","author":"MJ Bannister","year":"2014","unstructured":"Bannister, M.J., Eppstein, D.: Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 210\u2013221. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_18"},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-319-29516-9_4","volume-title":"Combinatorial Algorithms","author":"C Binucci","year":"2016","unstructured":"Binucci, C., Di Giacomo, E., Hossain, M.I., Liotta, G.: 1-page and 2-page drawings with bounded number of crossings per edge. In: Lipt\u00e1k, Z., Smyth, W.F. (eds.) IWOCA 2015. LNCS, vol. 9538, pp. 38\u201351. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29516-9_4"},{"key":"42_CR8","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. 41, 12\u201326, 108 (1984)"},{"issue":"1","key":"42_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0095-8956(92)90003-G","volume":"56","author":"V Capoyleas","year":"1992","unstructured":"Capoyleas, V., Pach, J.: A Tur\u00e1n-type theorem on chords of a convex polygon. J. Combin. Theory Ser. B 56(1), 9\u201315 (1992). https:\/\/doi.org\/10.1016\/0095-8956(92)90003-G","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"42_CR10","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inform. Comput. 85(1), 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","journal-title":"Inform. Comput."},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-319-21275-3_14","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Lower bounds based on the exponential-time hypothesis. Parameterized Algorithms, pp. 467\u2013521. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3_14"},{"issue":"5","key":"42_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1006\/eujc.2002.0582","volume":"23","author":"AWM Dress","year":"2002","unstructured":"Dress, A.W.M., Koolen, J.H., Moulton, V.: On line arrangements in the hyperbolic plane. Eur. J. Comb. 23(5), 549\u2013557 (2002). https:\/\/doi.org\/10.1006\/eujc.2002.0582","journal-title":"Eur. J. Comb."},{"issue":"2","key":"42_CR14","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1137\/16M1062879","volume":"31","author":"V Dujmovi\u0107","year":"2017","unstructured":"Dujmovi\u0107, V., Eppstein, D., Wood, D.R.: Structure of graphs with locally restricted crossings. SIAM J. Discrete Math. 31(2), 805\u2013824 (2017)","journal-title":"SIAM J. Discrete Math."},{"key":"42_CR15","unstructured":"Dvo\u0159\u00e1k, Z., Norin, S.: Treewidth of graphs with balanced separations. ArXiv (2014). http:\/\/arxiv.org\/abs\/1408.3869"},{"issue":"1","key":"42_CR16","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. 27(1), 550\u2013561 (2013). https:\/\/doi.org\/10.1137\/110858586","journal-title":"SIAM J. Discrete Math."},{"key":"42_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.disc.2014.05.001","volume":"331","author":"J Geneson","year":"2014","unstructured":"Geneson, J., Khovanova, T., Tidor, J.: Convex geometric ($$k+2$$)-quasiplanar representations of semi-bar $$k$$-visibility graphs. Discrete Math. 331, 83\u201388 (2014). https:\/\/doi.org\/10.1016\/j.disc.2014.05.001","journal-title":"Discrete Math."},{"issue":"4","key":"42_CR18","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1007\/s00453-014-9890-8","volume":"72","author":"SH Hong","year":"2015","unstructured":"Hong, S.H., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear-time algorithm for testing outer-1-planarity. Algorithmica 72(4), 1033\u20131054 (2015). https:\/\/doi.org\/10.1007\/s00453-014-9890-8","journal-title":"Algorithmica"},{"key":"42_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-662-53174-7_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S-H Hong","year":"2016","unstructured":"Hong, S.-H., Nagamochi, H.: Testing full outer-2-planarity in linear time. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 406\u2013421. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53174-7_29"},{"issue":"2","key":"42_CR20","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of $$k$$-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001). https:\/\/doi.org\/10.1006\/jcss.2000.1727","journal-title":"J. Comput. Syst. Sci."},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on $$1$$-planarity. ArXiv (2017). http:\/\/arxiv.org\/abs\/1703.02261","DOI":"10.1016\/j.cosrev.2017.06.002"},{"key":"42_CR22","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"DR Lick","year":"1970","unstructured":"Lick, D.R., White, A.T.: $$k$$-degenerate graphs. Canadian J. Math. 22, 1082\u20131096 (1970). https:\/\/doi.org\/10.4153\/CJM-1970-125-1","journal-title":"Canadian J. Math."},{"key":"42_CR23","unstructured":"Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T.: On the NP-completeness of a computer network layout problem. In: Proceedings of IEEE International Symposium Circuits and Systems, pp. 292\u2013295 (1987)"},{"issue":"2","key":"42_CR24","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0304-3975(99)00199-1","volume":"235","author":"T Nakamigawa","year":"2000","unstructured":"Nakamigawa, T.: A generalization of diagonal flips in a convex polygon. Theor. Comput. Sci. 235(2), 271\u2013282 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(99)00199-1","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"42_CR25","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02086610","volume":"16","author":"J Pach","year":"1996","unstructured":"Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. Algorithmica 16(1), 111\u2013117 (1996). https:\/\/doi.org\/10.1007\/BF02086610","journal-title":"Algorithmica"},{"issue":"3","key":"42_CR26","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997). https:\/\/doi.org\/10.1007\/BF01215922","journal-title":"Combinatorica"},{"issue":"1","key":"42_CR27","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. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg 29(1), 107\u2013117 (1965). https:\/\/doi.org\/10.1007\/BF02996313","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"issue":"1","key":"42_CR28","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Combin. Theory Ser. B 36(1), 49\u201364 (1984). https:\/\/doi.org\/10.1016\/0095-8956(84)90013-3","journal-title":"J. Combin. Theory Ser. B"},{"key":"42_CR29","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electronic J. Combin. DS21, 100 pages (2013, 2014). http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/DS21","DOI":"10.37236\/2713"},{"key":"42_CR30","first-page":"117","volume":"13","author":"DR Wood","year":"2007","unstructured":"Wood, D.R., Telle, J.A.: Planar decompositions and the crossing number of graphs with an excluded minor. New York J. Math. 13, 117\u2013146 (2007)","journal-title":"New York J. Math."},{"issue":"1","key":"42_CR31","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci. 38(1), 36\u201367 (1989). https:\/\/doi.org\/10.1016\/0022-0000(89)90032-9","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73915-1_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T07:26:15Z","timestamp":1710228375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_42","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}