{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T04:26:45Z","timestamp":1769574405652,"version":"3.49.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030929305","type":"print"},{"value":"9783030929312","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92931-2_11","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"149-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Upward Planar Drawings with\u00a0Three and\u00a0More Slopes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8917-5269","authenticated-orcid":false,"given":"Jonathan","family":"Klawitter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7398-718X","authenticated-orcid":false,"given":"Johannes","family":"Zink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-00219-9_36","volume-title":"Graph Drawing","author":"C Bachmaier","year":"2009","unstructured":"Bachmaier, C., Brandenburg, F.J., Brunner, W., Hofmeier, A., Matzeder, M., Unfried, Thomas: Tree drawings on the hexagonal grid. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 372\u2013383. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00219-9_36"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.7155\/jgaa.00287","volume":"17","author":"C Bachmaier","year":"2013","unstructured":"Bachmaier, C., Matzeder, M.: Drawing unordered trees on k-grids. J. Graph Algorithms Appl. 17(2), 103\u2013128 (2013). https:\/\/doi.org\/10.7155\/jgaa.00287","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-030-04414-5_6","volume-title":"Graph Drawing and Network Visualization","author":"MA Bekos","year":"2018","unstructured":"Bekos, M.A., Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F.: Universal slope sets for upward planar drawings. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 77\u201391. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_6"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/s0218195912500045","volume":"22","author":"M de Berg","year":"2012","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(3), 187\u2013206 (2012). https:\/\/doi.org\/10.1142\/s0218195912500045","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"6","key":"11_CR5","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"12","author":"P Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 12(6), 476\u2013497 (1994). https:\/\/doi.org\/10.1007\/BF01188716","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132\u2013169 (1998). https:\/\/doi.org\/10.1137\/S0097539794279626","journal-title":"SIAM J. Comput."},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-18469-7_10","volume-title":"Graph Drawing","author":"W Brunner","year":"2011","unstructured":"Brunner, W., Matzeder, M.: Drawing ordered (k - 1)\u2013any treees (k\u2013grids. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 105\u2013116. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18469-7_10"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-030-35802-0_42","volume-title":"Graph Drawing and Network Visualization","author":"G Br\u00fcckner","year":"2019","unstructured":"Br\u00fcckner, G., Krisam, N.D., Mchedlidze, T.: Level-planar drawings with few slopes. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 559\u2013572. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_42"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-30140-0_16","volume-title":"Algorithms \u2013 ESA 2004","author":"H Chan","year":"2004","unstructured":"Chan, H.: A parameterized algorithm for upward planarity testing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 157\u2013168. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30140-0_16"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","volume":"2","author":"P Crescenzi","year":"1992","unstructured":"Crescenzi, P., Di Battista, G., Piperno, A.: A note on optimal area algorithms for upward drawings of binary trees. Comput. Geom. 2(4), 187\u2013200 (1992). https:\/\/doi.org\/10.1016\/0925-7721(92)90021-J","journal-title":"Comput. Geom."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Culberson, J.C., Rawlins, G.J.E.: Turtlegons: generating simple polygons for sequences of angles. In: Proceedings of 1st Symposium on Computational Geometry (SoCG 1985), pp. 305\u2013310. ACM (1985)","DOI":"10.1145\/323233.323272"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0097-3165(91)90025-C","volume":"56","author":"J Czyzowicz","year":"1991","unstructured":"Czyzowicz, J.: Lattice diagrams with few slopes. J. Comb. Theory Ser. A 56(1), 96\u2013108 (1991). https:\/\/doi.org\/10.1016\/0097-3165(91)90025-C","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0012-365X(90)90201-R","volume":"82","author":"J Czyzowicz","year":"1990","unstructured":"Czyzowicz, J., Pelc, A., Rival, I.: Drawing orders with few slopes. Discrete Math. 82(3), 233\u2013250 (1990). https:\/\/doi.org\/10.1016\/0012-365X(90)90201-R","journal-title":"Discrete Math."},{"key":"11_CR14","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Hoboken (1999)"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61(2), 175\u2013198 (1988). https:\/\/doi.org\/10.1016\/0304-3975(88)90123-5","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"707","DOI":"10.7155\/jgaa.00376","volume":"19","author":"E Di Giacomo","year":"2015","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: Drawing outer 1-planar graphs with few slopes. J. Graph Algorithms Appl. 19(2), 707\u2013741 (2015). https:\/\/doi.org\/10.7155\/jgaa.00376","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2017.12.004","volume":"714","author":"E Di Giacomo","year":"2018","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: Drawing subcubic planar graphs with four slopes and optimal angular resolution. Theor. Comput. Sci. 714, 51\u201373 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2017.12.004","journal-title":"Theor. Comput. Sci."},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"101628","DOI":"10.1016\/j.comgeo.2020.101628","volume":"90","author":"E Di Giacomo","year":"2020","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: 1-bend upward planar slope number of SP-digraphs. Comput. Geom. 90, 101628 (2020). https:\/\/doi.org\/10.1016\/j.comgeo.2020.101628","journal-title":"Comput. Geom."},{"issue":"4","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/070696854","volume":"23","author":"W Didimo","year":"2010","unstructured":"Didimo, W., Giordano, F., Liotta, G.: Upward spirality and upward planarity testing. SIAM J. Discrete Math. 23(4), 1842\u20131899 (2010). https:\/\/doi.org\/10.1137\/070696854","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"11_CR20","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.comgeo.2006.09.002","volume":"38","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. Comput. Geom. 38(3), 194\u2013212 (2007). https:\/\/doi.org\/10.1016\/j.comgeo.2006.09.002","journal-title":"Comput. Geom."},{"issue":"3","key":"11_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.comgeo.2006.08.002","volume":"38","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Suderman, M., Wood, D.R.: Graph drawings with few slopes. Comput. Geom. 38(3), 181\u2013193 (2007). https:\/\/doi.org\/10.1016\/j.comgeo.2006.08.002","journal-title":"Comput. Geom."},{"issue":"03","key":"11_CR22","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1142\/S021819590800260X","volume":"18","author":"F Frati","year":"2008","unstructured":"Frati, F.: On minimum area planar upward drawings of directed trees and other families of directed acyclic graphs. Int. J. Comput. Geom. Appl. 18(03), 251\u2013271 (2008). https:\/\/doi.org\/10.1142\/S021819590800260X","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"11_CR23","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601\u2013625 (2001). https:\/\/doi.org\/10.1137\/S0097539794277123","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0020-0190(89)90105-1","volume":"31","author":"RI Hartley","year":"1989","unstructured":"Hartley, R.I.: Drawing polygons given angle sequences. Inf. Process. Lett. 31(1), 31\u201333 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"05","key":"11_CR25","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1142\/S0129054106004285","volume":"17","author":"P Healy","year":"2006","unstructured":"Healy, P., Lynch, K.: Two fixed-parameter tractable algorithms for testing upward planarity. Int. J. Found. Comput. Sci. 17(05), 1095\u20131114 (2006). https:\/\/doi.org\/10.1142\/S0129054106004285","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"11_CR26","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1007\/s00373-012-1157-z","volume":"29","author":"V Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Jel\u00ednkov\u00e1, E., Kratochv\u00edl, J., Lidick\u00fd, B., Tesa\u0159, M., Vysko\u010dil, T.: The planar slope number of planar partial 3-trees of bounded degree. Graphs Comb. 29(4), 981\u20131005 (2013). https:\/\/doi.org\/10.1007\/s00373-012-1157-z","journal-title":"Graphs Comb."},{"issue":"2","key":"11_CR27","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/100815001","volume":"27","author":"B Keszegh","year":"2013","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D.: Drawing planar graphs of bounded degree with few slopes. SIAM J. Discrete Math. 27(2), 1171\u20131183 (2013). https:\/\/doi.org\/10.1137\/100815001","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"11_CR28","doi-asserted-by":"publisher","first-page":"501","DOI":"10.7155\/jgaa.00474","volume":"22","author":"P Kindermann","year":"2018","unstructured":"Kindermann, P., Meulemans, W., Schulz, A.: Experimental analysis of the accessibility of drawings with few segments. J. Graph Algorithms Appl. 22(3), 501\u2013518 (2018). https:\/\/doi.org\/10.7155\/jgaa.00474","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR29","unstructured":"Klawitter, J., Mchedlidze, T.: Upward planar drawings with two slopes. Arxiv report (2021), http:\/\/arxiv.org\/abs\/2106.02839"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Klawitter, J., Zink, J.: Upward planar drawings with three slopes. Arxiv report (2021). http:\/\/arxiv.org\/abs\/2103.06801","DOI":"10.1007\/978-3-030-92931-2_11"},{"issue":"5","key":"11_CR31","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.comgeo.2014.01.003","volume":"47","author":"K Knauer","year":"2014","unstructured":"Knauer, K., Micek, P., Walczak, B.: Outerplanar graph drawings with few slopes. Comput. Geom. 47(5), 614\u2013624 (2014). https:\/\/doi.org\/10.1016\/j.comgeo.2014.01.003","journal-title":"Comput. Geom."},{"key":"11_CR32","unstructured":"Kraus, R.: Level-au\u00dfenplanare zeichnungen mit wenigen steigungen. Bachelor Thesis, University of W\u00fcrzburg (2020)"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-319-03841-4_36","volume-title":"Graph Drawing","author":"W Lenhart","year":"2013","unstructured":"Lenhart, W., Liotta, G., Mondal, D., Nishat, R.I.: Planar and plane slope number of partial 2-trees. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 412\u2013423. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_36"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-25878-7_25","volume-title":"Graph Drawing","author":"P Mukkamala","year":"2012","unstructured":"Mukkamala, P., P\u00e1lv\u00f6lgyi, D.: Drawing cubic graphs with the four basic slopes. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 254\u2013265. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25878-7_25"},{"issue":"9","key":"11_CR35","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.comgeo.2009.01.005","volume":"42","author":"P Mukkamala","year":"2009","unstructured":"Mukkamala, P., Szegedy, M.: Geometric representation of cubic graphs with four directions. Comput. Geom. 42(9), 842\u2013851 (2009). https:\/\/doi.org\/10.1016\/j.comgeo.2009.01.005","journal-title":"Comput. Geom."},{"key":"11_CR36","unstructured":"N\u00f6llenburg, M.: Automated drawing of metro maps. Diploma Thesis, University of Karlsruhe (TH) (2010)"},{"issue":"5","key":"11_CR37","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1109\/TVCG.2010.81","volume":"17","author":"M N\u00f6llenburg","year":"2011","unstructured":"N\u00f6llenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans. Visual. Comput. Graph. 17(5), 626\u2013641 (2011). https:\/\/doi.org\/10.1109\/TVCG.2010.81","journal-title":"IEEE Trans. Visual. Comput. Graph."},{"issue":"1","key":"11_CR38","doi-asserted-by":"publisher","first-page":"N1","DOI":"10.37236\/1139","volume":"13","author":"J Pach","year":"2006","unstructured":"Pach, J., P\u00e1lv\u00f6lgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electron. J. Comb. 13(1), N1 (2006)","journal-title":"Electron. J. Comb."},{"key":"11_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-58950-3_385","volume-title":"Graph Drawing","author":"A Papakostas","year":"1995","unstructured":"Papakostas, A.: Upward planarity testing of outerplanar dags (extended abstract). In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 298\u2013306. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-58950-3_385"},{"key":"11_CR40","unstructured":"Quapil, V.: Bachelor thesis on slope drawings. In: Jungeblut, P (ed.) Karlsruhe Institute of Technology (2021)"},{"issue":"2","key":"11_CR41","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972). https:\/\/doi.org\/10.1137\/0201010","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR42","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1093\/comjnl\/37.2.139","volume":"37","author":"GA Wade","year":"1994","unstructured":"Wade, G.A., Chu, J.H.: Drawability of complete graphs using a minimal slope set. Comput. J. 37(2), 139\u2013142 (1994). https:\/\/doi.org\/10.1093\/comjnl\/37.2.139","journal-title":"Comput. J."}],"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-92931-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:51Z","timestamp":1766365311000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 December 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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo.inf.uni-tuebingen.de\/gd2021\/","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":"74","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":"23","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":"5","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":"31% - 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":"8.6","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"}]}}