{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:00Z","timestamp":1759638540022},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_9","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:05:18Z","timestamp":1252937118000},"page":"84-95","source":"Crossref","is-referenced-by-count":8,"title":["Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity"],"prefix":"10.1007","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azam","family":"Sheikh Muhammad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S0895480103431071","volume":"18","author":"N. Alon","year":"2005","unstructured":"Alon, N., Asodi, V.: Learning a Hidden Subgraph. SIAM J. Discr. Math.\u00a018, 697\u2013712 (2005)","journal-title":"SIAM J. Discr. Math."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.jcss.2007.06.006","volume":"74","author":"D. Angluin","year":"2008","unstructured":"Angluin, D., Chen, J.: Learning a Hidden Graph Using O(logn) Queries per Edge. J. Computer and System Sci.\u00a074, 546\u2013556 (2008)","journal-title":"J. Computer and System Sci."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(92)00185-O","volume":"52","author":"A. Bar-Noy","year":"1994","unstructured":"Bar-Noy, A., Hwang, F.K., Kessler, H., Kutten, S.: A New Competitive Algorithm for Group Testing. Discr. Appl. Math.\u00a052, 29\u201338 (1994)","journal-title":"Discr. Appl. Math."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11604686_2","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Bouvel","year":"2005","unstructured":"Bouvel, M., Grebinski, V., Kucherov, G.: Combinatorial Search on Graphs Motivated by Bioinformatics Applications. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 16\u201327. Springer, Heidelberg (2005)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s11590-007-0070-5","volume":"2","author":"H.B. Chen","year":"2008","unstructured":"Chen, H.B., Fu, H.L., Hwang, F.K.: An Upper Bound on the Number of Tests in Pooling Designs for the Error-Tolerant Complex Model. Optim. Letters\u00a02, 425\u2013431 (2008)","journal-title":"Optim. Letters"},{"key":"9_CR6","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Simplicity is Beauty: Improved Upper Bounds for Vertex Cover. Technical report (2008)"},{"key":"9_CR7","doi-asserted-by":"publisher","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. Comp. Biol.\u00a015, 195\u2013205 (2008)","journal-title":"J. Comp. Biol."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/S0022-0000(03)00047-3","volume":"67","author":"P. Damaschke","year":"2003","unstructured":"Damaschke, P.: On Parallel Attribute-Efficient Learning. J. Computer and System Sci.\u00a067, 46\u201362 (2003)","journal-title":"J. Computer and System Sci."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2005.10.004","volume":"351","author":"P. Damaschke","year":"2006","unstructured":"Damaschke, P.: Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. Theor. Computer Sci.\u00a0351, 337\u2013350 (2006)","journal-title":"Theor. Computer Sci."},{"key":"9_CR10","doi-asserted-by":"publisher","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. Comp.\u00a034, 1253\u20131270 (2005)","journal-title":"SIAM J. Comp."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1137\/S0097539793246690","volume":"23","author":"D.Z. Du","year":"1994","unstructured":"Du, D.Z., Park, H.: On Competitive Group Testing. SIAM J. Comp.\u00a023, 1019\u20131025 (1994)","journal-title":"SIAM J. Comp."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1137\/S0097539792227612","volume":"23","author":"D.Z. Du","year":"1994","unstructured":"Du, D.Z., Xue, G., Sun, S.Z., Cheng, S.W.: Modifications of Competitive Group Testing. SIAM J. Comp.\u00a023, 82\u201396 (1994)","journal-title":"SIAM J. Comp."},{"key":"9_CR13","doi-asserted-by":"publisher","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. Comp.\u00a036, 1360\u20131375 (2007)","journal-title":"SIAM J. Comp."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TCAD.2005.854635","volume":"25","author":"A.B. Kahng","year":"2006","unstructured":"Kahng, A.B., Reda, S.: New and Improved BIST Diagnosis Methods from Combinatorial Group Testing Theory. IEEE Trans. CAD of Integr. Circuits and Systems\u00a025, 533\u2013543 (2006)","journal-title":"IEEE Trans. CAD of Integr. Circuits and Systems"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1038\/nbt921","volume":"22","author":"M. Lappe","year":"2003","unstructured":"Lappe, M., Holm, L.: Unraveling Protein Interaction Networks with Near-Optimal Efficiency. Nature Biotech.\u00a022, 98\u2013103 (2003)","journal-title":"Nature Biotech."},{"key":"9_CR16","doi-asserted-by":"publisher","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., Prob. and Comp.\u00a014, 191\u2013202 (2005)","journal-title":"Comb., Prob. and Comp."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T19:05:00Z","timestamp":1552158300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}