{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:54:24Z","timestamp":1743130464262,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030782290"},{"type":"electronic","value":"9783030782306"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78230-6_22","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T23:06:15Z","timestamp":1623884775000},"page":"348-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Subgraphs with Side Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9519-938X","authenticated-orcid":false,"given":"\u00d6zg\u00fcr","family":"Akg\u00fcn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0266-3292","authenticated-orcid":false,"given":"Jessica","family":"Enright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2979-5989","authenticated-orcid":false,"given":"Christopher","family":"Jefferson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6106-4871","authenticated-orcid":false,"given":"Ciaran","family":"McCreesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4460-6912","authenticated-orcid":false,"given":"Patrick","family":"Prosser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9062-6637","authenticated-orcid":false,"given":"Steffen","family":"Zschaler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-19212-9_2","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"B Archibald","year":"2019","unstructured":"Archibald, B., Dunlop, F., Hoffmann, R., McCreesh, C., Prosser, P., Trimble, J.: Sequential and parallel solution-biased search for subgraph algorithms. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 20\u201338. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_2"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-10428-7_12","volume-title":"Principles and Practice of Constraint Programming","author":"G Audemard","year":"2014","unstructured":"Audemard, G., Lecoutre, C., Samy-Modeliar, M., Goncalves, G., Porumbel, D.: Scoring-based neighborhood dominance for the subgraph isomorphism problem. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 125\u2013141. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_12"},{"issue":"5","key":"22_CR3","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1080\/17513758.2010.503376","volume":"4","author":"S Bansal","year":"2010","unstructured":"Bansal, S., Read, J., Pourbohloul, B., Meyers, L.A.: The dynamic nature of contact networks in infectious disease epidemiology. J. Biol. Dyn. 4(5), 478\u2013489 (2010)","journal-title":"J. Biol. Dyn."},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s10270-017-0644-3","volume":"18","author":"R Bill","year":"2017","unstructured":"Bill, R., Fleck, M., Troya, J., Mayerhofer, T., Wimmer, M.: A local and global tour on MOMoT. Softw. Syst. Model. 18(2), 1017\u20131046 (2017). https:\/\/doi.org\/10.1007\/s10270-017-0644-3","journal-title":"Softw. Syst. Model."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-319-23219-5_42","volume-title":"Principles and Practice of Constraint Programming","author":"G Hjort Blindell","year":"2015","unstructured":"Hjort Blindell, G., Casta\u00f1eda Lozano, R., Carlsson, M., Schulte, C.: Modeling universal instruction selection. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 609\u2013626. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_42"},{"issue":"S\u20137","key":"22_CR6","doi-asserted-by":"publisher","first-page":"S13","DOI":"10.1186\/1471-2105-14-S7-S13","volume":"14","author":"V Bonnici","year":"2013","unstructured":"Bonnici, V., Giugno, R., Pulvirenti, A., Shasha, D.E., Ferro, A.: A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinf. 14(S\u20137), S13 (2013)","journal-title":"BMC Bioinf."},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10515-017-0215-4","volume":"24","author":"I Boussa\u00efd","year":"2017","unstructured":"Boussa\u00efd, I., Siarry, P., Ahmed-Nacer, M.: A survey on search-based model-driven engineering. Autom. Softw. Eng. 24(2), 233\u2013294 (2017). https:\/\/doi.org\/10.1007\/s10515-017-0215-4","journal-title":"Autom. Softw. Eng."},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/11790754_8","volume-title":"Detection of Intrusions and Malware & Vulnerability Assessment","author":"D Bruschi","year":"2006","unstructured":"Bruschi, D., Martignoni, L., Monga, M.: Detecting self-mutating malware using control-flow graph matching. In: B\u00fcschkes, R., Laskov, P. (eds.) DIMVA 2006. LNCS, vol. 4064, pp. 129\u2013143. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11790754_8"},{"key":"22_CR9","doi-asserted-by":"publisher","unstructured":"Burdusel, A., Zschaler, S., John, S.: Automatic generation of atomic consistency preserving search operators for search-based model engineering. In: Kessentini, M., Yue, T., Pretschner, A., Voss, S., Burgue\u00f1o, L. (eds.) 22nd ACM\/IEEE International Conference on Model Driven Engineering Languages and Systems, MODELS 2019, Munich, Germany, 15\u201320 September 2019, pp. 106\u2013116. IEEE (2019). https:\/\/doi.org\/10.1109\/MODELS.2019.00-10","DOI":"10.1109\/MODELS.2019.00-10"},{"issue":"10","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"22_CR11","unstructured":"Dell\u2019Olmo, P., Cerulli, R., Carrabs, F.: The maximum labeled clique problem. In: Adacher, L., Flamini, M., Leo, G., Nicosia, G., Pacifici, A., Piccialli, V. (eds.) Proceedings of the 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, 14\u201316 June 2011, pp. 146\u2013149 (2011)"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.jlamp.2015.09.005","volume":"86","author":"F Dur\u00e1n","year":"2017","unstructured":"Dur\u00e1n, F., Moreno-Delgado, A., Orejas, F., Zschaler, S.: Amalgamation of domain specific languages with behaviour. J. Log. Algebraic Methods Program. 86, 208\u2013235 (2017). https:\/\/doi.org\/10.1016\/j.jlamp.2015.09.005","journal-title":"J. Log. Algebraic Methods Program."},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-36089-3_19","volume-title":"Software Language Engineering","author":"F Dur\u00e1n","year":"2013","unstructured":"Dur\u00e1n, F., Zschaler, S., Troya, J.: On the reusable specification of non-functional properties in DSLs. In: Czarnecki, K., Hedin, G. (eds.) SLE 2012. LNCS, vol. 7745, pp. 332\u2013351. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36089-3_19"},{"key":"22_CR14","unstructured":"Efstathiou, D., Williams, J.R., Zschaler, S.: Crepe complete: multi-objective optimization for your models. In: Paige, R.F., Kessentini, M., Langer, P., Wimmer, M. (eds.) Proceedings of the First International Workshop on Combining Modelling with Search- and Example-Based Approaches co-located with 17th International Conference on Model Driven Engineering Languages and Systems (MODELS 2014), Valencia, Spain, 28 September 2014. CEUR Workshop Proceedings, vol. 1340, pp. 25\u201334. CEUR-WS.org (2014)"},{"key":"22_CR15","series-title":"Monographs in Theoretical Computer Science. An EATCSSeries","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31188-2","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCSSeries. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-030-57173-3_5","volume-title":"Recent Advances in Biological Network Analysis","author":"R Elhesha","year":"2021","unstructured":"Elhesha, R., Sarkar, A., Kahveci, T.: Motifs in biological networks. In: Yoon, B.-J., Qian, X. (eds.) Recent Advances in Biological Network Analysis, pp. 101\u2013123. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-57173-3_5"},{"issue":"1","key":"22_CR17","doi-asserted-by":"publisher","first-page":"1450001","DOI":"10.1142\/S0218001414500013","volume":"28","author":"P Foggia","year":"2014","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. IJPRAI 28(1), 1450001 (2014). https:\/\/doi.org\/10.1142\/S0218001414500013","journal-title":"IJPRAI"},{"issue":"3","key":"22_CR18","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s10601-008-9047-y","volume":"13","author":"AM Frisch","year":"2008","unstructured":"Frisch, A.M., Harvey, W., Jefferson, C., Hern\u00e1ndez, B.M., Miguel, I.: Essence: a constraint language for specifying combinatorial problems. Constraints Int. J. 13(3), 268\u2013306 (2008). https:\/\/doi.org\/10.1007\/s10601-008-9047-y","journal-title":"Constraints Int. J."},{"key":"22_CR19","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Minion: a fast scalable constraint solver. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI 2006, 17th European Conference on Artificial Intelligence, 29 August\u20131 September 2006, Riva del Garda, Italy, Including Prestigious Applications of Intelligent Systems (PAIS 2006), Proceedings. Frontiers in Artificial Intelligence and Applications, vol. 141, pp. 98\u2013102. IOS Press (2006)"},{"issue":"3","key":"22_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012). https:\/\/doi.org\/10.1016\/j.physrep.2012.03.001","journal-title":"Phys. Rep."},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-319-50349-3_8","volume-title":"Learning and Intelligent Optimization","author":"L Kotthoff","year":"2016","unstructured":"Kotthoff, L., McCreesh, C., Solnon, C.: Portfolios of subgraph isomorphism algorithms. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) LION 2016. LNCS, vol. 10079, pp. 107\u2013122. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50349-3_8"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-319-23219-5_21","volume-title":"Principles and Practice of Constraint Programming","author":"C McCreesh","year":"2015","unstructured":"McCreesh, C., Prosser, P.: A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 295\u2013312. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_21"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-66158-2_14","volume-title":"Principles and Practice of Constraint Programming","author":"C McCreesh","year":"2017","unstructured":"McCreesh, C., Prosser, P., Simpson, K., Trimble, J.: On maximum weight clique algorithms, and how they are evaluated. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 206\u2013225. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_14"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-030-51372-6_19","volume-title":"Graph Transformation","author":"C McCreesh","year":"2020","unstructured":"McCreesh, C., Prosser, P., Trimble, J.: The glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants. In: Gadducci, F., Kehrer, T. (eds.) ICGT 2020. LNCS, vol. 12150, pp. 316\u2013324. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51372-6_19"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-540-74970-7_39","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"O Ohrimenko","year":"2007","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation = lazy clause generation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 544\u2013558. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_39"},{"issue":"11","key":"22_CR26","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.14778\/3137628.3137647","volume":"10","author":"S Pande","year":"2017","unstructured":"Pande, S., Ranu, S., Bhattacharya, A.: SkyGraph: retrieving regions of interest using skyline subgraph queries. Proc. VLDB Endow. 10(11), 1382\u20131393 (2017). https:\/\/doi.org\/10.14778\/3137628.3137647","journal-title":"Proc. VLDB Endow."},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P Prosser","year":"1993","unstructured":"Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Comput. Intell. 9, 268\u2013299 (1993). https:\/\/doi.org\/10.1111\/j.1467-8640.1993.tb00310.x","journal-title":"Comput. Intell."},{"key":"22_CR28","doi-asserted-by":"publisher","unstructured":"Redmond, U., Cunningham, P.: Temporal subgraph isomorphism. In: Rokne, J.G., Faloutsos, C. (eds.) Advances in Social Networks Analysis and Mining 2013, ASONAM 2013, Niagara, ON, Canada, 25\u201329 August 2013, pp. 1451\u20131452. ACM (2013). https:\/\/doi.org\/10.1145\/2492517.2492586","DOI":"10.1145\/2492517.2492586"},{"key":"22_CR29","unstructured":"R\u00e9gin, J.: D\u00e9veloppement d\u2019outils algorithmiques pour l\u2019Intelligence Artificielle. Application \u00e0 la chimie organique. Ph.D. thesis, Universit\u00e9 Montpellier 2 (1995)"},{"issue":"36","key":"22_CR30","doi-asserted-by":"publisher","first-page":"9977","DOI":"10.1073\/pnas.1602803113","volume":"113","author":"V Sekara","year":"2016","unstructured":"Sekara, V., Stopczynski, A., Lehmann, S.: Fundamental structures of dynamic social networks. Proc. Natl. Acad. Sci. 113(36), 9977\u20139982 (2016)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"22_CR31","doi-asserted-by":"publisher","unstructured":"Semer\u00e1th, O., Nagy, A.S., Varr\u00f3, D.: A graph solver for the automated generation of consistent domain-specific models. In: Chaudron, M., Crnkovic, I., Chechik, M., Harman, M. (eds.) Proceedings of the 40th International Conference on Software Engineering, ICSE 2018, Gothenburg, Sweden, 27 May\u201303 June 2018, pp. 969\u2013980. ACM (2018). https:\/\/doi.org\/10.1145\/3180155.3180186","DOI":"10.1145\/3180155.3180186"},{"key":"22_CR32","doi-asserted-by":"publisher","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP - a new search algorithm for satisfiability. In: Rutenbar, R.A., Otten, R.H.J.M. (eds.) Proceedings of the 1996 IEEE\/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, 10\u201314 November 1996, pp. 220\u2013227. IEEE Computer Society\/ACM (1996). https:\/\/doi.org\/10.1109\/ICCAD.1996.569607","DOI":"10.1109\/ICCAD.1996.569607"},{"key":"22_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-20081-7_1","volume-title":"Graph-Based Representations in Pattern Recognition","author":"C Solnon","year":"2019","unstructured":"Solnon, C.: Experimental evaluation of subgraph isomorphism solvers. In: Conte, D., Ramel, J.-Y., Foggia, P. (eds.) GbRPR 2019. LNCS, vol. 11510, pp. 1\u201313. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20081-7_1"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-13520-0_3","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"PJ Stuckey","year":"2010","unstructured":"Stuckey, P.J.: Lazy clause generation: combining the power of sat and CP (and MIP?) solving. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 5\u20139. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13520-0_3"},{"issue":"2","key":"22_CR35","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/15M1030054","volume":"59","author":"C V\u00f6mel","year":"2017","unstructured":"V\u00f6mel, C., de Lorenzi, F., Beer, S., Fuchs, E.: The secret life of keys: on the calculation of mechanical lock systems. SIAM Rev. 59(2), 393\u2013422 (2017). https:\/\/doi.org\/10.1137\/15M1030054","journal-title":"SIAM Rev."},{"issue":"3","key":"22_CR36","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10601-009-9074-3","volume":"15","author":"S Zampelli","year":"2010","unstructured":"Zampelli, S., Deville, Y., Solnon, C.: Solving subgraph isomorphism problems with constraint programming. Constraints 15(3), 327\u2013353 (2010)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78230-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T23:13:16Z","timestamp":1623885196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78230-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030782290","9783030782306"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78230-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2021","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":"cpaior2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2021.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":"75","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":"40% - 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":"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":"Due to the COVID-19 pandemic the conference was held online.","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)"}}]}}