{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:15:45Z","timestamp":1742912145616,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296932"},{"type":"electronic","value":"9783642296949"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-29694-9_15","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T16:49:27Z","timestamp":1343321367000},"page":"371-402","source":"Crossref","is-referenced-by-count":0,"title":["MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays"],"prefix":"10.1007","author":[{"given":"Loreto","family":"Gonzalez-Hernandez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Torres-Jimenez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelson","family":"Rangel-Valdez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-05258-3_35","volume-title":"MICAI 2009: Advances in Artificial Intelligence","author":"J. Bracho-Rios","year":"2009","unstructured":"Bracho-Rios, J., Torres-Jimenez, J., Rodriguez-Tello, E.: A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength. In: Aguirre, A.H., Borja, R.M., Garci\u00e1, C.A.R. (eds.) MICAI 2009. LNCS, vol.\u00a05845, pp. 397\u2013407. Springer, Heidelberg (2009)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/stvr.365","volume":"17","author":"R.C. Bryce","year":"2007","unstructured":"Bryce, R.C., Colbourn, C.J.: The density algorithm for pairwise interaction testing: Research articles. Software Testing, Verification and Reliability\u00a017, 159\u2013182 (2007)","journal-title":"Software Testing, Verification and Reliability"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1145\/1276958.1277173","volume-title":"Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation Conference, GECCO 2007","author":"R.C. Bryce","year":"2007","unstructured":"Bryce, R.C., Colbourn, C.J.: One-test-at-a-time heuristic search for interaction test suites. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation Conference, GECCO 2007, July 7-11, 2007, pp. 1082\u20131089. ACM, New York (2007)"},{"key":"15_CR4","unstructured":"Burnstein, I.: Practical software testing: a process-oriented approach. Springer Professional Computing (2003) ISBN: 0-387-95131-8"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1214\/aoms\/1177729387","volume":"23","author":"K.A. Bush","year":"1952","unstructured":"Bush, K.A.: Orthogonal arrays of index unity. Annals of Mathematical Statistics\u00a023(3), 426\u2013434 (1952)","journal-title":"Annals of Mathematical Statistics"},{"key":"15_CR6","first-page":"1","volume":"43","author":"N. Changhai","year":"2011","unstructured":"Changhai, N., Hareton, L.: A survey of combinatorial testing. ACM Computing Surveys (CSUR)\u00a043, 11:1\u201311:29 (2011)","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"7","key":"15_CR7","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/32.605761","volume":"23","author":"D.M. Cohen","year":"1997","unstructured":"Cohen, D.M., Fredman, M.L., Patton, G.C.: The aetg system: An approach to testing based on combinatorial design. IEEE Transactions on Software Engineering\u00a023(7), 437\u2013444 (1997)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/ICSE.2003.1201186","volume-title":"Proceedings of the 25th International Conference on Software Engineering, ICSE 2003","author":"M.B. Cohen","year":"2003","unstructured":"Cohen, M.B., Gibbons, P.B., Mugridge, W.B., Colbourn, C.J.: Constructing test suites for interaction testing. In: Proceedings of the 25th International Conference on Software Engineering, ICSE 2003, May 3-10, pp. 38\u201348. IEEE Computer Society, Washington, DC (2003)"},{"key":"15_CR9","unstructured":"Colbourn, C.J., \n                      http:\/\/www.public.asu.edu\/~ccolbou\/src\/tabby\/6-4-ca.html'"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10623-009-9333-8","volume":"55","author":"C.J. Colbourn","year":"2010","unstructured":"Colbourn, C.J.: Covering arrays from cyclotomy. Designs, Codes and Cryptography\u00a055, 201\u2013219 (2010)","journal-title":"Designs, Codes and Cryptography"},{"key":"15_CR11","unstructured":"Colbourn, C.J., Cohen, M.B., Turban, R.C.: A deterministic density algorithm for pairwise interaction coverage. In: Proceedings of the IASTED International Conference on Software Engineering, February 17-19, pp. 345\u2013352 (2004)"},{"key":"15_CR12","doi-asserted-by":"publisher","DOI":"10.1201\/9781420049954","volume-title":"The CRC Handbook of Combinatorial Designs","author":"C.J. Colbourn","year":"1996","unstructured":"Colbourn, C.J., Dinitz, J.H.: The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (1996) ISBN: 0-8493-8948-8"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10623-006-0020-8","volume":"41","author":"C.J. Colbourn","year":"2006","unstructured":"Colbourn, C.J., Martirosyan, S., Trung, T., Walker II., R.A.: Roux-type constructions for covering arrays of strengths three and four. Designs, Codes and Cryptography\u00a041, 33\u201357 (2006), doi:10.1007\/s10623-006-0020-8","journal-title":"Designs, Codes and Cryptography"},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1002\/jcd.20065","volume":"14","author":"C.J. Colbourn","year":"2006","unstructured":"Colbourn, C.J., Martirosyan, S.S., Mullen, G.L., Shasha, D., Sherwood, G.B., Yucas, J.L.: Products of mixed covering arrays of strength two. Journal of Combinatorial Designs\u00a014(2), 124\u2013138 (2006)","journal-title":"Journal of Combinatorial Designs"},{"issue":"5","key":"15_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.6028\/jres.113.022","volume":"113","author":"M. Forbes","year":"2008","unstructured":"Forbes, M., Lawrence, J., Lei, Y., Kacker, R.N., Kuhn, D.R.: Refining the in-parameter-order strategy for constructing covering arrays. Journal of Research of the National Institute of Standards and Technology\u00a0113(5), 287\u2013297 (2008)","journal-title":"Journal of Research of the National Institute of Standards and Technology"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers (1998) ISBN 0-7923-9965-X","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-17458-2_6","volume-title":"Combinatorial Optimization and Applications","author":"L. Gonzalez-Hernandez","year":"2010","unstructured":"Gonzalez-Hernandez, L., Rangel-Valdez, N., Torres-Jimenez, J.: Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part I. LNCS, vol.\u00a06508, pp. 51\u201364. Springer, Heidelberg (2010)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-16773-7_33","volume-title":"Advances in Soft Computing","author":"L. Gonzalez-Hernandez","year":"2010","unstructured":"Gonzalez-Hernandez, L., Torres-Jimenez, J.: MiTS: A New Approach of Tabu Search for Constructing Mixed Covering Arrays. In: Sidorov, G., Hern\u00e1ndez Aguirre, A., Reyes Garc\u00eda, C.A. (eds.) MICAI 2010, Part II. LNCS, vol.\u00a06438, pp. 382\u2013393. Springer, Heidelberg (2010), \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-16773-7_33"},{"key":"15_CR19","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-25324-9_18","volume-title":"Advances in Artificial Intelligence","author":"L. Gonzalez-Hernandez","year":"2011","unstructured":"Gonzalez-Hernandez, L., Torres-Jim\u00e9nez, J., Rangel-Valdez, N.: An Exact Approach to Maximize the Number of Wild Cards in a Covering Array. In: Batyrshin, I., Sidorov, G. (eds.) MICAI 2011, Part I. LNCS (LNAI), vol.\u00a07094, pp. 210\u2013221. Springer, Heidelberg (2011)"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.disc.2003.11.029","volume":"284","author":"A. Hartman","year":"2004","unstructured":"Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. Discrete Mathematics\u00a0284, 149\u2013156 (2004)","journal-title":"Discrete Mathematics"},{"key":"15_CR21","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\u00a011, 199\u2013219 (2006), doi:10.1007\/s10601-006-7094-9","journal-title":"Constraints"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.jspi.2008.05.020","volume":"139","author":"R.A. Walker II","year":"2009","unstructured":"Walker II, R.A., Colbourn, C.J.: Tabu search for covering arrays using permutation vectors. Journal of Statistical Planning and Inference\u00a0139(1), 69\u201380 (2009)","journal-title":"Journal of Statistical Planning and Inference"},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.jcta.2009.06.002","volume":"117","author":"L. Ji","year":"2010","unstructured":"Ji, L., Yin, J.: Constructions of new orthogonal arrays and covering arrays of strength three. Journal of Combinatorial Theory Series A\u00a0117, 236\u2013247 (2010)","journal-title":"Journal of Combinatorial Theory Series A"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF02018457","volume":"3","author":"G.O.H. Katona","year":"1973","unstructured":"Katona, G.O.H.: Two applications (for search theory and truth functions) of sperner type theorems. Periodica Mathematica Hungarica\u00a03, 19\u201326 (1973)","journal-title":"Periodica Mathematica Hungarica"},{"issue":"3","key":"15_CR25","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(73)90098-8","volume":"6","author":"D.J. Kleitmain","year":"1973","unstructured":"Kleitmain, D.J., Spencer, J.: Families of k-independent sets. Discrete Mathematics\u00a06(3), 255\u2013262 (1973)","journal-title":"Discrete Mathematics"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Kuhn, D.R., Kacker, R.N., Lei, Y.: Practical combinatorial testing. Technical report, National Institute of Standards and Technology (October 2010)","DOI":"10.6028\/NIST.SP.800-142"},{"key":"15_CR27","unstructured":"Kuhn, D.R., Kacker, R.N., Lei, Y.: Advanced combinatorial test methods for system reliability. Technical report, 2010 Annual Technical Report of the IEEE Reliability Society, 2010 Annual Technical Report (January 2011)"},{"key":"15_CR28","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TSE.2004.24","volume":"30","author":"D.R. Kuhn","year":"2004","unstructured":"Kuhn, D.R., Wallance, D.R., Gallo Jr., A.M.: Software fault interactions and implications for software testing. IEEE Transactions on Software Engineering\u00a030, 418\u2013421 (2004)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-16561-0_36","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"V. Kuliamin","year":"2010","unstructured":"Kuliamin, V., Petukhov, A.: Covering Arrays Generation Methods Survey. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol.\u00a06416, pp. 382\u2013396. Springer, Heidelberg (2010), doi:10.1007\/978-3-642-16561-0_36"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1134\/S0361768811030029","volume":"37","author":"V. Kuliamin","year":"2011","unstructured":"Kuliamin, V., Petukhov, A.: A survey of methods for constructing covering arrays. Programming and Computer Software\u00a037, 121\u2013146 (2011)","journal-title":"Programming and Computer Software"},{"key":"15_CR31","doi-asserted-by":"crossref","first-page":"84","DOI":"10.37236\/571","volume":"18","author":"J. Lawrence","year":"2011","unstructured":"Lawrence, J., Kacker, R.N., Lei, Y., Kuhn, D.R., Forbes, M.: A survey of binary covering arrays. Electronic Journals of Combinatorics\u00a018, P84 (2011)","journal-title":"Electronic Journals of Combinatorics"},{"key":"15_CR32","unstructured":"Lions, J.L.: Ariane 5, flight 501, report of the inquiry board. European Space Agency (July 1996)"},{"key":"15_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-642-16952-6_58","volume-title":"Advances in Artificial Intelligence \u2013 IBERAMIA 2010","author":"J. Martinez-Pena","year":"2010","unstructured":"Martinez-Pena, J., Torres-Jimenez, J., Rangel-Valdez, N., Avila-George, H.: A heuristic approach for constructing ternary covering arrays using trinomial coefficients. In: Kuri-Morales, A., Simari, G.R. (eds.) IBERAMIA 2010. LNCS, vol.\u00a06433, pp. 572\u2013581. Springer, Heidelberg (2010), doi:10.1007\/978-3-642-16952-6_58"},{"key":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-10217-2_40","volume-title":"Combinatorial Algorithms","author":"P. Nayeri","year":"2009","unstructured":"Nayeri, P., Colbourn, C.J., Konjevod, G.: Randomized postoptimization of covering arrays. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 408\u2013419. Springer, Heidelberg (2009), doi:10.1007\/978-3-642-10217-2_40"},{"issue":"1-2","key":"15_CR35","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(03)00291-9","volume":"138","author":"K.J. Nurmela","year":"2004","unstructured":"Nurmela, K.J.: Upper bounds for covering arrays by tabu search. Discrete Applied Mathematics\u00a0138(1-2), 143\u2013152 (2004); Optimal Discrete Structures and Algorithms","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR36","unstructured":"R\u00e9nyi, A.: Foundations of Probability. Wiley (1971) ISBN: 0486462617"},{"key":"15_CR37","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-88636-5_46","volume-title":"MICAI 2008: Advances in Artificial Intelligence","author":"L.C.A. Rodrigues","year":"2008","unstructured":"Rodrigues, L.C.A., Weller, T.R.: Cell Formation with Alternative Routings and Capacity Considerations: A Hybrid Tabu Search Approach. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol.\u00a05317, pp. 482\u2013491. Springer, Heidelberg (2008)"},{"key":"15_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-14156-0_8","volume-title":"Artifical Evolution","author":"E. Rodriguez-Tello","year":"2010","unstructured":"Rodriguez-Tello, E., Torres-Jimenez, J.: Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three. In: Collet, P., Monmarch\u00e9, N., Legrand, P., Schoenauer, M., Lutton, E. (eds.) EA 2009. LNCS, vol.\u00a05975, pp. 86\u201397. Springer, Heidelberg (2010)"},{"key":"15_CR39","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/CMPSAC.2004.1342808","volume-title":"Proceedings of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004","author":"T. Shiba","year":"2004","unstructured":"Shiba, T., Tsuchiya, T., Kikuno, T.: Using artificial life techniques to generate test cases for combinatorial testing. In: Proceedings of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004, September 27-30, vol.\u00a01, pp. 72\u201377. IEEE Computer Society, Washington, DC (2004)"},{"key":"15_CR40","unstructured":"Stardom, J.: Metaheuristics and the search for covering and packing arrays. Master\u2019s thesis, Simon Fraser University (2001)"},{"key":"15_CR41","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/32.979992","volume":"28","author":"K.C. Tai","year":"2002","unstructured":"Tai, K.C., Lei, Y.: A test generation strategy for pairwise testing. IEEE Transactions on Software Engineering\u00a028, 109\u2013111 (2002)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"15_CR42","unstructured":"Tassey, G.: The economic impacts of inadequate infrastructure for software testing. Technical report, National Institute of Standards and Technology (May 2002)"},{"key":"15_CR43","doi-asserted-by":"crossref","unstructured":"Torres-Jimenez, J., Rodriguez-Tello, E.: Simulated annealing for constructing binary covering arrays of variable strength. In: IEEE Congress on Evolutionary Computation, CEC 2010, July 18-23, pp. 1\u20138 (2010)","DOI":"10.1109\/CEC.2010.5586148"},{"issue":"1","key":"15_CR44","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.ins.2011.09.020","volume":"185","author":"J. Torres-Jimenez","year":"2012","unstructured":"Torres-Jimenez, J., Rodriguez-Tello, E.: New bounds for binary covering arrays using simulated annealing. Information Sciences\u00a0185(1), 137\u2013152 (2012)","journal-title":"Information Sciences"},{"key":"15_CR45","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"42","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society\u00a042, 230\u2013265 (1936)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"15_CR46","first-page":"59","volume-title":"TestCom 2000: Proceedings of the IFIP TC6\/WG6.1 13th International Conference on Testing Communicating Systems","author":"A.W. Williams","year":"2000","unstructured":"Williams, A.W.: Determination of test configurations for pair-wise interaction coverage. In: TestCom 2000: Proceedings of the IFIP TC6\/WG6.1 13th International Conference on Testing Communicating Systems, August 29-September 1, pp. 59\u201374. B.V. Kluwer, Deventer (2000)"},{"key":"15_CR47","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1109\/ISSRE.1996.558835","volume-title":"Proceedings of the The Seventh International Symposium on Software Reliability Engineering, ISSRE 1996","author":"A.W. Williams","year":"1996","unstructured":"Williams, A.W., Probert, R.L.: A practical strategy for testing pair-wise coverage of network interfaces. In: Proceedings of the The Seventh International Symposium on Software Reliability Engineering, ISSRE 1996, October 30-November 02, pp. 246\u2013254. IEEE Computer Society, Washington, DC (1996)"},{"key":"15_CR48","first-page":"385","volume-title":"30th Annual International on Computer Software and Applications Conference, COMPSAC 2006","author":"J. Yan","year":"2006","unstructured":"Yan, J., Zhang, J.: Backtracking algorithms and search heuristics to generate test suites for combinatorial testing. In: 30th Annual International on Computer Software and Applications Conference, COMPSAC 2006, September 17-21, vol.\u00a01, pp. 385\u2013394. IEEE Computer Society, Washington, DC (2006)"},{"key":"15_CR49","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1016\/j.jss.2008.02.034","volume":"81","author":"J. Yan","year":"2008","unstructured":"Yan, J., Zhang, J.: A backtraking search tool for constructing combinatorial test suites. The Journal of Systems and Software\u00a081, 1681\u20131693 (2008)","journal-title":"The Journal of Systems and Software"},{"key":"15_CR50","unstructured":"Zekaoui, L.: Mixed covering arrays on graphs and tabu search algorithms. Master\u2019s thesis, Ottawa-Carleton Institute for Computer Science at the University of Ottawa (2006)"}],"container-title":["Studies in Computational Intelligence","Artificial Intelligence, Evolutionary Computing and Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29694-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T09:14:20Z","timestamp":1675934060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29694-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642296932","9783642296949"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29694-9_15","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}