{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:02:12Z","timestamp":1769968932361,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,4,20]],"date-time":"2013-04-20T00:00:00Z","timestamp":1366416000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00453-013-9781-4","type":"journal-article","created":{"date-parts":[[2013,4,19]],"date-time":"2013-04-19T16:59:44Z","timestamp":1366390784000},"page":"324-354","source":"Crossref","is-referenced-by-count":11,"title":["Two New Perspectives on Multi-Stage Group Testing"],"prefix":"10.1007","volume":"67","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[]},{"given":"Azam Sheikh","family":"Muhammad","sequence":"additional","affiliation":[]},{"given":"Eberhard","family":"Triesch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,20]]},"reference":[{"key":"9781_CR1","volume-title":"Combinatorial Search","author":"M. Aigner","year":"1988","unstructured":"Aigner, M.: Combinatorial Search. Wiley-Teubner, New York (1988)"},{"key":"9781_CR2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/jcta.1996.0041","volume":"74","author":"D.J. Balding","year":"1996","unstructured":"Balding, D.J., Torney, D.C.: Optimal pooling designs with error detection. J. Comb. Theory, Ser. A 74, 131\u2013140 (1996)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"9781_CR3","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1002\/1520-6750(199010)37:5<647::AID-NAV3220370505>3.0.CO;2-6","volume":"37","author":"S.K. Bar-Lev","year":"1990","unstructured":"Bar-Lev, S.K., Boneh, A., Perry, D.: Incomplete identification models for group-testable items. Nav. Res. Logist. 37, 647\u2013659 (1990)","journal-title":"Nav. Res. Logist."},{"key":"9781_CR4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1089\/cmb.2007.0195","volume":"15","author":"Y. Cheng","year":"2008","unstructured":"Cheng, Y., Du, D.Z.: New constructions of one- and two-stage pooling designs. J. Comput. Biol. 15, 195\u2013205 (2008)","journal-title":"J. Comput. Biol."},{"key":"9781_CR5","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1504\/IJBRA.2005.008441","volume":"1","author":"F. Cicalese","year":"2005","unstructured":"Cicalese, F., Damaschke, P., Vaccaro, U.: Optimal group testing strategies with interval queries and their application to splice site detection. Int. J. Bioinform. Res. Appl. 1, 363\u2013388 (2005)","journal-title":"Int. J. Bioinform. Res. Appl."},{"key":"9781_CR6","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.dam.2006.07.002","volume":"155","author":"F. Cicalese","year":"2007","unstructured":"Cicalese, F., Damaschke, P., Tansini, L., Werth, S.: Overlaps help: improved bounds for group testing with interval queries. Discrete Appl. Math. 155, 288\u2013299 (2007)","journal-title":"Discrete Appl. Math."},{"key":"9781_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0097-3165(78)90077-8","volume":"25","author":"G.F. Clements","year":"1978","unstructured":"Clements, G.F.: The minimal number of basic elements in a multiset antichain. J. Comb. Theory, Ser. A 25, 153\u2013162 (1978)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"9781_CR8","doi-asserted-by":"crossref","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)"},{"key":"9781_CR9","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/978-3-642-22935-0_39","volume-title":"Approximation, Randomization, and Combinatorial Optimization","author":"D. Dachman-Soled","year":"2011","unstructured":"Dachman-Soled, D., Servedio, R.: A canonical form for testing Boolean function properties. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques APPROX-RANDOM 2011. LNCS, vol. 6845, pp. 460\u2013471. Springer, Heidelberg (2011)"},{"key":"9781_CR10","series-title":"LNCS","first-page":"214","volume-title":"38th International Conference on Current Trends in Theory and Practice of Computer Science","author":"P. Damaschke","year":"2012","unstructured":"Damaschke, P., Sheikh Muhammad, A.: Randomized group testing both query-optimal and minimal adaptive. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) 38th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012. LNCS, vol. 7147, pp. 214\u2013225. Springer, Heidelberg (2012)"},{"key":"9781_CR11","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/978-3-642-22685-4_50","volume-title":"Computing and Combinatorics","author":"A. Bonis De","year":"2011","unstructured":"De Bonis, A., Di Crescenco, G.: Combinatorial group testing for corruption localizing hashing. In: Fu, B., Du, D.Z. (eds.) Computing and Combinatorics, COCOON 2011. LNCS, vol. 6842, pp. 579\u2013591. Springer, Heidelberg (2011)"},{"key":"9781_CR12","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/S0097539703428002","volume":"34","author":"A. Bonis De","year":"2005","unstructured":"De Bonis, A., Gasieniec, L., Vaccaro, U.: Optimal two-stage algorithms for group testing problems. SIAM J. Comput. 34, 1253\u20131270 (2005)","journal-title":"SIAM J. Comput."},{"key":"9781_CR13","series-title":"Series on Appl. Math.","volume-title":"Combinatorial Group Testing and Its Applications","author":"D.Z. Du","year":"2000","unstructured":"Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. Series on Appl. Math., vol. 18. World Scientific, Singapore (2000)"},{"key":"9781_CR14","series-title":"Series on Appl. Math.","volume-title":"Pooling Designs and Nonadaptive Group Testing","author":"D.Z. Du","year":"2006","unstructured":"Du, D.Z., Hwang, F.K.: Pooling Designs and Nonadaptive Group Testing. Series on Appl. Math., vol. 18. World Scientific, Singapore (2006)"},{"key":"9781_CR15","first-page":"7","volume":"18","author":"A.G. Dyachkov","year":"1982","unstructured":"Dyachkov, A.G., Rykov, V.V.: Bounds on the length of disjunctive codes. Probl. Inf. Transm. 18, 7\u201313 (1982) (in Russian)","journal-title":"Probl. Inf. Transm."},{"key":"9781_CR16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Program. 1, 127\u2013136 (1971)","journal-title":"Math. Program."},{"key":"9781_CR17","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1137\/050631847","volume":"36","author":"D. Eppstein","year":"2007","unstructured":"Eppstein, D., Goodrich, M.T., Hirschberg, D.S.: Improved combinatorial group testing algorithms for real-world problem sizes. SIAM J. Comput. 36, 1360\u20131375 (2007)","journal-title":"SIAM J. Comput."},{"key":"9781_CR18","doi-asserted-by":"crossref","first-page":"300","DOI":"10.4156\/jdcta.vol5.issue2.35","volume":"5","author":"J. Fang","year":"2011","unstructured":"Fang, J., Jiang, Z.L., Yiu, S.M., Hui, L.C.K.: An efficient scheme for hard disk integrity check in digital forensics by hashing with combinatorial group testing. Int. J. Digit. Content Technol. Appl. 5, 300\u2013308 (2011)","journal-title":"Int. J. Digit. Content Technol. Appl."},{"key":"9781_CR19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0166-218X(98)00119-X","volume":"91","author":"P. Fischer","year":"1999","unstructured":"Fischer, P., Klasner, N., Wegener, I.: On the cut-off point for combinatorial group testing. Discrete Appl. Math. 91, 83\u201392 (1999)","journal-title":"Discrete Appl. Math."},{"key":"9781_CR20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/rsa.10078","volume":"23","author":"O. Goldreich","year":"2003","unstructured":"Goldreich, O., Trevisan, L.: Three theorems regarding testing graph properties. Random Struct. Algorithms 23, 23\u201357 (2003)","journal-title":"Random Struct. Algorithms"},{"key":"9781_CR21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10878-007-9087-z","volume":"15","author":"M.T. Goodrich","year":"2008","unstructured":"Goodrich, M.T., Hirschberg, D.S.: Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis. J. Comb. Optim. 15, 95\u2013121 (2008)","journal-title":"J. Comb. Optim."},{"key":"9781_CR22","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D.A. Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. IRE 40, 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"key":"9781_CR23","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/S0895480199359247","volume":"14","author":"S.H. Huang","year":"2001","unstructured":"Huang, S.H., Hwang, F.K.: When is individual testing optimal for nonadaptive group testing? SIAM J. Discrete Math. 14, 540\u2013548 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"9781_CR24","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1080\/01621459.1962.10480672","volume":"57","author":"C.H. Li","year":"1962","unstructured":"Li, C.H.: A sequential method for screening experimental variables. J. Am. Stat. Assoc. 57, 455\u2013477 (1962)","journal-title":"J. Am. Stat. Assoc."},{"key":"9781_CR25","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(66)80035-2","volume":"1","author":"D. Lubell","year":"1966","unstructured":"Lubell, D.: A short proof of Sperner\u2019s lemma. J. Comb. Theory 1, 299 (1966)","journal-title":"J. Comb. Theory"},{"key":"9781_CR26","doi-asserted-by":"crossref","first-page":"1736","DOI":"10.1109\/TIT.2010.2103752","volume":"57","author":"M. M\u00e9zard","year":"2011","unstructured":"M\u00e9zard, M., Toninelli, C.: Group testing with random pools: optimal two-stage algorithms. IEEE Trans. Inf. Theory 57, 1736\u20131745 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9781_CR27","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0097-3165(94)90067-1","volume":"66","author":"M. Ruszink\u00f3","year":"1994","unstructured":"Ruszink\u00f3, M.: On the upper bound of the size of the r-cover-free families. J. Comb. Theory, Ser. A 66, 302\u2013310 (1994)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"9781_CR28","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E. Sperner","year":"1928","unstructured":"Sperner, E.: Ein Satz \u00fcber Untermengen einer endlichen Menge. Math. Z. 27, 544\u2013548 (1928) (in German)","journal-title":"Math. Z."},{"key":"9781_CR29","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1017\/S0963548304006649","volume":"14","author":"J. Schlaghoff","year":"2005","unstructured":"Schlaghoff, J., Triesch, E.: Improved results for competitive group testing. Comb. Probab. Comput. 14, 191\u2013202 (2005)","journal-title":"Comb. Probab. Comput."},{"key":"9781_CR30","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"Welsh, D.J.A.: Matroid Theory. Academic Press, San Diego (1976)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9781-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9781-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9781-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:12Z","timestamp":1559137512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9781-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,20]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["9781"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9781-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,20]]}}}