{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:40:57Z","timestamp":1743126057234,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131189"},{"type":"electronic","value":"9783642131196"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-13119-6_40","type":"book-chapter","created":{"date-parts":[[2010,5,26]],"date-time":"2010-05-26T00:35:39Z","timestamp":1274834139000},"page":"463-475","source":"Crossref","is-referenced-by-count":1,"title":["A Step-by-Step Extending Parallelism Approach for Enumeration of Combinatorial Objects"],"prefix":"10.1007","author":[{"given":"Hien","family":"Phan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben","family":"Soh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Man","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1993","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Applied Mathematics\u00a065, 21\u201346 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: APriori, pp. 487\u2013499 (1994)"},{"issue":"3","key":"40_CR3","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1021\/ci025526c","volume":"43","author":"G. Brinkmann","year":"2003","unstructured":"Brinkmann, G., Caporossi, G., Hansen, P.: A survey and new results on computer enumeration of polyhex and fusene hydrocarbons. Journal of Chemical Information and Computer Sciences\u00a043(3), 842\u2013851 (2003)","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"40_CR4","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1109\/SFCS.2001.959892","volume-title":"FOCS 2001: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science","author":"P. Berenbrink","year":"2001","unstructured":"Berenbrink, P., Friedetzky, T.: The natural work-stealing algorithm is stable. In: FOCS 2001: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, Washington, DC, USA, p. 178. IEEE Computer Society, Los Alamitos (2001)"},{"issue":"12","key":"40_CR5","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1110\/ps.051428205","volume":"14","author":"Y. Chen","year":"2005","unstructured":"Chen, Y., Crippen, G.M.: A novel approach to structural alignment using realistic structural and environmental information. Protein Science\u00a014(12), 2935\u20132946 (2005)","journal-title":"Protein Science"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1654059.1654113","volume-title":"SC 2009: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis","author":"J. Dinan","year":"2009","unstructured":"Dinan, J., Larkins, D.B., Sadayappan, P., Krishnamoorthy, S., Nieplocha, J.: Scalable work stealing. In: SC 2009: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, pp. 1\u201311. ACM, New York (2009)"},{"key":"40_CR7","first-page":"131","volume":"260","author":"I.A. Faradzev","year":"1978","unstructured":"Faradzev, I.A.: Constructive enumeration of combinatorial objects. problemes combinatoires et theorie des graphes collogue interat. CNRS\u00a0260, 131\u2013135 (1978)","journal-title":"CNRS"},{"key":"40_CR8","first-page":"113","volume-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"T. Grner","year":"1996","unstructured":"Grner, T., Laue, R., Meringer, M., Bayreuth, U.: Algorithms for group actions: Homomorphism principle and orderly generation applied to graphs. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 113\u2013122. American Mathematical Society, Providence (1996)"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Kumar, V., Grama, A.Y., Rao, V.N.: Scalable load balancing techniques for parallel computers. Journal of Parallel and Distributed computing, 60\u201379 (1994)","DOI":"10.1006\/jpdc.1994.1070"},{"key":"40_CR10","unstructured":"Kaski, P., Ostergard, P.R.J.: Classification algorithms for codes and designs. Algorithms and Computation in Mathematics\u00a015 (2006)"},{"key":"40_CR11","unstructured":"Khosrovshahi, G.B., Tayfeh-Rezaie, B.: Classification of simple 2-(11,3,3) designs. Discrete Mathematics\u00a0309(3), 515\u2013520 (2009); International Workshop on Design Theory, Graph Theory, and Computational Methods - IPM Combinatorics II, International Workshop on Design Theory, Graph Theory, and Computational Methods"},{"issue":"8","key":"40_CR12","first-page":"1319","volume":"7","author":"L. Lazic","year":"2008","unstructured":"Lazic, L., Mastorakis, N.: Orthogonal array application for optimal combination of software defect detection techniques choices. W. Trans. on Comp.\u00a07(8), 1319\u20131336 (2008)","journal-title":"W. Trans. on Comp."},{"issue":"1","key":"40_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0168-874X(03)00095-7","volume":"40","author":"K.-H. Lee","year":"2003","unstructured":"Lee, K.-H., Yi, J.-W., Park, J.-S., Park, G.-J.: An optimization algorithm using orthogonal arrays in discrete design space for structures. Finite Elements in Analysis and Design\u00a040(1), 121\u2013135 (2003)","journal-title":"Finite Elements in Analysis and Design"},{"issue":"2","key":"40_CR14","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"B.D. McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms\u00a026(2), 306\u2013324 (1998)","journal-title":"J. Algorithms"},{"key":"40_CR15","unstructured":"Message-Passing Interface Forum. MPI-2.0: Extensions to the Message-Passing Interface, ch. 9. MPI Forum (June 1997)"},{"key":"40_CR16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/9780470175668.ch2","volume-title":"Handbook of Applied Algorithms: Solving Scientic, Engineering, and Practical Problems","author":"L. Moura","year":"2008","unstructured":"Moura, L., Stojmenovic, I.: Backtracking and isomorph-free generation of polyhexes. In: Nayak, A., Stojmenovic, I. (eds.) Handbook of Applied Algorithms: Solving Scientic, Engineering, and Practical Problems, pp. 39\u201383. John Wiley & Sons, Chichester (2008)"},{"key":"40_CR17","unstructured":"Nguyen, M.: Computer-algebraic methods for the construction of designs of experiments. Ph.D. Thesis, Technische Universiteit Eindhoven (2005)"},{"issue":"1","key":"40_CR18","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.jspi.2007.05.010","volume":"138","author":"M.V.M. Nguyen","year":"2008","unstructured":"Nguyen, M.V.M.: Some new constructions of strength 3 mixed orthogonal arrays. Journal of Statistical Planning and Inference\u00a0138(1), 220\u2013233 (2008)","journal-title":"Journal of Statistical Planning and Inference"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Park, B.-H., Samatova, N.F., Karpinets, T., Jallouk, A., Molony, S., Horton, S., Arcangeli, S.: Data-driven, data-intensive computing for modelling and analysis of biological networks: application to bioethanol production. Journal of Physics: Conference Series\u00a078, 012061 (6p.) (2007)","DOI":"10.1088\/1742-6596\/78\/1\/012061"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Read, R.C.: Every one a winner. Ann Discrete Math., 107\u2013120 (1979)","DOI":"10.1016\/S0167-5060(08)70325-X"},{"issue":"2","key":"40_CR21","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/jcd.20236","volume":"18","author":"E.D. Schoen","year":"2010","unstructured":"Schoen, E.D., Eendebak, P.T., Nguyen, M.V.M.: Complete enumeration of pure-level and mixed-level orthogonal array. Journal of Combinatorial Designs\u00a018(2), 123\u2013140 (2010)","journal-title":"Journal of Combinatorial Designs"},{"key":"40_CR22","volume-title":"Proc. Sympos. Appl. Math.","author":"R.J. Walker","year":"1960","unstructured":"Walker, R.J.: An enumerative technique for a class of combinatorial problems. In: Proc. Sympos. Appl. Math., vol.\u00a010. American Mathematical Society, Providence (1960)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13119-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T22:05:17Z","timestamp":1676066717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-13119-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131189","9783642131196"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13119-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}