{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:50:16Z","timestamp":1770540616110,"version":"3.49.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030044138","type":"print"},{"value":"9783030044145","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-030-04414-5_19","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T18:20:45Z","timestamp":1545070845000},"page":"271-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henry","family":"F\u00f6rster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Geckeler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Holl\u00e4nder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amad\u00e4us M.","family":"Spallek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Splett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/100819564","volume":"26","author":"E Ackerman","year":"2012","unstructured":"Ackerman, E., Fulek, R., T\u00f3th, C.D.: Graphs that admit polyline drawings with few crossing angles. SIAM J. Discrete Math. 26(1), 305\u2013320 (2012). https:\/\/doi.org\/10.1137\/100819564","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7155\/jgaa.00217","volume":"15","author":"P Angelini","year":"2011","unstructured":"Angelini, P., et al.: On the perspectives opened by right angle crossing drawings. J. Graph Algorithms Appl. 15(1), 53\u201378 (2011). https:\/\/doi.org\/10.7155\/jgaa.00217","journal-title":"J. Graph Algorithms Appl."},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-642-34191-5_19","volume-title":"Computational Geometry","author":"P Angelini","year":"2012","unstructured":"Angelini, P., et al.: Large angle crossing drawings of planar graphs in subquadratic area. In: M\u00e1rquez, A., Ramos, P., Urrutia, J. (eds.) EGC 2011. LNCS, vol. 7579, pp. 200\u2013209. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34191-5_19"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"569","DOI":"10.7155\/jgaa.00274","volume":"16","author":"EN Argyriou","year":"2012","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: The straight-line RAC drawing problem is NP-hard. J. Graph Algorithms Appl. 16(2), 569\u2013597 (2012). https:\/\/doi.org\/10.7155\/jgaa.00274","journal-title":"J. Graph Algorithms Appl."},{"issue":"7","key":"19_CR5","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1093\/comjnl\/bxs088","volume":"56","author":"EN Argyriou","year":"2013","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: Maximizing the total resolution of graphs. Comput. J. 56(7), 887\u2013900 (2013). https:\/\/doi.org\/10.1093\/comjnl\/bxs088","journal-title":"Comput. J."},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.comgeo.2011.11.008","volume":"45","author":"K Arikushi","year":"2012","unstructured":"Arikushi, K., Fulek, R., Keszegh, B., Moric, F., T\u00f3th, C.D.: Graphs that admit right angle crossing drawings. Comput. Geom. 45(4), 169\u2013177 (2012). https:\/\/doi.org\/10.1016\/j.comgeo.2011.11.008","journal-title":"Comput. Geom."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.dam.2017.08.015","volume":"232","author":"C Bachmaier","year":"2017","unstructured":"Bachmaier, C., Brandenburg, F.J., Hanauer, K., Neuwirth, D., Reislhuber, J.: NIC-planar graphs. Discrete Appl. Math. 232, 23\u201340 (2017). https:\/\/doi.org\/10.1016\/j.dam.2017.08.015","journal-title":"Discrete Appl. Math."},{"key":"19_CR8","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). https:\/\/doi.org\/10.1016\/j.tcs.2017.05.039","journal-title":"Theor. Comput. Sci."},{"key":"19_CR9","unstructured":"Bekos, M.A., et al.: A heuristic approach towards drawings of graphs with high crossing resolution. CoRR, abs\/xxxx.yyyy (2018). https:\/\/arxiv.org\/abs\/xxxx.yyyy"},{"key":"19_CR10","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). https:\/\/doi.org\/10.1016\/j.tcs.2016.04.026","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990). https:\/\/doi.org\/10.1007\/BF02122694","journal-title":"Combinatorica"},{"key":"19_CR12","unstructured":"Di Battista, G., Didimo, W.: GDToolkit. In: Tamassia, R. (ed), Handbook on Graph Drawing and Visualization, pp. 571\u2013597. Chapman and Hall\/CRC (2013)"},{"key":"19_CR13","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River (1999)"},{"issue":"16","key":"19_CR14","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). https:\/\/doi.org\/10.1016\/j.ipl.2010.05.023","journal-title":"Inf. Process. Lett."},{"issue":"39","key":"19_CR15","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":"19_CR16","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. CoRR, abs\/1804.07257 arXiv:1803.03705 (2018)"},{"key":"19_CR17","doi-asserted-by":"publisher","unstructured":"Didimo, W., Liotta, G., Romeo, S.A.: Graph visualization techniques for conceptual web site traffic analysis. In: IEEE PacificVis, pp. 193\u2013200. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/PACIFICVIS.2010.5429593","DOI":"10.1109\/PACIFICVIS.2010.5429593"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-18469-7_15","volume-title":"Graph Drawing","author":"W Didimo","year":"2011","unstructured":"Didimo, W., Liotta, G., Romeo, S.A.: Topology-driven force-directed algorithms. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 165\u2013176. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18469-7_15"},{"key":"19_CR19","unstructured":"Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. Chicago J. Theor. Comput. Sci. (2011). http:\/\/cjtcs.cs.uchicago.edu\/articles\/CATS2010\/4\/contents.html"},{"key":"19_CR20","first-page":"149","volume":"42","author":"P Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 149\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"issue":"7\u20138","key":"19_CR21","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). https:\/\/doi.org\/10.1016\/j.dam.2012.11.019","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"19_CR22","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11(4), 379\u2013403 (1994). https:\/\/doi.org\/10.1007\/BF01187020","journal-title":"Algorithmica"},{"issue":"5","key":"19_CR23","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/0222063","volume":"22","author":"M Formann","year":"1993","unstructured":"Formann, M., et al.: Drawing graphs in the plane with high resolution. SIAM J. Comput. 22(5), 1035\u20131052 (1993). https:\/\/doi.org\/10.1137\/0222063","journal-title":"SIAM J. Comput."},{"issue":"11","key":"19_CR24","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exper. 21(11), 1129\u20131164 (1991). https:\/\/doi.org\/10.1002\/spe.4380211102","journal-title":"Softw. Pract. Exper."},{"issue":"4","key":"19_CR25","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1007\/s00453-012-9706-7","volume":"68","author":"ED Giacomo","year":"2014","unstructured":"Giacomo, E.D., Didimo, W., Eades, P., Liotta, G.: 2-layer right angle crossing drawings. Algorithmica 68(4), 954\u2013997 (2014). https:\/\/doi.org\/10.1007\/s00453-012-9706-7","journal-title":"Algorithmica"},{"issue":"3","key":"19_CR26","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00224-010-9275-6","volume":"49","author":"ED Giacomo","year":"2011","unstructured":"Giacomo, E.D., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing resolution of non-planar graph drawings. Theory Comput. Syst. 49(3), 565\u2013575 (2011). https:\/\/doi.org\/10.1007\/s00224-010-9275-6","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"19_CR27","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/net.3230240203","volume":"24","author":"O Goldschmidt","year":"1994","unstructured":"Goldschmidt, O., Takvorian, A.: An efficient graph planarization two-phase heuristic. Networks 24(2), 69\u201373 (1994). https:\/\/doi.org\/10.1002\/net.3230240203","journal-title":"Networks"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-37623-2_13","volume-title":"Graph Drawing","author":"C Gutwenger","year":"1998","unstructured":"Gutwenger, C., Mutzel, P.: Planar polyline drawings with good angular resolution. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 167\u2013182. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-37623-2_13"},{"key":"19_CR29","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"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Hong, S., Tokuyama, T.: Algorithmics for beyond planar graphs. NII Shonan Meeting Seminar 089, 27 November\u20131 December 2016","DOI":"10.1007\/978-981-15-6533-5_1"},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Huang, W.: Using eye tracking to investigate graph layout effects. In: Hong, S., Ma, K. (eds.) APVIS, pp. 97\u2013100. IEEE Computer Society (2007). https:\/\/doi.org\/10.1109\/APVIS.2007.329282","DOI":"10.1109\/APVIS.2007.329282"},{"issue":"4","key":"19_CR32","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.jvlc.2014.03","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). https:\/\/doi.org\/10.1016\/j.jvlc.2014.03","journal-title":"J. Vis. Lang. Comput."},{"issue":"4","key":"19_CR33","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.jvlc.2011.12.002","volume":"24","author":"W Huang","year":"2013","unstructured":"Huang, W., Eades, P., Hong, S., Lin, C.: Improving multiple aesthetics produces better graph drawings. J. Vis. Lang. Comput. 24(4), 262\u2013272 (2013). https:\/\/doi.org\/10.1016\/j.jvlc.2011.12.002","journal-title":"J. Vis. Lang. Comput."},{"issue":"1","key":"19_CR34","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16(1), 4\u201332 (1996). https:\/\/doi.org\/10.1007\/BF02086606","journal-title":"Algorithmica"},{"issue":"November","key":"19_CR35","first-page":"6","volume":"16452","author":"M Kaufmann","year":"2016","unstructured":"Kaufmann, M., Kobourov, S., Pach, J., Hong, S.: Beyond planar graphs: Algorithmics and combinatorics. Dagstuhl Seminar 16452(November), 6\u201311 (2016)","journal-title":"Dagstuhl Seminar"},{"key":"19_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44969-8","volume-title":"Drawing Graphs, Methods and Models","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs, Methods and Models. LNCS, vol. 2025. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44969-8"},{"key":"19_CR37","unstructured":"Liotta, G.: Graph drawing beyond planarity: some results and open problems. SoCG Week, Invited talk, 4th July 2017"},{"key":"19_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-18469-7_40","volume-title":"Graph Drawing","author":"Q Nguyen","year":"2011","unstructured":"Nguyen, Q., Eades, P., Hong, S.-H., Huang, W.: Large crossing angles in circular layouts. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 397\u2013399. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18469-7_40"},{"issue":"2","key":"19_CR39","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0953-5438(00)00032-1","volume":"13","author":"HC Purchase","year":"2000","unstructured":"Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interact. Comput. 13(2), 147\u2013162 (2000)","journal-title":"Interact. Comput."},{"issue":"2","key":"19_CR40","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"19_CR41","volume-title":"Handbook on Graph Drawing and Visualization","year":"2013","unstructured":"Tamassia, R. (ed.): Handbook on Graph Drawing and Visualization. Chapman and Hall\/CRC, Boca Raton (2013)"},{"key":"19_CR42","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-18638-7_8","volume-title":"Graph Drawing Software","author":"R Wiese","year":"2004","unstructured":"Wiese, R., Eiglsperger, M., Kaufmann, M.: yFiles - visualization and automatic layout of graphs. In: J\u00fcnger, M., Mutzel, P., et al. (eds.) Graph Drawing Software, pp. 173\u2013191. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-642-18638-7_8"}],"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-04414-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:19:59Z","timestamp":1710249599000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04414-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030044138","9783030044145"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04414-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 December 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":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dccg.upc.edu\/gd2018\/","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":"85","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":"41","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":"0","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":"48% - 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.25","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.92","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 book also contains 1 full invited paper and 1 contest report","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}