{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:04:37Z","timestamp":1759133077295,"version":"3.40.3"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589417"},{"type":"electronic","value":"9783030589424"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_1","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2353-5230","authenticated-orcid":false,"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7601-3727","authenticated-orcid":false,"given":"Matthias","family":"Lanzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4018-4994","authenticated-orcid":false,"given":"Davide Mario","family":"Longo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7742-0439","authenticated-orcid":false,"given":"Cem","family":"Okulmus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1760-122X","authenticated-orcid":false,"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Aberger, C.R., Tu, S., Olukotun, K., R\u00e9, C.: EmptyHeaded: a relational engine for graph processing. In: Proceedings of SIGMOD 2016, pp. 431\u2013446 (2016)","DOI":"10.1145\/2882903.2915213"},{"issue":"8","key":"1_CR2","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1016\/j.ejc.2007.04.013","volume":"28","author":"I Adler","year":"2007","unstructured":"Adler, I., Gottlob, G., Grohe, M.: Hypertree width and related hypergraph invariants. Eur. J. Comb. 28(8), 2167\u20132181 (2007)","journal-title":"Eur. J. Comb."},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"371","DOI":"10.3233\/AIC-150694","volume":"29","author":"K Amroun","year":"2016","unstructured":"Amroun, K., Habbas, Z., Aggoune-Mtalaa, W.: A compressed generalized hypertree decomposition-based solving technique for non-binary constraint satisfaction problems. AI Commun. 29(2), 371\u2013392 (2016)","journal-title":"AI Commun."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Aref, M., et al.: Design and implementation of the LogicBlox system. In: Proceedings of SIGMOD 2015, pp. 1371\u20131382 (2015)","DOI":"10.1145\/2723372.2742796"},{"key":"1_CR5","unstructured":"Audemard, G., Boussemart, F., Lecoutre, C., Piette, C.: XCSP3: an XML-based format designed to represent combinatorial constrained problems (2016). http:\/\/www.xcsp.org\/"},{"key":"1_CR6","unstructured":"Berg, J., Lodha, N., J\u00e4rvisalo, M., Szeider, S.: Maxsat benchmarks based on determining generalized hypertree-width. In: MaxSAT Evaluation 2017: Solver and Benchmark Descriptions, vol. B-2017-2, p. 22 (2017)"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L.: Discovering treewidth. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 1\u201316. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30577-4_1","DOI":"10.1007\/978-3-540-30577-4_1"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Bonifati, A., Martens, W., Timm, T.: An analytical study of large SPARQL query logs. VLDB J. 29, 655\u2013679 (2019). https:\/\/doi.org\/10.1007\/s00778-019-00558-9","DOI":"10.1007\/s00778-019-00558-9"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Booth, K.E.C., Beck, J.C.: A constraint programming approach to electric vehicle routing with time windows. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 129\u2013145. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_9","DOI":"10.1007\/978-3-030-19212-9_9"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1109\/LRA.2016.2522096","volume":"1","author":"KEC Booth","year":"2016","unstructured":"Booth, K.E.C., Tran, T.T., Nejat, G., Beck, J.C.: Mixed-integer and constraint programming techniques for mobile robot task planning. IEEE Robot. Autom. Lett. 1(1), 500\u2013507 (2016)","journal-title":"IEEE Robot. Autom. Lett."},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1137\/S0097539799359683","volume":"31","author":"V Bouchitt\u00e9","year":"2001","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31(1), 212\u2013232 (2001)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/S0377-2217(98)00364-6","volume":"119","author":"SC Brailsford","year":"1999","unstructured":"Brailsford, S.C., Potts, C.N., Smith, B.M.: Constraint satisfaction problems: algorithms and applications. Eur. J. Oper. Res. 119(3), 557\u2013581 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of STOC 1977, pp. 77\u201390. ACM (1977)","DOI":"10.1145\/800105.803397"},{"issue":"5","key":"1_CR14","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.jcss.2007.08.001","volume":"74","author":"DA Cohen","year":"2008","unstructured":"Cohen, D.A., Jeavons, P., Gyssens, M.: A unified theory of structural tractability for constraint satisfaction problems. J. Comput. Syst. Sci. 74(5), 721\u2013743 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR15","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers Inc., San Francisco (2003)"},{"key":"1_CR16","volume-title":"The Go Programming Language","author":"AAA Donovan","year":"2015","unstructured":"Donovan, A.A.A., Kernighan, B.W.: The Go Programming Language. Addison-Wesley Professional, Boston (2015)"},{"key":"1_CR17","unstructured":"Dzulfikar, M.A., Fichte, J.K., Hecher, M.: The PACE 2019 parameterized algorithms and computational experiments challenge: the fourth iteration. In: Proceedings of IPEC 2019, Leibniz International Proceedings in Informatics (LIPIcs), vol. 148, pp. 25:1\u201325:23. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Fichte, J.K., Hecher, M., Lodha, N., Szeider, S.: An SMT approach to fractional hypertree width. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 109\u2013127. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_8","DOI":"10.1007\/978-3-319-98334-9_8"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Fischl, W., Gottlob, G., Longo, D.M., Pichler, R.: HyperBench: a benchmark and tool for hypergraphs and empirical findings. In: Proceedings of PODS 2019, pp. 464\u2013480. ACM (2019)","DOI":"10.1145\/3294052.3319683"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Fischl, W., Gottlob, G., Pichler, R.: General and fractional hypertree decompositions: hard and easy cases. In: Proceedings of PODS 2018, pp. 17\u201332. ACM (2018)","DOI":"10.1145\/3196959.3196962"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Gange, G., Harabor, D., Stuckey, P.J.: Lazy CBS: implicit conflict-based search using lazy clause generation. In: Proceedings of ICAPS 2019, pp. 155\u2013162. AAAI Press (2019)","DOI":"10.1609\/icaps.v29i1.3471"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Geibinger, T., Mischek, F., Musliu, N.: Investigating constraint programming for real world industrial test laboratory scheduling. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 304\u2013319. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_20","DOI":"10.1007\/978-3-030-19212-9_20"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Ghionna, L., Granata, L., Greco, G., Scarcello, F.: Hypertree decompositions for query optimization. In: Proceedings of ICDE 2007, pp. 36\u201345. IEEE Computer Society (2007)","DOI":"10.1109\/ICDE.2007.367849"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Ghionna, L., Greco, G., Scarcello, F.: H-DB: a hybrid quantitative-structural SQL optimizer. In: Proceedings of CIKM 2011, pp. 2573\u20132576. ACM (2011)","DOI":"10.1145\/2063576.2064023"},{"key":"1_CR25","unstructured":"Gottlob, G., Hutle, M., Wotawa, F.: Combining hypertree, bicomp, and hinge decomposition. In: Proceedings of ECAI 2002, pp. 161\u2013165. IOS Press (2002)"},{"key":"1_CR26","unstructured":"Gottlob, G., Lanzinger, M., Pichler, R., Razgon, I.: Complexity analysis of generalized and fractional hypertree decompositions. CoRR abs\/2002.05239 (2020). https:\/\/arxiv.org\/abs\/2002.05239"},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","volume":"124","author":"G Gottlob","year":"2000","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural CSP decomposition methods. Artif. Intell. 124(2), 243\u2013282 (2000)","journal-title":"Artif. Intell."},{"issue":"3","key":"1_CR28","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jcss.2001.1809","volume":"64","author":"G Gottlob","year":"2002","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64(3), 579\u2013627 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Mikl\u00f3s, Z., Schwentick, T.: Generalized hypertree decompositions: NP-hardness and tractable variants. J. ACM 56(6), 30:1\u201330:32 (2009)","DOI":"10.1145\/1568318.1568320"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Okulmus, C., Pichler, R.: Fast and parallel decomposition of constraints satisfaction problems. In: Proceedings of IJCAI 2020, pp. 1155\u20131162 (2020)","DOI":"10.24963\/ijcai.2020\/161"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Samer, M.: A backtracking-based algorithm for hypertree decomposition. ACM J. Expe. Algorithmics 13 (2008)","DOI":"10.1145\/1412228.1412229"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Grohe, M., Marx, D.: Constraint solving via fractional edge covers. ACM Trans. Algorithms 11(1), 4:1\u20134:20 (2014)","DOI":"10.1145\/2636918"},{"issue":"5","key":"1_CR33","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1080\/0952813X.2014.993507","volume":"27","author":"Z Habbas","year":"2015","unstructured":"Habbas, Z., Amroun, K., Singer, D.: A forward-checking algorithm based on a generalised hypertree decomposition for solving non-binary constraint satisfaction problems. J. Exp. Theor. Artif. Intell. 27(5), 649\u2013671 (2015)","journal-title":"J. Exp. Theor. Artif. Intell."},{"issue":"8","key":"1_CR34","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"CAR Hoare","year":"1978","unstructured":"Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21(8), 666\u2013677 (1978)","journal-title":"Commun. ACM"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Jain, S., Moritz, D., Halperin, D., Howe, B., Lazowska, E.: SQLShare: results from a multi-year SQL-as-a-service experiment. In: Proceedings of SIGMOD 2016, pp. 281\u2013293. ACM (2016)","DOI":"10.1145\/2882903.2882957"},{"key":"1_CR36","unstructured":"Korhonen, T.: Potential maximal cliques parameterized by edge clique cover. CoRR abs\/1912.10989 (2019). https:\/\/arxiv.org\/abs\/1912.10989"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Korhonen, T., Berg, J., J\u00e4rvisalo, M.: Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitt\u00e9-Todinca algorithm. ACM J. Exp. Algorithmics 24(1), 1.9:1\u20131.9:19 (2019)","DOI":"10.1145\/3301297"},{"key":"1_CR38","unstructured":"Korimort, T.: Heuristic hypertree decomposition. Ph.D. thesis, Vienna University of Technology (2003)"},{"issue":"2","key":"1_CR39","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: IBM ILOG CP optimizer for scheduling - 20+ years of scheduling with constraints at IBM\/ILOG. Constraints Int. J. 23(2), 210\u2013250 (2018)","journal-title":"Constraints Int. J."},{"key":"1_CR40","unstructured":"Lalou, M., Habbas, Z., Amroun, K.: Solving hypertree structured CSP: sequential and parallel approaches. In: Proceedings of RCRA@AI*IA 2009, CEUR Workshop Proceedings, vol. 589 (2009). CEUR-WS.org"},{"issue":"2","key":"1_CR41","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1287\/trsc.2019.0907","volume":"54","author":"E Lam","year":"2020","unstructured":"Lam, E., Hentenryck, P.V., Kilby, P.: Joint vehicle and crew routing and scheduling. Transp. Sci. 54(2), 488\u2013511 (2020)","journal-title":"Transp. Sci."},{"issue":"5","key":"1_CR42","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00778-017-0480-7","volume":"27","author":"V Leis","year":"2018","unstructured":"Leis, V., et al.: Query optimization through the looking glass, and what we found running the join order benchmark. VLDB J. 27(5), 643\u2013668 (2018)","journal-title":"VLDB J."},{"key":"1_CR43","unstructured":"Leone, N., Mazzitelli, A., Scarcello, F.: Cost-based query decompositions. In: Proceedings of SEBD 2002, pp. 390\u2013403 (2002)"},{"issue":"4","key":"1_CR44","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discret. Math. 13(4), 383\u2013390 (1975)","journal-title":"Discret. Math."},{"key":"1_CR45","doi-asserted-by":"publisher","unstructured":"Musliu, N., Schutt, A., Stuckey, P.J.: Solver independent rotating workforce scheduling. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 429\u2013445. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_31","DOI":"10.1007\/978-3-319-93031-2_31"},{"issue":"2\u20133","key":"1_CR46","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/s007780100048","volume":"10","author":"R Pottinger","year":"2001","unstructured":"Pottinger, R., Halevy, A.Y.: Minicon: a scalable algorithm for answering queries using views. VLDB J. 10(2\u20133), 182\u2013198 (2001). https:\/\/doi.org\/10.1007\/s007780100048","journal-title":"VLDB J."},{"key":"1_CR47","unstructured":"Raedt, L.D., Guns, T., Nijssen, S.: Constraint programming for data mining and machine learning. In: Proceedings of AAAI 2010. AAAI Press (2010)"},{"key":"1_CR48","volume-title":"Handbook of Constraint Programming","author":"F Rossi","year":"2006","unstructured":"Rossi, F., Van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier, Amsterdam (2006)"},{"key":"1_CR49","doi-asserted-by":"publisher","unstructured":"Samer, M., Veith, H.: Encoding treewidth into SAT. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 45\u201350. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_6","DOI":"10.1007\/978-3-642-02777-2_6"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"Schidler, A., Szeider, S.: Computing optimal hypertree decompositions. In: Proceedings of ALENEX 2020, pp. 1\u201311. SIAM (2020)","DOI":"10.1137\/1.9781611976007.1"},{"key":"1_CR51","doi-asserted-by":"publisher","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49481-2_30","DOI":"10.1007\/3-540-49481-2_30"},{"key":"1_CR52","unstructured":"Transaction Processing Performance Council (TPC): TPC-H decision support benchmark (2014). http:\/\/www.tpc.org\/tpch\/default.asp"},{"key":"1_CR53","volume-title":"Foundations of Constraint Satisfaction","author":"E Tsang","year":"1993","unstructured":"Tsang, E.: Foundations of Constraint Satisfaction. Academic Press Limited, Cambridge (1993)"},{"key":"1_CR54","doi-asserted-by":"crossref","unstructured":"Verhaeghe, H., Nijssen, S., Pesant, G., Quimper, C., Schaus, P.: Learning optimal decision trees using constraint programming. In: Proceedings of BNAIC 2019. CEUR Workshop Proceedings, vol. 2491(2019). CEUR-WS.org","DOI":"10.24963\/ijcai.2020\/662"},{"key":"1_CR55","unstructured":"Yannakakis, M.: Algorithms for acyclic database schemes. In: Proceedings of VLDB 1981, pp. 82\u201394 (1981)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T00:56:41Z","timestamp":1668819401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","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":"72","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":"25","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":"7","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":"35% - 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.08","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.08","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)"}}]}}