{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T12:07:33Z","timestamp":1780056453218,"version":"3.54.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030687656","type":"print"},{"value":"9783030687663","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-68766-3_32","type":"book-chapter","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T09:11:53Z","timestamp":1613293913000},"page":"403-419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["2-Layer k-Planar Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7602-1524","authenticated-orcid":false,"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-5174","authenticated-orcid":false,"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1441-4189","authenticated-orcid":false,"given":"Henry","family":"F\u00f6rster","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4061-8844","authenticated-orcid":false,"given":"Thomas","family":"Schneck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,2,14]]},"reference":[{"issue":"3","key":"32_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. Discret. Comput. Geom. 41(3), 365\u2013375 (2009). https:\/\/doi.org\/10.1007\/s00454-009-9143-9","journal-title":"Discret. Comput. Geom."},{"key":"32_CR2","doi-asserted-by":"publisher","unstructured":"Ackerman, E.: On topological graphs with at most four crossings per edge. Comput. Geom. 85 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2019.101574","DOI":"10.1016\/j.comgeo.2019.101574"},{"issue":"3","key":"32_CR3","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. Comb. Theory Ser. A 114(3), 563\u2013571 (2007). https:\/\/doi.org\/10.1016\/j.jcta.2006.08.002","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"32_CR4","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). https:\/\/doi.org\/10.1007\/BF01196127","journal-title":"Combinatorica"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-57265-8_45","volume-title":"Proofs from THE BOOK","author":"M Aigner","year":"2018","unstructured":"Aigner, M., Ziegler, G.M.: Probability makes counting (sometimes) easy. Proofs from THE BOOK, pp. 311\u2013319. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-57265-8_45"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M., Szemer\u00e9di, E.: Crossing-free subgraphs. In: Hammer, P.L., Rosa, A., Sabidussi, G., Turgeon, J. (eds.) Theory and Practice of Combinatorics, North-Holland Mathematics Studies, vol. 60, pp. 9\u201312. North-Holland (1982). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304020808734844","DOI":"10.1016\/S0304-0208(08)73484-4"},{"key":"32_CR7","doi-asserted-by":"publisher","unstructured":"Angelini, P., et al.: Simple k-planar graphs are simple (k+1)-quasiplanar. J. Comb. Theory Ser. B 142, 1\u201335 (2020). https:\/\/doi.org\/10.1016\/j.jctb.2019.08.006","DOI":"10.1016\/j.jctb.2019.08.006"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2020.04.018","volume":"828\u2013829","author":"P Angelini","year":"2020","unstructured":"Angelini, P., Bekos, M.A., F\u00f6rster, H., Kaufmann, M.: On RAC drawings of graphs with one bend per edge. Theor. Comput. Sci. 828\u2013829, 42\u201354 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.04.018","journal-title":"Theor. Comput. Sci."},{"key":"32_CR9","doi-asserted-by":"publisher","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Pfister, M., Ueckerdt, T.: Beyond-planarity: Tur\u00e1n-type results for non-planar bipartite graphs. In: ISAAC. LIPIcs, vol. 123, pp. 28:1\u201328:13. Schloss Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.28","DOI":"10.4230\/LIPIcs.ISAAC.2018.28"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Angelini, P., Da Lozzo, G., F\u00f6rster, H., Schneck, T.: $$2$$-layer $$k$$-planar graphs: Density, crossing lemma, relationships, and pathwidth (2020). https:\/\/arxiv.org\/abs\/2008.09329","DOI":"10.1007\/978-3-030-68766-3_32"},{"issue":"4","key":"32_CR11","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1007\/s00453-015-0002-1","volume":"74","author":"C Auer","year":"2015","unstructured":"Auer, C., et al.: Outer 1-Planar Graphs. Algorithmica 74(4), 1293\u20131320 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0002-1","journal-title":"Algorithmica"},{"key":"32_CR12","first-page":"2","volume":"3","author":"S Avital","year":"1966","unstructured":"Avital, S., Hanani, H.: Graphs. Gilyonot Lematematika 3, 2\u20138 (1966)","journal-title":"Gilyonot Lematematika"},{"issue":"2","key":"32_CR13","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00453-016-0200-5","volume":"79","author":"MA Bekos","year":"2017","unstructured":"Bekos, M.A., Cornelsen, S., Grilli, L., Hong, S., Kaufmann, M.: On the recognition of fan-planar and maximal outer-fan-planar graphs. Algorithmica 79(2), 401\u2013427 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0200-5","journal-title":"Algorithmica"},{"key":"32_CR14","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":"32_CR15","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On optimal 2- and 3-planar graphs. In: Aronov, B., Katz, M.J. (eds.) 33rd International Symposium on Computational Geometry, SoCG 2017, July 4\u20137, 2017, Brisbane, Australia. LIPIcs, vol. 77, pp. 16:1\u201316:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.16","DOI":"10.4230\/LIPIcs.SoCG.2017.16"},{"key":"32_CR16","doi-asserted-by":"publisher","unstructured":"Biedl, T.C., Chaplick, S., Kaufmann, M., Montecchiani, F., N\u00f6llenburg, M., Raftopoulou, C.N.: Layered fan-planar graph drawings. In: Esparza, J., Kr\u00e1l\u2019, D. (eds.) 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24\u201328, 2020, Prague, Czech Republic. LIPIcs, vol. 170, pp. 14:1\u201314:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2020.14","DOI":"10.4230\/LIPIcs.MFCS.2020.14"},{"issue":"1","key":"32_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.7155\/jgaa.00398","volume":"21","author":"C Binucci","year":"2017","unstructured":"Binucci, C., et al.: Algorithms and characterizations for 2-layer fan-planarity: From caterpillar to stegosaurus. J. Graph Algorithms Appl. 21(1), 81\u2013102 (2017). https:\/\/doi.org\/10.7155\/jgaa.00398","journal-title":"J. Graph Algorithms Appl."},{"key":"32_CR18","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., et al.: Fan-planarity: properties and complexity. Theor. Comput. Sci. 589, 76\u201386 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.04.020","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"32_CR19","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. Comb. Theory Ser. B 56(1), 9\u201315 (1992)","journal-title":"J. Comb. Theory Ser. B"},{"key":"32_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-319-73915-1_42","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2018","unstructured":"Chaplick, S., Kryven, M., Liotta, G., L\u00f6ffler, A., Wolff, A.: Beyond outerplanarity. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 546\u2013559. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_42"},{"key":"32_CR21","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). https:\/\/doi.org\/10.1016\/j.tcs.2016.05.017","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"32_CR22","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1007\/s00453-012-9706-7","volume":"68","author":"E Di Giacomo","year":"2012","unstructured":"Di Giacomo, E., Didimo, W., Eades, P., Liotta, G.: 2-layer right angle crossing drawings. Algorithmica 68(4), 954\u2013997 (2012). https:\/\/doi.org\/10.1007\/s00453-012-9706-7","journal-title":"Algorithmica"},{"issue":"7","key":"32_CR23","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.ipl.2013.01.013","volume":"113","author":"W Didimo","year":"2013","unstructured":"Didimo, W.: Density of straight-line 1-planar graph drawings. Inf. Process. Lett. 113(7), 236\u2013240 (2013). https:\/\/doi.org\/10.1016\/j.ipl.2013.01.013","journal-title":"Inf. Process. Lett."},{"issue":"39","key":"32_CR24","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.025","journal-title":"Theor. Comput. Sci."},{"key":"32_CR25","doi-asserted-by":"publisher","unstructured":"Didimo, W., Liotta, G.: The crossing-angle resolution in graph drawing. In: Pach, J. (ed.)Thirty Essays on Geometric Graph Theory, pp. 167\u2013184. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_10","DOI":"10.1007\/978-1-4614-0110-0_10"},{"issue":"1","key":"32_CR26","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/3301281","volume":"52","author":"W Didimo","year":"2019","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Surv. 52(1), 4:1\u20134:37 (2019). https:\/\/doi.org\/10.1145\/3301281","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"32_CR27","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00453-007-9151-1","volume":"52","author":"V Dujmovi\u0107","year":"2008","unstructured":"Dujmovi\u0107, V., et al.: On the parameterized complexity of layered graph drawing. Algorithmica 52(2), 267\u2013292 (2008). https:\/\/doi.org\/10.1007\/s00453-007-9151-1","journal-title":"Algorithmica"},{"issue":"7\u20138","key":"32_CR28","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1016\/j.dam.2012.11.019","volume":"161","author":"P Eades","year":"2013","unstructured":"Eades, P., Liotta, G.: Right angle crossing graphs and 1-planarity. Discret. Appl. Math. 161(7\u20138), 961\u2013969 (2013). https:\/\/doi.org\/10.1016\/j.dam.2012.11.019","journal-title":"Discret. Appl. Math."},{"key":"32_CR29","doi-asserted-by":"publisher","first-page":"52","DOI":"10.2307\/2319261","volume":"80","author":"P Erd\u0151s","year":"1973","unstructured":"Erd\u0151s, P., Guy, R.: Crossing number problems. Am. Math. Mon. 80, 52\u201358 (1973). https:\/\/doi.org\/10.2307\/2319261","journal-title":"Am. Math. Mon."},{"key":"32_CR30","doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Coloring $$K_k$$-free intersection graphs of geometric objects in the plane. In: Symposium on Computational Geometry, pp. 346\u2013354. ACM (2008)","DOI":"10.1145\/1377676.1377735"},{"issue":"1","key":"32_CR31","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)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"32_CR32","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1007\/s00453-014-9890-8","volume":"72","author":"S-H Hong","year":"2014","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 (2014). https:\/\/doi.org\/10.1007\/s00453-014-9890-8","journal-title":"Algorithmica"},{"key":"32_CR33","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.dam.2018.08.018","volume":"255","author":"S Hong","year":"2019","unstructured":"Hong, S., Nagamochi, H.: A linear-time algorithm for testing full outer-2-planarity. Discret. Appl. Math. 255, 234\u2013257 (2019). https:\/\/doi.org\/10.1016\/j.dam.2018.08.018","journal-title":"Discret. Appl. Math."},{"key":"32_CR34","first-page":"6184","volume":"1403","author":"M Kaufmann","year":"2014","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR 1403, 6184 (2014)","journal-title":"CoRR"},{"issue":"1","key":"32_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 Theory 72(1), 30\u201371 (2013). https:\/\/doi.org\/10.1002\/jgt.21630","journal-title":"J. Graph Theory"},{"key":"32_CR36","volume-title":"Complexity Issues in VLSI: Optimal Layouts for the Shuffle-exchange Graph and Other Networks","author":"FT Leighton","year":"1983","unstructured":"Leighton, F.T.: Complexity Issues in VLSI: Optimal Layouts for the Shuffle-exchange Graph and Other Networks. MIT Press, Cambridge, MA, USA (1983)"},{"issue":"4","key":"32_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., Radoicic, R., Tardos, G., T\u00f3th, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Discret. Comput. Geom. 36(4), 527\u2013552 (2006). https:\/\/doi.org\/10.1007\/s00454-006-1264-9","journal-title":"Discret. Comput. Geom."},{"key":"32_CR38","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-44400-8_24","volume":"2866","author":"J Pach","year":"2002","unstructured":"Pach, J., Radoicic, R., T\u00f3th, G.: Relaxing planarity for topological graphs. JCDCG 2866, 221\u2013232 (2002). https:\/\/doi.org\/10.1007\/978-3-540-44400-8_24","journal-title":"JCDCG"},{"issue":"1","key":"32_CR39","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)","journal-title":"Algorithmica"},{"issue":"3","key":"32_CR40","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). https:\/\/doi.org\/10.1007\/BF01215922","journal-title":"Combinatorica"},{"key":"32_CR41","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02996313","volume":"29","author":"G Ringel","year":"1965","unstructured":"Ringel, G.: Ein Sechsfarben problem auf der Kugel. Abh. Math. Sem. Univ. Hamb. 29, 107\u2013117 (1965). https:\/\/doi.org\/10.1007\/BF02996313","journal-title":"Abh. Math. Sem. Univ. Hamb."},{"key":"32_CR42","doi-asserted-by":"publisher","unstructured":"Sugiyama, K.: Graph drawing and applications for software and knowledge engineers. In: Series on Software Engineering and Knowledge Engineering, vol. 11. WorldScientific (2002). https:\/\/doi.org\/10.1142\/4902","DOI":"10.1142\/4902"},{"key":"32_CR43","doi-asserted-by":"publisher","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. SMC-11 11(2), 109\u2013125 (1981). https:\/\/doi.org\/10.1109\/TSMC.1981.4308636","DOI":"10.1109\/TSMC.1981.4308636"},{"key":"32_CR44","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.comgeo.2015.06.001","volume":"50","author":"A Suk","year":"2015","unstructured":"Suk, A., Walczak, B.: New bounds on the maximum number of edges in $$k$$-quasi-planar graphs. Comput. Geom. 50, 24\u201333 (2015)","journal-title":"Comput. Geom."},{"issue":"3","key":"32_CR45","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/PL00009364","volume":"19","author":"P Valtr","year":"1998","unstructured":"Valtr, P.: On geometric graphs with no $$k$$ pairwise parallel edges. Discrete Comput. Geom. 19(3), 461\u2013469 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR46","unstructured":"Walczak, B.: Old and new challenges in coloring graphs with geometric representations. In: Archambault, D., T\u00f3th, C.D. (eds.) Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, 17\u201320 September 2019, Proceedings. Lecture Notes in Computer Science, vol. 11904. Springer, Heidelberg (2019). Invited talk"}],"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-030-68766-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T23:03:56Z","timestamp":1739401436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68766-3_32"}},"subtitle":["Density, Crossing Lemma, Relationships, and Pathwidth"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030687656","9783030687663"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68766-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 2021","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":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2020.cs.ubc.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,02","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}