{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:10Z","timestamp":1759639090306,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_14","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"161-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Geometric Representations of Apex Graphs is NP-Hard"],"prefix":"10.1007","author":[{"given":"Dibyayan","family":"Chakraborty","sequence":"first","affiliation":[]},{"given":"Kshitij","family":"Gajjar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"issue":"3\u20134","key":"14_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"PK Agarwal","year":"1998","unstructured":"Agarwal, P.K., Van Kreveld, M.J.: Label placement by maximum independent set in rectangles. Comput. Geom. 11(3\u20134), 209\u2013218 (1998)","journal-title":"Comput. Geom."},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1070\/SM1970v010n03ABEH001677","volume":"10","author":"EM Andreev","year":"1970","unstructured":"Andreev, E.M.: On convex polyhedra in Lobacevskii spaces. Math. USSR-Sbornik 10(3), 413 (1970)","journal-title":"Math. USSR-Sbornik"},{"key":"14_CR3","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":"11","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1073\/pnas.45.11.1607","volume":"45","author":"S Benzer","year":"1959","unstructured":"Benzer, S.: On the topology of the genetic fine structure. Proc. Natl. Acad. Sci. U.S.A. 45(11), 1607 (1959)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theory Ser. B 27(3), 320\u2013331 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-319-27261-0_37","volume-title":"Graph Drawing and Network Visualization","author":"C Bowen","year":"2015","unstructured":"Bowen, C., Durocher, S., L\u00f6ffler, M., Rounds, A., Schulz, A., T\u00f3th, C.D.: Realization of simply connected polygonal linkages and recognition of unit disk contact trees. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 447\u2013459. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_37"},{"issue":"1\u20132","key":"14_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. 9(1\u20132), 3\u201324 (1998)","journal-title":"Comput. Geom."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Gon\u00e7alves, D.: Every planar graph is the intersection graph of segments in the plane. In: STOC, pp. 631\u2013638 (2009)","DOI":"10.1145\/1536414.1536500"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s00454-009-9196-9","volume":"43","author":"J Chalopin","year":"2010","unstructured":"Chalopin, J., Gon\u00e7alves, D., Ochem, P.: Planar graphs have 1-string representations. Discrete Comput. Geom. 43(3), 626\u2013647 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-34611-8_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Chaplick","year":"2012","unstructured":"Chaplick, S., Jel\u00ednek, V., Kratochv\u00edl, J., Vysko\u010dil, T.: Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 274\u2013285. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34611-8_28"},{"key":"14_CR12","unstructured":"Chmel, P.: Algorithmic aspects of intersection representations. Bachelor\u2019s thesis (2020)"},{"key":"14_CR13","unstructured":"Chung, F., Leighton, F.T., Rosenberg, A.: Diogenes: a methodology for designing fault-tolerant VLSI processor arrays. Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Microsystems Program Office (1983)"},{"key":"14_CR14","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: A graph layout problem with applications to VLSI design (1984)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/3-540-46648-7_35","volume-title":"Graph Drawing","author":"N de Castro","year":"1999","unstructured":"de Castro, N., Cobos, F.J., Dana, J.C., M\u00e1rquez, A., Noy, M.: Triangle-free planar graphs as segments intersection graphs. In: Kratochv\u00edyl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 341\u2013350. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46648-7_35"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/JSAC.2004.837364","volume":"23","author":"J Gao","year":"2005","unstructured":"Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanners for routing in mobile networks. IEEE J. Sel. Areas Commun. 23(1), 174\u2013185 (2005)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"14_CR18","unstructured":"Ga\u0327sieniec, L., Klasing, R., Radzik, T.: IWOCA 2020, vol. 12126. Springer, Cham (2020)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-030-30786-8_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Gon\u00e7alves","year":"2019","unstructured":"Gon\u00e7alves, D.: 3-colorable planar graphs have an intersection segment representation using 3 slopes. In: Sau, I., Thilikos, D.M. (eds.) WG 2019. LNCS, vol. 11789, pp. 351\u2013363. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30786-8_27"},{"issue":"3","key":"14_CR20","doi-asserted-by":"publisher","first-page":"293","DOI":"10.7155\/jgaa.00533","volume":"24","author":"D Gon\u00e7alves","year":"2020","unstructured":"Gon\u00e7alves, D.: Not all planar graphs are in PURE-4-DIR. J. Graph Algorithms Appl. 24(3), 293\u2013301 (2020)","journal-title":"J. Graph Algorithms Appl."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, D., Isenmann, L., Pennarun, C.: Planar graphs as L-intersection or L-contact graphs. In: SODA, pp. 172\u2013184. SIAM (2018)","DOI":"10.1137\/1.9781611975031.12"},{"issue":"4","key":"14_CR22","doi-asserted-by":"publisher","first-page":"745","DOI":"10.7155\/jgaa.00509","volume":"23","author":"D Gon\u00e7alves","year":"2019","unstructured":"Gon\u00e7alves, D., L\u00e9v\u00eaque, B., Pinlou, A.: Homothetic triangle representations of planar graphs. J. Graph Algorithms Appl. 23(4), 745\u2013753 (2019)","journal-title":"J. Graph Algorithms Appl."},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Gupta, A., Impagliazzo, R.: Computing planar intertwines. In: FOCS, pp. 802\u2013811. Citeseer (1991)","DOI":"10.1109\/SFCS.1991.185452"},{"issue":"1","key":"14_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(91)90069-E","volume":"87","author":"IB Hartman","year":"1991","unstructured":"Hartman, I.B., Newman, I., Ziv, R.: On grid intersection graphs. Discret. Math. 87(1), 41\u201352 (1991)","journal-title":"Discret. Math."},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-319-27261-0_36","volume-title":"Graph Drawing and Network Visualization","author":"B Klemz","year":"2015","unstructured":"Klemz, B., N\u00f6llenburg, M., Prutkin, R.: Recognizing weighted disk contact graphs. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 433\u2013446. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_36"},{"key":"14_CR26","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Hirzel (1936)"},{"issue":"1","key":"14_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. II. Recognizing string graphs is NP-hard. J. Comb. Theory Series B 52(1), 67\u201378 (1991)","journal-title":"J. Comb. Theory Series B"},{"issue":"3","key":"14_CR28","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Discret. Appl. Math. 52(3), 233\u2013252 (1994)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"14_CR29","first-page":"761","volume":"30","author":"J Kratochv\u00edl","year":"1989","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: NP-hardness results for intersection graphs. Comment. Math. Univ. Carol. 30(4), 761\u2013773 (1989)","journal-title":"Comment. Math. Univ. Carol."},{"issue":"2","key":"14_CR30","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matousek, J.: Intersection graphs of segments. J. Comb. Theory Ser. B 62(2), 289\u2013315 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-73545-8_14","volume-title":"Computing and Combinatorics","author":"J Kratochv\u00edl","year":"2007","unstructured":"Kratochv\u00edl, J., Pergel, M.: Geometric intersection graphs: do short cycles help? In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 118\u2013128. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73545-8_14"},{"issue":"5","key":"14_CR32","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s11276-007-0045-6","volume":"14","author":"F Kuhn","year":"2008","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad hoc networks beyond unit disk graphs. Wireless Netw. 14(5), 715\u2013729 (2008)","journal-title":"Wireless Netw."},{"issue":"2","key":"14_CR33","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1002\/wcm.107","volume":"3","author":"X-Y Li","year":"2003","unstructured":"Li, X.-Y.: Algorithmic, geometric and graphs issues in wireless networks. Wirel. Commun. Mob. Comput. 3(2), 119\u2013140 (2003)","journal-title":"Wirel. Commun. Mob. Comput."},{"issue":"3","key":"14_CR34","first-page":"967","volume":"88","author":"I Musta\u0163\u0103","year":"2019","unstructured":"Musta\u0163\u0103, I., Pergel, M.: On unit grid intersection graphs and several other intersection graph classes. Acta Math. Univ. Comenian. 88(3), 967\u2013972 (2019)","journal-title":"Acta Math. Univ. Comenian."},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. OUP, Oxford (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"14_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-11805-0_1","volume-title":"Graph Drawing","author":"J Pach","year":"2010","unstructured":"Pach, J.: Why are string graphs so beautiful? In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 1\u20131. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_1"},{"issue":"2","key":"14_CR37","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/564585.564602","volume":"33","author":"R Rajaraman","year":"2002","unstructured":"Rajaraman, R.: Topology control and routing in ad hoc networks: a survey. ACM SIGACT News 33(2), 60\u201373 (2002)","journal-title":"ACM SIGACT News"},{"issue":"2","key":"14_CR38","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph minors XX Wagner\u2019s conjecture. J. Comb. Theory Ser. B 92(2), 325\u2013357 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"14_CR39","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0022-0000(03)00045-X","volume":"67","author":"M Schaefer","year":"2003","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Recognizing string graphs in NP. J. Comput. Syst. Sci. 67(2), 365\u2013380 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR40","unstructured":"Scheinerman, E.R.: Intersection Classes and Multiple Intersection Parameters of Graphs. Princeton University (1984)"},{"key":"14_CR41","volume-title":"Algorithms for VLSI Physical Design Automation","author":"NA Sherwani","year":"2007","unstructured":"Sherwani, N.A.: Algorithms for VLSI Physical Design Automation. Springer, New York (2007)"},{"issue":"9","key":"14_CR42","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1002\/j.1538-7305.1966.tb01713.x","volume":"45","author":"FW Sinden","year":"1966","unstructured":"Sinden, F.W.: Topology of thin film RC circuits. Bell Syst. Tech. J. 45(9), 1639\u20131662 (1966)","journal-title":"Bell Syst. Tech. J."},{"issue":"5","key":"14_CR43","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0020-0190(97)00024-0","volume":"61","author":"DM Thilikos","year":"1997","unstructured":"Thilikos, D.M., Bodlaender, H.L.: Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. Inf. Process. Lett. 61(5), 227\u2013232 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"14_CR44","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0095-8956(86)90061-4","volume":"40","author":"C Thomassen","year":"1986","unstructured":"Thomassen, C.: Interval representations of planar graphs. J. Comb. Theory Ser. B 40(1), 9\u201320 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Thurston, W.: Hyperbolic geometry and 3-manifolds. Low-dimensional topology (Bangor, 1979) 48, 9\u201325 (1982)","DOI":"10.1017\/CBO9780511758935.003"},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"Welsh, D.J.A.: Knots and braids: some algorithmic questions. Contemp. Math. 147 (1993)","DOI":"10.1090\/conm\/147\/01166"},{"key":"14_CR47","unstructured":"Wigderson, A.: The complexity of the Hamiltonian circuit problem for maximal planar graphs. Technical report, EECS 198, Princeton University, USA (1982)"},{"issue":"4","key":"14_CR48","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/1162349.1162350","volume":"53","author":"J Xu","year":"2006","unstructured":"Xu, J., Berger, B.: Fast and accurate algorithms for protein side-chain packing. J. ACM (JACM) 53(4), 533\u2013557 (2006)","journal-title":"J. ACM (JACM)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T10:03:43Z","timestamp":1726826623000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","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":"89","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":"30","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":"34% - 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","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":"2-9","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 proceedings also include 3 invited papers.","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)"}}]}}