{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:42:18Z","timestamp":1726044138676},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030307851"},{"type":"electronic","value":"9783030307868"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30786-8_1","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T21:22:57Z","timestamp":1568236977000},"page":"1-13","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs"],"prefix":"10.1007","author":[{"given":"Karolina","family":"Okrasa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jalgor.2003.10.001","volume":"52","author":"J Alber","year":"2004","unstructured":"Alber, J., Fiala, J.: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms 52(2), 134\u2013151 (2004)","journal-title":"J. Algorithms"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/90.413218","volume":"3","author":"AA Bertossi","year":"1995","unstructured":"Bertossi, A.A., Bonuccelli, M.A.: Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE\/ACM Transact. Netw. 3(4), 441\u2013449 (1995)","journal-title":"IEEE\/ACM Transact. Netw."},{"key":"1_CR3","first-page":"47","volume":"9","author":"C Bir\u00f3","year":"2018","unstructured":"Bir\u00f3, C., Bonnet, \u00c9., Marx, D., Miltzow, T., Rz\u0105\u017cewski, P.: Fine-grained complexity of coloring unit disks and balls. J. of Comp. Geom. 9, 47\u201380 (2018)","journal-title":"J. of Comp. Geom."},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1007\/s00453-018-0474-x","volume":"81","author":"M Bonamy","year":"2019","unstructured":"Bonamy, M., Dabrowski, K.K., Feghali, C., Johnson, M., Paulusma, D.: Independent feedback vertex set for $$P_5$$ -free graphs. Algorithmica 81(4), 1342\u20131369 (2019)","journal-title":"Algorithmica"},{"issue":"7","key":"1_CR5","doi-asserted-by":"publisher","first-page":"3047","DOI":"10.1007\/s00453-019-00568-7","volume":"81","author":"\u00c9 Bonnet","year":"2019","unstructured":"Bonnet, \u00c9., Rz\u0105\u017cewski, P.: Optimality program in segment and string graphs. Algorithmica 81(7), 3047\u20133073 (2019)","journal-title":"Algorithmica"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Gon\u00e7alves, D.: Every planar graph is the intersection graph of segments in the plane: extended abstract. In: Proceedings of STOC 2009, pp. 631\u2013638 (2009)","DOI":"10.1145\/1536414.1536500"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2015.01.028","volume":"590","author":"S Chaplick","year":"2015","unstructured":"Chaplick, S., Fiala, J., van\u2019t Hof, P., Paulusma, D., Tesar, M.: Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. 590, 86\u201395 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10878-015-9894-6","volume":"32","author":"A Dehghan","year":"2016","unstructured":"Dehghan, A.: On strongly planar not-all-equal 3SAT. J. Comb. Optim. 32(3), 721\u2013724 (2016)","journal-title":"J. Comb. Optim."},{"issue":"16","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1016\/j.dam.2010.06.016","volume":"158","author":"N Eggemann","year":"2010","unstructured":"Eggemann, N., Havet, F., Noble, S.D.: $$k$$ - $$L(2, 1)$$ -labelling for planar graphs is NP-complete for $$k \\ge 4$$ . Disc. Appl. Math. 158(16), 1777\u20131788 (2010)","journal-title":"Disc. Appl. Math."},{"issue":"4","key":"1_CR10","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s004939970003","volume":"19","author":"T Feder","year":"1999","unstructured":"Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica 19(4), 487\u2013505 (1999)","journal-title":"Combinatorica"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/11917496_2","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J Fiala","year":"2006","unstructured":"Fiala, J., Kratochv\u00edl, J.: Locally injective graph homomorphism: lists guarantee dichotomy. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 15\u201326. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11917496_2"},{"issue":"7","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1016\/j.ejc.2006.06.003","volume":"27","author":"J Fiala","year":"2006","unstructured":"Fiala, J., Maxov\u00e1, J.: Cantor-Bernstein type theorem for locally constrained graph homomorphisms. Eur. J. Comb. 27(7), 1111\u20131116 (2006)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2005.09.029","volume":"349","author":"J Fiala","year":"2005","unstructured":"Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theor. Comput. Sci. 349(1), 67\u201381 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/11549345_30","volume-title":"Mathematical Foundations of Computer Science 2005","author":"J Fiala","year":"2005","unstructured":"Fiala, J., Paulusma, D., Telle, J.A.: Matrix and graph orders derived from locally constrained graph homomorphisms. In: J\u0119drzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 340\u2013351. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549345_30"},{"key":"1_CR15","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S., Zehavi, M.: Finding, hitting and packing cycles in sub exponential time on unit disk graphs. In: Proceedings of ICALP 2017, LIPIcs, vol. 80, pp. 65:1\u201365:15 (2017)"},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1017\/S0963548309990459","volume":"19","author":"J Fox","year":"2010","unstructured":"Fox, J., Pach, J.: A separator theorem for string graphs and its applications. Comb. Probab. Comput. 19(3), 371\u2013390 (2010)","journal-title":"Comb. Probab. Comput."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Computing the independence number of intersection graphs. In: Proceedings of SODA 2011, pp. 1161\u20131165 (2011)","DOI":"10.1137\/1.9781611973082.87"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/1.9781611975031.12","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Daniel Gon\u00e7alves","year":"2018","unstructured":"Gon\u00e7alves, D., Isenmann, L., Pennarun, C.: Planar Graphs as L-intersection or L-contact graphs. In: Proceedings of SODA 2018, pp. 172\u2013184 (2018)"},{"issue":"4","key":"1_CR19","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Dis. Math. 5(4), 586\u2013595 (1992)","journal-title":"SIAM J. Dis. Math."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Groenland, C., Okrasa, K., Rz\u0105\u017cewski, P., Scott, A., Seymour, P., Spirkl, S.: $$H$$ -colouring $$P_t$$ -free graphs in sub exponential time. Discrete Applied Mathematics (2019, to appear)","DOI":"10.1016\/j.dam.2019.04.010"},{"issue":"4","key":"1_CR21","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.ejc.2007.11.012","volume":"29","author":"GZ Gutin","year":"2008","unstructured":"Gutin, G.Z., Hell, P., Rafiey, A., Yeo, A.: A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. 29(4), 900\u2013911 (2008)","journal-title":"Eur. J. Comb."},{"issue":"1\u20132","key":"1_CR22","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(01)00466-6","volume":"256","author":"G Hahn","year":"2002","unstructured":"Hahn, G., Kratochv\u00edl, J., Sir\u00e1n, J., Sotteau, D.: On the injective chromatic number of graphs. Disc. Math. 256(1\u20132), 179\u2013192 (2002)","journal-title":"Disc. Math."},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00453-009-9302-7","volume":"59","author":"F Havet","year":"2011","unstructured":"Havet, F., Klazar, M., Kratochv\u00edl, J., Kratsch, D., Liedloff, M.: Exact algorithms for L(2, 1)-labeling of graphs. Algorithmica 59(2), 169\u2013194 (2011)","journal-title":"Algorithmica"},{"key":"1_CR24","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"P Hell","year":"2004","unstructured":"Hell, P., Nesetril, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Hell, P., Rafiey, A.: The dichotomy of list homomorphisms for digraphs. In: Proceedings of SODA 2011, pp. 1703\u20131713 (2011)","DOI":"10.1137\/1.9781611973082.131"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-540-78773-0_45","volume-title":"LATIN 2008: Theoretical Informatics","author":"P Hell","year":"2008","unstructured":"Hell, P., Raspaud, A., Stacho, J.: On injective colourings of chordal graphs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 520\u2013530. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_45"},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of $$k$$ -SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-319-57586-5_31","volume-title":"Algorithms and Complexity","author":"S Kisfaludi-Bak","year":"2017","unstructured":"Kisfaludi-Bak, S., van der Zanden, T.C.: On the exact complexity of hamiltonian cycle and q-colouring in disk graphs. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 369\u2013380. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_31"},{"key":"1_CR29","first-page":"141","volume":"88","author":"P Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig, Mathematisch-Physikalische Klasse 88, 141\u2013164 (1936)","journal-title":"Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig, Mathematisch-Physikalische Klasse"},{"issue":"1","key":"1_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0095-8956(91)90090-7","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. I. The number of critical nonstring graphs is infinite. J. Comb. Theory Ser. B 52(1), 53\u201366 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"1_CR31","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 Ser. B 52(1), 67\u201378 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(91)90050-T","volume":"53","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: String graphs requiring exponential representations. J. Comb. Theory Ser. B 53(1), 1\u20134 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"1_CR33","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., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theory Ser. B 62(2), 289\u2013315 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1_CR34","unstructured":"Lee, J.R.: Separators in region intersection graphs. In: Proceedings of ITCSC 2017, pp. 1:1\u20131:8 (2017)"},{"issue":"2","key":"1_CR35","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R Lipton","year":"1979","unstructured":"Lipton, R., Tarjan, R.: A separator theorem for planar graphs. SIAM J. on Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. on Appl. Math."},{"key":"1_CR36","unstructured":"Lloyd, E.L., Ramanathan, S.: On the complexity of distance-2 coloring. In: Proceedings of ICCI 1992, pp. 71\u201374 (1992)"},{"issue":"20","key":"1_CR37","doi-asserted-by":"publisher","first-page":"2685","DOI":"10.1016\/j.disc.2010.03.034","volume":"310","author":"G MacGillivray","year":"2010","unstructured":"MacGillivray, G., Swarts, J.: The complexity of locally injective homomorphisms. Disc. Math. 310(20), 2685\u20132696 (2010)","journal-title":"Disc. Math."},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/978-3-662-48350-3_72","volume-title":"Algorithms \u2013 ESA 2015","author":"D Marx","year":"2015","unstructured":"Marx, D., Pilipczuk, M.: Optimal parameterized algorithms for planar facility location problems using voronoi diagrams. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 865\u2013877. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_72"},{"key":"1_CR39","unstructured":"Matou\u0161ek, J.: Intersection graphs of segments and $$\\exists \\mathbb{R}$$ . CoRR, abs\/1406.2636 (2014)"},{"issue":"1","key":"1_CR40","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1017\/S0963548313000400","volume":"23","author":"J Matou\u0161ek","year":"2014","unstructured":"Matou\u0161ek, J.: Near-optimal separators in string graphs. Comb. Prob. Comput. 23(1), 135\u2013139 (2014)","journal-title":"Comb. Prob. Comput."},{"issue":"1","key":"1_CR41","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jctb.2012.09.004","volume":"103","author":"C McDiarmid","year":"2013","unstructured":"McDiarmid, C., M\u00fcller, T.: Integer realizations of disk and segment graphs. J. Comb. Theory Ser. B 103(1), 114\u2013143 (2013)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"1_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/256292.256294","volume":"44","author":"GL Miller","year":"1997","unstructured":"Miller, G.L., Teng, S., Thurston, W.P., Vavasis, S.A.: Separators for sphere-packings and nearest neighbor graphs. J. ACM 44(1), 1\u201329 (1997)","journal-title":"J. ACM"},{"issue":"2","key":"1_CR43","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/49097.49099","volume":"19","author":"BM Moret","year":"1988","unstructured":"Moret, B.M.: Planar NAE3SAT is in P. SIGACT News 19(2), 51\u201354 (1988)","journal-title":"SIGACT News"},{"issue":"2","key":"1_CR44","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":"1_CR45","doi-asserted-by":"crossref","unstructured":"Okrasa, K., Rz\u0105\u017cewski, P.: Subexponential algorithms for variants of homomorphism problem in string graphs. CoRR, abs\/1809.09345 (2018)","DOI":"10.1007\/978-3-030-30786-8_1"},{"issue":"2","key":"1_CR46","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s00224-015-9662-0","volume":"60","author":"M Schaefer","year":"2017","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Fixed points, nash equilibria, and the existential theory of the reals. Theory Comput. Syst. 60(2), 172\u2013193 (2017)","journal-title":"Theory Comput. Syst."},{"key":"1_CR47","unstructured":"Smith, W.D., Wormald, N.C.: Geometric separator theorems and applications. In: Proceedings of FOCS 1998, pp. 232\u2013243 (1998)"},{"issue":"2","key":"1_CR48","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J Heuvel van den","year":"2003","unstructured":"van den Heuvel, J., McGuinness, S.: Coloring the square of a planar graph. J. Graph Theory 42(2), 110\u2013124 (2003)","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30786-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:47:51Z","timestamp":1664354871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30786-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030307851","9783030307868"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30786-8_1","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":"12 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vall de N\u00faria","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wg2019.sau.thilikos.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"87","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":"29","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":"33% - 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.4","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":"1-2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}