{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:30:45Z","timestamp":1726032645390},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030213626"},{"type":"electronic","value":"9783030213633"}],"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"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21363-3_15","type":"book-chapter","created":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:02:48Z","timestamp":1560726168000},"page":"177-189","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Algebraic Models for Arbitrary Strength Covering Arrays over v-ary Alphabets"],"prefix":"10.1007","author":[{"given":"Ludwig","family":"Kampel","sequence":"first","affiliation":[]},{"given":"Dimitris E.","family":"Simos","sequence":"additional","affiliation":[]},{"given":"Bernhard","family":"Garn","sequence":"additional","affiliation":[]},{"given":"Ilias S.","family":"Kotsireas","sequence":"additional","affiliation":[]},{"given":"Evgeny","family":"Zhereshchin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,24]]},"reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/stvr.393","volume":"19","author":"RC Bryce","year":"2009","unstructured":"Bryce, R.C., Colbourn, C.J.: A density-based greedy algorithm for higher strength covering arrays. Softw. Test. Verif. Reliab. 19(1), 37\u201353 (2009)","journal-title":"Softw. Test. Verif. Reliab."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.jsc.2005.09.007","volume":"41","author":"B Buchberger","year":"2006","unstructured":"Buchberger, B.: Bruno Buchberger\u2019s PhD thesis 1965: an algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. J. Symb. Comput. 41, 475\u2013511 (2006)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1214\/aoms\/1177729387","volume":"23","author":"KA Bush","year":"1952","unstructured":"Bush, K.A., et al.: Orthogonal arrays of index unity. Ann. Math. Stat. 23(3), 426\u2013434 (1952)","journal-title":"Ann. Math. Stat."},{"issue":"1, 2","key":"15_CR4","first-page":"125","volume":"59","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn, C.J.: Combinatorial aspects of covering arrays. Le Mathematiche 59(1, 2), 125\u2013172 (2004)","journal-title":"Le Mathematiche"},{"key":"15_CR5","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010541","volume-title":"Handbook of Combinatorial Designs","author":"CJ Colbourn","year":"2006","unstructured":"Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs. CRC Press, Boca Raton (2006)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-85097-7_28","volume-title":"Combinatorial Optimization and Applications","author":"P Danziger","year":"2008","unstructured":"Danziger, P., Mendelsohn, E., Moura, L., Stevens, B.: Covering arrays avoiding forbidden edges. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 296\u2013308. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85097-7_28"},{"key":"15_CR7","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-56932-1_10","volume-title":"Applications of Computer Algebra","author":"B Garn","year":"2017","unstructured":"Garn, B., Simos, D.E.: Algebraic modelling of covering arrays. In: Kotsireas, I.S., Mart\u00ednez-Moro, E. (eds.) ACA 2015. PROMS, vol. 198, pp. 149\u2013170. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56932-1_10"},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10601-006-7094-9","volume":"11","author":"B Hnich","year":"2006","unstructured":"Hnich, B., Prestwich, S.D., Selensky, E., Smith, B.M.: Constraint models for the covering test problem. Constraints 11(2), 199\u2013219 (2006)","journal-title":"Constraints"},{"doi-asserted-by":"crossref","unstructured":"Kampel, L., Simos, D.E.: A survey on the state of the art of complexity problems for covering arrays. Theoret. Comput. Sci. (2018, to appear)","key":"15_CR9","DOI":"10.1016\/j.tcs.2019.10.019"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(73)90098-8","volume":"6","author":"DJ Kleitman","year":"1973","unstructured":"Kleitman, D.J., Spencer, J.: Families of k-independent sets. Discrete Math. 6(3), 255\u2013262 (1973)","journal-title":"Discrete Math."},{"key":"15_CR11","volume-title":"Combinatorial Algorithms: Generation, Enumeration, and Search","author":"DL Kreher","year":"1998","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration, and Search, 1st edn. CRC Press, Boca Raton (1998)","edition":"1"},{"key":"15_CR12","series-title":"Chapman & Hall\/CRC Innovations in Software Engineering and Software Development Series","volume-title":"Introduction to Combinatorial Testing","author":"D Kuhn","year":"2013","unstructured":"Kuhn, D., Kacker, R., Lei, Y.: Introduction to Combinatorial Testing. Chapman & Hall\/CRC Innovations in Software Engineering and Software Development Series. Taylor & Francis, London (2013)"},{"issue":"8","key":"15_CR13","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1109\/MC.2009.253","volume":"42","author":"R Kuhn","year":"2009","unstructured":"Kuhn, R., Kacker, R., Lei, Y., Hunter, J.: Combinatorial software testing. Computer 42(8), 94\u201396 (2009)","journal-title":"Computer"},{"unstructured":"Lei, Y., Tai, K.C.: In-parameter-order: a test generation strategy for pairwise testing. In: Proceedings of the Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No. 98EX231), pp. 254\u2013261 (1998)","key":"15_CR14"},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ejc.2012.07.017","volume":"34","author":"P Nayeri","year":"2013","unstructured":"Nayeri, P., Colbourn, C.J., Konjevod, G.: Randomized post-optimization of covering arrays. Eur. J. Comb. 34(1), 91\u2013103 (2013)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/18.6031","volume":"34","author":"G Seroussi","year":"1988","unstructured":"Seroussi, G., Bshouty, N.H.: Vector sets for exhaustive testing of logic circuits. IEEE Trans. Inf. Theory 34(3), 513\u2013522 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Torres-Jimenez, J., Izquierdo-Marquez, I.: Survey of covering arrays. In: 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 20\u201327 (2013)","key":"15_CR17","DOI":"10.1109\/SYNASC.2013.10"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21363-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:36:16Z","timestamp":1709818576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21363-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030213626","9783030213633"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21363-3_15","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":"24 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algebraic Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ni\u0161","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Serbia","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":"30 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cai2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.pmf.ni.ac.rs\/CAI2019\/index.html","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":"35","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":"20","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":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.76","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)"}}]}}