{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:29:26Z","timestamp":1743002966822,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319739144"},{"type":"electronic","value":"9783319739151"}],"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_41","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"531-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Gap-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]},{"given":"Jean-Francois","family":"Baffier","sequence":"additional","affiliation":[]},{"given":"Jinhee","family":"Chun","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[]},{"given":"Kord","family":"Eickmeyer","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Grilli","sequence":"additional","affiliation":[]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"41_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-50106-2_24","volume-title":"Graph Drawing and Network Visualization","author":"E Ackerman","year":"2016","unstructured":"Ackerman, E., Keszegh, B., Vizer, M.: On the size of planarly connected crossing graphs. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 311\u2013320. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_24"},{"issue":"3","key":"41_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)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"41_CR3","doi-asserted-by":"publisher","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"},{"key":"41_CR4","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, H.L., Woeginger, G.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":"2","key":"41_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/965103.807437","volume":"13","author":"A Appel","year":"1979","unstructured":"Appel, A., Rohlf, F.J., Stein, A.J.: The haloed line effect for hidden line elimination. SIGGRAPH Comput. Graph. 13(2), 151\u2013157 (1979)","journal-title":"SIGGRAPH Comput. Graph."},{"issue":"4","key":"41_CR6","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)","journal-title":"Algorithmica"},{"issue":"1","key":"41_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.7155\/jgaa.00347","volume":"19","author":"C Auer","year":"2015","unstructured":"Auer, C., Brandenburg, F.J., Glei\u00dfner, A., Reislhuber, J.: 1-planarity of graphs with a rotation system. J. Graph Algorithms Appl. 19(1), 67\u201386 (2015)","journal-title":"J. Graph Algorithms Appl."},{"key":"41_CR8","unstructured":"Bae, S.W., Baffier, J.F., Chun, J., Eades, P., Eickmeyer, K., Grilli, L., Hong, S.H., Korman, M., Montecchiani, F., Rutter, I., T\u00f3th, C.D.: Gap-planar graphs. CoRR abs\/1708.07653 (2017). https:\/\/arxiv.org\/abs\/1708.07653"},{"key":"41_CR9","first-page":"1","volume":"79","author":"MA Bekos","year":"2016","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. Algorithmica 79, 1\u201327 (2016)","journal-title":"Algorithmica"},{"key":"41_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2017.05.039","volume":"689","author":"MA Bekos","year":"2017","unstructured":"Bekos, M.A., Didimo, W., Liotta, G., Mehrabi, S., Montecchiani, F.: On RAC drawings of 1-planar graphs. Theor. Comput. Sci. 689, 48\u201357 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"41_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-319-50106-2_27","volume-title":"Graph Drawing and Network Visualization","author":"MA Bekos","year":"2016","unstructured":"Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On the density of non-simple 3-planar graphs. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 344\u2013356. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_27"},{"key":"41_CR12","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2015.04.020","volume":"589","author":"C Binucci","year":"2015","unstructured":"Binucci, C., Di Giacomo, E., Didimo, W., Montecchiani, F., Patrignani, M., Symvonis, A., Tollis, I.G.: Fan-planarity: properties and complexity. Theor. Comput. Sci. 589, 76\u201386 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"41_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.026","volume":"636","author":"FJ Brandenburg","year":"2016","unstructured":"Brandenburg, F.J., Didimo, W., Evans, W.S., Kindermann, P., Liotta, G., Montecchiani, F.: Recognizing and drawing IC-planar graphs. Theor. Comput. Sci. 636, 1\u201316 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"41_CR14","doi-asserted-by":"publisher","first-page":"2910","DOI":"10.1021\/ci3003107","volume":"52","author":"G Brinkmann","year":"2012","unstructured":"Brinkmann, G., Goedgebeur, J., McKay, B.D.: The generation of fullerenes. J. Chem. Inf. Model. 52(11), 2910\u20132918 (2012)","journal-title":"J. Chem. Inf. Model."},{"key":"41_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-36763-2_7","volume-title":"Graph Drawing","author":"T Bruckdorfer","year":"2013","unstructured":"Bruckdorfer, T., Cornelsen, S., Gutwenger, C., Kaufmann, M., Montecchiani, F., N\u00f6llenburg, M., Wolff, A.: Progress on partial edge drawings. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 67\u201378. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_7"},{"key":"41_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-30347-0_7","volume-title":"Fun with Algorithms","author":"T Bruckdorfer","year":"2012","unstructured":"Bruckdorfer, T., Kaufmann, M.: Mad at edge crossings? Break the edges!. In: Kranakis, E., Krizanc, D., Luccio, F. (eds.) FUN 2012. LNCS, vol. 7288, pp. 40\u201350. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30347-0_7"},{"key":"41_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.) ISAAC 2013. LNCS, vol. 8283, pp. 163\u2013173. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45030-3_16"},{"key":"41_CR18","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2016.05.017","volume":"639","author":"HR Dehkordi","year":"2016","unstructured":"Dehkordi, H.R., Eades, P., Hong, S., Nguyen, Q.H.: Circular right-angle crossing drawings in linear time. Theor. Comput. Sci. 639, 26\u201341 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"41_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0110-0_10","volume-title":"Thirty Essays on Geometric Graph Theory","author":"W Didimo","year":"2012","unstructured":"Didimo, W., Liotta, G.: The crossing angle resolution in graph drawing. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_10"},{"key":"41_CR20","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., 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":"8","key":"41_CR21","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1016\/j.comgeo.2008.05.005","volume":"42","author":"D Eppstein","year":"2009","unstructured":"Eppstein, D., van Kreveld, M.J., Mumford, E., Speckmann, B.: Edges and switches, tunnels and bridges. Comput. Geom. 42(8), 790\u2013802 (2009)","journal-title":"Comput. Geom."},{"issue":"1","key":"41_CR22","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. Discr. Math. 27(1), 550\u2013561 (2013)","journal-title":"SIAM J. Discr. Math."},{"key":"41_CR23","first-page":"353","volume":"18","author":"A Frank","year":"1978","unstructured":"Frank, A., Gy\u00e1rf\u00e1s, A.: How to orient the edges of a graph? Colloq. Math. Soc. J\u00e1nos Bolyai 18, 353\u2013364 (1978)","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"41_CR24","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. W. H. Freeman, New York (1979)"},{"issue":"1","key":"41_CR25","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 49(1), 1\u201311 (2007)","journal-title":"Algorithmica"},{"key":"41_CR26","unstructured":"Hoffmann, M., T\u00f3th, C.D.: Two-planar graphs are quasiplanar. CoRR abs\/1705.05569 (2017). http:\/\/arxiv.org\/abs\/org\/abs\/1705.05569"},{"issue":"4","key":"41_CR27","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1007\/s00453-014-9890-8","volume":"72","author":"S Hong","year":"2015","unstructured":"Hong, S., 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)","journal-title":"Algorithmica"},{"key":"41_CR28","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":"11","key":"41_CR29","first-page":"35","volume":"6","author":"SH Hong","year":"2017","unstructured":"Hong, S.H., Kaufmann, M., Kobourov, S.G., Pach, J.: Beyond-planar graphs: algorithmics and combinatorics (Dagstuhl Seminar 16452). Dagstuhl Rep. 6(11), 35\u201362 (2017)","journal-title":"Dagstuhl Rep."},{"key":"41_CR30","unstructured":"Hong, S.H., Tokuyama, T.: Algorithmics for beyond planar graphs. In: NII Shonan Meeting, Shonan Village Center (2016). http:\/\/shonan.nii.ac.jp\/shonan\/blog\/2015\/11\/15\/3972\/"},{"issue":"4","key":"41_CR31","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.jvlc.2014.03.001","volume":"25","author":"W Huang","year":"2014","unstructured":"Huang, W., Eades, P., Hong, S.: Larger crossing angles make graphs easier to read. J. Vis. Lang. Comput. 25(4), 452\u2013465 (2014)","journal-title":"J. Vis. Lang. Comput."},{"key":"41_CR32","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR abs\/1403.6184 (2014). http:\/\/arxiv.org\/abs\/org\/abs\/1403.6184"},{"issue":"4","key":"41_CR33","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0021-9800(70)80087-4","volume":"9","author":"DJ Kleitman","year":"1970","unstructured":"Kleitman, D.J.: The crossing number of $${K}_{5, n}$$. J. Combin. Theor. 9(4), 315\u2013323 (1970)","journal-title":"J. Combin. Theor."},{"key":"41_CR34","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.cosrev.2017.06.002","volume":"25","author":"SG Kobourov","year":"2017","unstructured":"Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 59\u201374 (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_5","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"41_CR35","doi-asserted-by":"publisher","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."},{"key":"41_CR36","unstructured":"Liotta, G.: Graph drawing beyond planarity: some results and open problems. In: ICTCS 2014. CEUR Workshop Proceedings, vol. 1231, pp. 3\u20138 (2014). CEUR-WS.org"},{"issue":"4","key":"41_CR37","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00454-006-1264-9","volume":"36","author":"J Pach","year":"2006","unstructured":"Pach, J., Radoi\u010di\u0107, R., Tardos, G., T\u00f3th, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Discrete Comput. Geom. 36(4), 527\u2013552 (2006)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"41_CR38","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 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"issue":"2","key":"41_CR39","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/net.3230120206","volume":"12","author":"JC Picard","year":"1982","unstructured":"Picard, J.C., Queyranne, M.: A network flow solution to some nonlinear $$0-1$$ programming problems, with applications to graph theory. Networks 12(2), 141\u2013159 (1982)","journal-title":"Networks"},{"issue":"13","key":"41_CR40","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.dam.2003.07.007","volume":"143","author":"V Venkateswaran","year":"2004","unstructured":"Venkateswaran, V.: Minimizing maximum indegree. Discr. Appl. Math. 143(13), 374\u2013378 (2004)","journal-title":"Discr. Appl. Math."},{"issue":"1","key":"41_CR41","doi-asserted-by":"publisher","first-page":"137","DOI":"10.4064\/fm-41-1-137-145","volume":"41","author":"C Zarankiewicz","year":"1955","unstructured":"Zarankiewicz, C.: On a problem of P. Turan concerning graphs. Fund. Math. 41(1), 137\u2013145 (1955)","journal-title":"Fund. Math."}],"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_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:25:52Z","timestamp":1710242752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}]}}