{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:42Z","timestamp":1759637742043,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_20","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"253-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7602-1524","authenticated-orcid":false,"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3414-7444","authenticated-orcid":false,"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-3538","authenticated-orcid":false,"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4061-8844","authenticated-orcid":false,"given":"Thomas","family":"Schneck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"20_CR1","unstructured":"\u00c1brego, B.M., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Hackl, T., Pammer, J., Pilz, A., Ramos, P., Salazar, G., Vogtenhuber, B.: All good drawings of small complete graphs. In: EuroCG, pp. 57\u201360 (2015)"},{"key":"20_CR2","unstructured":"Ackerman, E.: On topological graphs with at most four crossings per edge. CoRR abs\/1509.01932 (2015)"},{"issue":"3","key":"20_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":"20_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":"20_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05412-3","volume-title":"Proofs from THE BOOK","author":"M Aigner","year":"2004","unstructured":"Aigner, M., Ziegler, G.M.: Proofs from THE BOOK, 3rd edn. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-662-05412-3","edition":"3"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2018.03.005","volume":"723","author":"P Angelini","year":"2018","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Kindermann, P., Schneck, T.: 1-fan-bundle-planar drawings of graphs. Theor. Comput. Sci. 723, 23\u201350 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.03.005","journal-title":"Theor. Comput. Sci."},{"key":"20_CR7","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":"20_CR8","doi-asserted-by":"crossref","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Schneck, T.: Efficient generation of different topological representations of graphs beyond-planarity. CoRR 1908.03042v2 (2019)","DOI":"10.1007\/978-3-030-35802-0_20"},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"Arleo, A., Binucci, C., Di Giacomo, E., Evans, W.S., Grilli, L., Liotta, G., Meijer, H., Montecchiani, F., Whitesides, S., Wismath, S.K.: Visibility representations of boxes in 2.5 dimensions. Comput. Geom. 72, 19\u201333 (2018). https:\/\/doi.org\/10.1016\/j.comgeo.2018.02.007","DOI":"10.1016\/j.comgeo.2018.02.007"},{"key":"20_CR10","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"},{"key":"20_CR11","series-title":"LNCS","first-page":"646","volume-title":"Graph Drawing and Network Visualization","author":"C Bachmaier","year":"2018","unstructured":"Bachmaier, C., Rutter, I., Stumpf, P.: 1-gap planarity of complete bipartite graphs. In: Biedl, T.C., Kerren, A. (eds.) Graph Drawing and Network Visualization. LNCS, vol. 11282, pp. 646\u2013648. Springer, Heidelberg (2018)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2018.05.029","volume":"745","author":"SW Bae","year":"2018","unstructured":"Bae, S.W., Baffier, J., Chun, J., Eades, P., Eickmeyer, K., Grilli, L., Hong, S., Korman, M., Montecchiani, F., Rutter, I., T\u00f3th, C.D.: Gap-planar graphs. Theor. Comput. Sci. 745, 36\u201352 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.05.029","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"20_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)","journal-title":"Algorithmica"},{"key":"20_CR14","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. Comp. Sci. 589, 76\u201386 (2015)","journal-title":"Theor. Comp. Sci."},{"key":"20_CR15","unstructured":"Brandenburg, F.J.: A simple quasi-planar drawing of $$K_{10}$$. In: Graph Drawing. LNCS, vol. 9801, pp. 603\u2013604. Springer (2016)"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.7155\/jgaa.00455","volume":"22","author":"FJ Brandenburg","year":"2018","unstructured":"Brandenburg, F.J.: A first order logic definition of beyond-planar graphs. J. Graph Algorithms Appl. 22(1), 51\u201366 (2018)","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ipl.2018.06.006","volume":"138","author":"FJ Brandenburg","year":"2018","unstructured":"Brandenburg, F.J.: On fan-crossing and fan-crossing free graphs. Inf. Process. Lett. 138, 67\u201371 (2018). https:\/\/doi.org\/10.1016\/j.ipl.2018.06.006","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"20_CR18","doi-asserted-by":"publisher","first-page":"757","DOI":"10.7155\/jgaa.00438","volume":"21","author":"T Bruckdorfer","year":"2017","unstructured":"Bruckdorfer, T., Cornelsen, S., Gutwenger, C., Kaufmann, M., Montecchiani, F., N\u00f6llenburg, M., Wolff, A.: Progress on partial edge drawings. J. Graph Algorithms Appl. 21(4), 757\u2013786 (2017). https:\/\/doi.org\/10.7155\/jgaa.00438","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"20_CR19","first-page":"213","volume":"9","author":"J Cardinal","year":"2018","unstructured":"Cardinal, J., Felsner, S.: Topological drawings of complete bipartite graphs. JoCG 9(1), 213\u2013246 (2018)","journal-title":"JoCG"},{"issue":"4","key":"20_CR20","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-014-9935-z","volume":"73","author":"O Cheong","year":"2015","unstructured":"Cheong, O., Har-Peled, S., Kim, H., Kim, H.: On the number of edges of fan-crossing free graphs. Algorithmica 73(4), 673\u2013695 (2015). https:\/\/doi.org\/10.1007\/s00453-014-9935-z","journal-title":"Algorithmica"},{"issue":"4\u20135","key":"20_CR21","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.dam.2011.11.014","volume":"160","author":"J Czap","year":"2012","unstructured":"Czap, J., Hud\u00e1k, D.: 1-planarity of complete multipartite graphs. Discrete Appl. Math. 160(4\u20135), 505\u2013512 (2012). https:\/\/doi.org\/10.1016\/j.dam.2011.11.014","journal-title":"Discrete Appl. Math."},{"issue":"16","key":"20_CR22","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.ipl.2010.05.023","volume":"110","author":"W Didimo","year":"2010","unstructured":"Didimo, W., Eades, P., Liotta, G.: A characterization of complete bipartite RAC graphs. Inf. Process. Lett. 110(16), 687\u2013691 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"39","key":"20_CR23","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)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-1-4614-0110-0_10","volume-title":"Thirty Essays on Geometric Graph Theory","author":"W Didimo","year":"2013","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, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_10"},{"issue":"1","key":"20_CR25","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)","journal-title":"ACM Comput. Surv."},{"issue":"7\u20138","key":"20_CR26","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. Discrete Appl. Math. 161(7\u20138), 961\u2013969 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"20_CR27","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1007\/s00453-017-0328-y","volume":"80","author":"D Eppstein","year":"2018","unstructured":"Eppstein, D., Kindermann, P., Kobourov, S.G., Liotta, G., Lubiw, A., Maignan, A., Mondal, D., Vosoughpour, H., Whitesides, S., Wismath, S.K.: On the planar split thickness of graphs. Algorithmica 80(3), 977\u2013994 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0328-y","journal-title":"Algorithmica"},{"key":"20_CR28","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/11604686_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E Gioan","year":"2005","unstructured":"Gioan, E.: Complete graph drawings up to triangle mutations. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 139\u2013150. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11604686_13"},{"key":"20_CR30","first-page":"105","volume":"71","author":"HDO Gronau","year":"1990","unstructured":"Gronau, H.D.O., Harborth, H.: Numbers of nonisomorphic drawings for small graphs. Congressus Numerantium 71, 105\u2013114 (1990)","journal-title":"Congressus Numerantium"},{"key":"20_CR31","first-page":"133","volume":"88","author":"H Hadwiger","year":"1943","unstructured":"Hadwiger, H.: \u00dcber eine Klassifikation der Streckenkomplexe. Vierteljschr. Naturforsch. Ges. Z\u00fcrich 88, 133\u2013143 (1943)","journal-title":"Vierteljschr. Naturforsch. Ges. Z\u00fcrich"},{"issue":"1","key":"20_CR32","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02582960","volume":"1","author":"N Hartsfield","year":"1985","unstructured":"Hartsfield, N., Jackson, B., Ringel, G.: The splitting number of the complete graph. Graphs Comb. 1(1), 311\u2013329 (1985). https:\/\/doi.org\/10.1007\/BF02582960","journal-title":"Graphs Comb."},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S., Eades, P.: Effects of crossing angles. In: PacificVis 2008, pp. 41\u201346. IEEE (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"20_CR34","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR 1403.6184 (2014)"},{"key":"20_CR35","unstructured":"Kehribar, Z.: $$K_{5,5}$$ kann nicht $$2$$-planar gezeichnet werden: Analyse und Beweis, Bachelor Thesis, Universit\u00e4t T\u00fcbingen (2018)"},{"issue":"3","key":"20_CR36","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s00454-010-9320-x","volume":"45","author":"J Kyn\u010dl","year":"2011","unstructured":"Kyn\u010dl, J.: Simple realizability of complete abstract topological graphs in P. Discrete Comput. Geom. 45(3), 383\u2013399 (2011). https:\/\/doi.org\/10.1007\/s00454-010-9320-x","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"20_CR37","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00454-013-9535-8","volume":"50","author":"J Kyn\u010dl","year":"2013","unstructured":"Kyn\u010dl, J.: Improved enumeration of simple topological graphs. Discrete Comput. Geom. 50(3), 727\u2013770 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9535-8","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"20_CR38","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1137\/S1052623498334013","volume":"11","author":"P Mutzel","year":"2001","unstructured":"Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. SIAM J. Optimiz. 11(4), 1065\u20131080 (2001). https:\/\/doi.org\/10.1137\/S1052623498334013","journal-title":"SIAM J. Optimiz."},{"issue":"4","key":"20_CR39","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":"20_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)","journal-title":"Combinatorica"},{"issue":"5","key":"20_CR41","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00493-006-0032-z","volume":"26","author":"J Pach","year":"2006","unstructured":"Pach, J., T\u00f3th, G.: How many ways can one draw a graph? Combinatorica 26(5), 559\u2013576 (2006). https:\/\/doi.org\/10.1007\/s00493-006-0032-z","journal-title":"Combinatorica"},{"key":"20_CR42","unstructured":"Rafla, N.H.: The good drawings $$D_n$$ of the complete graph $$K_n$$. Ph.D. thesis, McGill. University, Montreal, Quebec (1988)"},{"key":"20_CR43","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. Hamb. 29, 107\u2013117 (1965)","journal-title":"Abh. Math. Sem. Univ. Hamb."},{"key":"20_CR44","doi-asserted-by":"publisher","first-page":"137","DOI":"10.4064\/fm-41-1-137-145","volume":"41","author":"K Zarankiewicz","year":"1954","unstructured":"Zarankiewicz, K.: On a problem of P. Tur\u00e1n concerning graphs. Fundamenta Mathematicae 41, 137\u2013145 (1954)","journal-title":"Fundamenta Mathematicae"}],"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-35802-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:04:11Z","timestamp":1701133451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","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":"113","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":"34","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":"8","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":"30% - 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.11","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":"12.55","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}