{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:26:49Z","timestamp":1743150409101,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389054"},{"type":"electronic","value":"9783031389061"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38906-1_29","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"444-459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Linear Layouts of\u00a0Bipartite Planar Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1441-4189","authenticated-orcid":false,"given":"Henry","family":"F\u00f6rster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-3538","authenticated-orcid":false,"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1961-4531","authenticated-orcid":false,"given":"Laura","family":"Merker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4089-673X","authenticated-orcid":false,"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6457-516X","authenticated-orcid":false,"given":"Chrysanthi","family":"Raftopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-030-68766-3_5","volume-title":"Graph Drawing and Network Visualization","author":"JM Alam","year":"2020","unstructured":"Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: Lazy queue layouts of posets. In: GD 2020. LNCS, vol. 12590, pp. 55\u201368. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_5"},{"issue":"9","key":"29_CR2","doi-asserted-by":"publisher","first-page":"2564","DOI":"10.1007\/s00453-020-00697-4","volume":"82","author":"JM Alam","year":"2020","unstructured":"Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: Queue layouts of planar 3-trees. Algorithmica 82(9), 2564\u20132585 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00697-4","journal-title":"Algorithmica"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2022.09.019","volume":"936","author":"P Angelini","year":"2022","unstructured":"Angelini, P., Bekos, M.A., Kindermann, P., Mchedlidze, T.: On mixed linear layouts of series-parallel graphs. Theor. Comput. Sci. 936, 129\u2013138 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.09.019","journal-title":"Theor. Comput. Sci."},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-25870-1_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"C Auer","year":"2011","unstructured":"Auer, C., Glei\u00dfner, A.: Characterizations of deque and queue graphs. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 35\u201346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25870-1_5"},{"issue":"4","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1007\/s00453-018-0487-5","volume":"81","author":"MJ Bannister","year":"2018","unstructured":"Bannister, M.J., Devanny, W.E., Dujmovi\u0107, V., Eppstein, D., Wood, D.R.: Track layouts, layered path decompositions, and leveled planarity. Algorithmica 81(4), 1561\u20131583 (2018). https:\/\/doi.org\/10.1007\/s00453-018-0487-5","journal-title":"Algorithmica"},{"issue":"6","key":"29_CR6","doi-asserted-by":"publisher","first-page":"2243","DOI":"10.1137\/130908051","volume":"42","author":"GD Battista","year":"2013","unstructured":"Battista, G.D., Frati, F., Pach, J.: On the queue number of planar graphs. SIAM J. Comput. 42(6), 2243\u20132285 (2013). https:\/\/doi.org\/10.1137\/130908051","journal-title":"SIAM J. Comput."},{"key":"29_CR7","doi-asserted-by":"publisher","unstructured":"Bekos, M., Gronemann, M., Raftopoulou, C.N.: An improved upper bound on the queue number of planar graphs. Algorithmica 1\u201319 (2022). https:\/\/doi.org\/10.1007\/s00453-022-01037-4","DOI":"10.1007\/s00453-022-01037-4"},{"issue":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/s00453-016-0203-2","volume":"79","author":"MA Bekos","year":"2016","unstructured":"Bekos, M.A., Bruckdorfer, T., Kaufmann, M., Raftopoulou, C.N.: The book thickness of 1-planar graphs is constant. Algorithmica 79(2), 444\u2013465 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0203-2","journal-title":"Algorithmica"},{"key":"29_CR9","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Da Lozzo, G., Hlinen\u00fd, P., Kaufmann, M.: Graph product structure for h-framed graphs. CoRR abs\/2204.11495 (2022). https:\/\/doi.org\/10.48550\/arXiv.2204.11495","DOI":"10.48550\/arXiv.2204.11495"},{"issue":"5","key":"29_CR10","doi-asserted-by":"publisher","first-page":"1487","DOI":"10.1137\/19M125340X","volume":"48","author":"MA Bekos","year":"2019","unstructured":"Bekos, M.A., F\u00f6rster, H., Gronemann, M., Mchedlidze, T., Montecchiani, F., Raftopoulou, C.N., Ueckerdt, T.: Planar graphs of bounded degree have bounded queue number. SIAM J. Comput. 48(5), 1487\u20131502 (2019). https:\/\/doi.org\/10.1137\/19M125340X","journal-title":"SIAM J. Comput."},{"key":"29_CR11","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Kaufmann, M., Klute, F., Pupyrev, S., Raftopoulou, C.N., Ueckerdt, T.: Four pages are indeed necessary for planar graphs. J. Comput. Geom. 11(1), 332\u2013353 (2020). https:\/\/doi.org\/10.20382\/jocg.v11i1a12","DOI":"10.20382\/jocg.v11i1a12"},{"key":"29_CR12","doi-asserted-by":"publisher","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theory Ser. B 27(3), 320\u2013331 (1979). https:\/\/doi.org\/10.1016\/0095-8956(79)90021-2","DOI":"10.1016\/0095-8956(79)90021-2"},{"issue":"3","key":"29_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/jgaa.00597","volume":"26","author":"S Bhore","year":"2022","unstructured":"Bhore, S., Ganian, R., Montecchiani, F., N\u00f6llenburg, M.: Parameterized algorithms for queue layouts. J. Graph Algorithms Appl. 26(3), 335\u2013352 (2022). https:\/\/doi.org\/10.7155\/jgaa.00597","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"29_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.7155\/jgaa.00018","volume":"3","author":"TC Biedl","year":"1999","unstructured":"Biedl, T.C., Shermer, T.C., Whitesides, S., Wismath, S.K.: Bounds for orthogonal 3D graph drawing. J. Graph Algorithms Appl. 3(4), 63\u201379 (1999). https:\/\/doi.org\/10.7155\/jgaa.00018","journal-title":"J. Graph Algorithms Appl."},{"issue":"6","key":"29_CR15","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996). https:\/\/doi.org\/10.1137\/S0097539793251219","journal-title":"SIAM J. Comput."},{"key":"29_CR16","doi-asserted-by":"publisher","unstructured":"Bose, P., Morin, P., Odak, S.: An optimal algorithm for product structure in planar graphs. In: Czumaj, A., Xin, Q. (eds.) SWAT 2022. LIPIcs, vol. 227, pp. 19:1\u201319:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2022.19","DOI":"10.4230\/LIPIcs.SWAT.2022.19"},{"key":"29_CR17","doi-asserted-by":"publisher","unstructured":"Campbell, R., et al.: Product structure of graph classes with bounded treewidth. CoRR abs\/2206.02395 (2022). https:\/\/doi.org\/10.48550\/arXiv.2206.02395","DOI":"10.48550\/arXiv.2206.02395"},{"issue":"1","key":"29_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"FRK Chung","year":"1987","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebraic Discrete Methods 8(1), 33\u201358 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-030-35802-0_35","volume-title":"Graph Drawing and Network Visualization","author":"P de Col","year":"2019","unstructured":"de Col, P., Klute, F., N\u00f6llenburg, M.: Mixed linear layouts: complexity, heuristics, and experiments. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 460\u2013467. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_35"},{"key":"29_CR20","doi-asserted-by":"publisher","unstructured":"Dujmovi\u0107, V., Eppstein, D., Hickingbotham, R., Morin, P., Wood, D.R.: Stack-number is not bounded by queue-number. Combinatorica (2), 1\u201314 (2021). https:\/\/doi.org\/10.1007\/s00493-021-4585-7","DOI":"10.1007\/s00493-021-4585-7"},{"issue":"1","key":"29_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.7155\/jgaa.00454","volume":"22","author":"V Dujmovi\u0107","year":"2018","unstructured":"Dujmovi\u0107, V., Frati, F.: Stack and queue layouts via layered separators. J. Graph Algorithms Appl. 22(1), 89\u201399 (2018). https:\/\/doi.org\/10.7155\/jgaa.00454","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"29_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3385731","volume":"67","author":"V Dujmovi\u0107","year":"2020","unstructured":"Dujmovi\u0107, V., Joret, G., Micek, P., Morin, P., Ueckerdt, T., Wood, D.R.: Planar graphs have bounded queue-number. J. ACM (JACM) 67(4), 1\u201338 (2020). https:\/\/doi.org\/10.1145\/3385731","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"29_CR23","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/S0097539702416141","volume":"34","author":"V Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. Comput. 34(3), 553\u2013579 (2005). https:\/\/doi.org\/10.1137\/S0097539702416141","journal-title":"SIAM J. Comput."},{"issue":"2","key":"29_CR24","first-page":"497","volume":"6","author":"V Dujmovic","year":"2004","unstructured":"Dujmovic, V., P\u00f3r, A., Wood, D.R.: Track layouts of graphs. Discret. Math. Theor. Comput. Sci. 6(2), 497\u2013522 (2004)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"29_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-24595-7_18","volume-title":"Graph Drawing","author":"V Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Three-dimensional grid drawings with sub-quadratic volume. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 190\u2013201. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_18"},{"issue":"3","key":"29_CR26","first-page":"115","volume":"12","author":"S Felsner","year":"2010","unstructured":"Felsner, S., Huemer, C., Kappes, S., Orden, D.: Binary labelings for plane quadrangulations and their relatives. Discret. Math. Theor. Comput. Sci. 12(3), 115\u2013138 (2010)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"29_CR27","doi-asserted-by":"publisher","unstructured":"F\u00f6rster, H., Kaufmann, M., Merker, L., Pupyrev, S., Raftopoulou, C.: Linear layouts of bipartite planar graphs. arXiv abs\/2305.16087 (2023). https:\/\/doi.org\/10.48550\/arXiv.2305.16087","DOI":"10.48550\/arXiv.2305.16087"},{"issue":"3","key":"29_CR28","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/0405031","volume":"5","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discret. Math. 5(3), 398\u2013412 (1992). https:\/\/doi.org\/10.1137\/0405031","journal-title":"SIAM J. Discret. Math."},{"issue":"5","key":"29_CR29","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/0221055","volume":"21","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput. 21(5), 927\u2013958 (1992). https:\/\/doi.org\/10.1137\/0221055","journal-title":"SIAM J. Comput."},{"key":"29_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-030-68766-3_3","volume-title":"Graph Drawing and Network Visualization","author":"L Merker","year":"2020","unstructured":"Merker, L., Ueckerdt, T.: The local queue number of graphs with bounded treewidth. In: GD 2020. LNCS, vol. 12590, pp. 26\u201339. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_3"},{"issue":"5","key":"29_CR31","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1007\/s00453-020-00793-5","volume":"83","author":"P Morin","year":"2021","unstructured":"Morin, P.: A fast algorithm for the product structure of planar graphs. Algorithmica 83(5), 1544\u20131558 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00793-5","journal-title":"Algorithmica"},{"key":"29_CR32","unstructured":"Pupyrev, S.: A SAT-based solver for constructing optimal linear layouts of graphs. https:\/\/github.com\/spupyrev\/bob"},{"key":"29_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-73915-1_17","volume-title":"Graph Drawing and Network Visualization","author":"S Pupyrev","year":"2018","unstructured":"Pupyrev, S.: Mixed linear layouts of planar graphs. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 197\u2013209. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_17"},{"issue":"3","key":"29_CR34","doi-asserted-by":"publisher","first-page":"323","DOI":"10.7155\/jgaa.00536","volume":"24","author":"S Pupyrev","year":"2020","unstructured":"Pupyrev, S.: Improved bounds for track numbers of planar graphs. J. Graph Algorithms Appl. 24(3), 323\u2013341 (2020). https:\/\/doi.org\/10.7155\/jgaa.00536","journal-title":"J. Graph Algorithms Appl."},{"key":"29_CR35","doi-asserted-by":"publisher","unstructured":"Ueckerdt, T., Wood, D.R., Yi, W.: An improved planar graph product structure theorem. Electron. J. Comb. 29(2) (2022). https:\/\/doi.org\/10.37236\/10614","DOI":"10.37236\/10614"},{"key":"29_CR36","doi-asserted-by":"publisher","unstructured":"Wiechert, V.: On the queue-number of graphs with bounded tree-width. Electr. J. Comb. 24(1), P1.65 (2017). https:\/\/doi.org\/10.37236\/6429","DOI":"10.37236\/6429"},{"key":"29_CR37","doi-asserted-by":"publisher","unstructured":"Wood, D.R.: Product structure of graph classes with strongly sublinear separators. CoRR abs\/2208.10074 (2022). https:\/\/doi.org\/10.48550\/arXiv.2208.10074","DOI":"10.48550\/arXiv.2208.10074"},{"issue":"1","key":"29_CR38","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci. 38(1), 36\u201367 (1989). https:\/\/doi.org\/10.1016\/0022-0000(89)90032-9","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR39","doi-asserted-by":"publisher","unstructured":"Yannakakis, M.: Planar graphs that need four pages. J. Comb. Theory Ser. B 145, 241\u2013263 (2020). https:\/\/doi.org\/10.1016\/j.jctb.2020.05.008","DOI":"10.1016\/j.jctb.2020.05.008"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:08:21Z","timestamp":1690474101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","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":"92","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":"47","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":"51% - 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.1","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":"10","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)"}}]}}