{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:04:10Z","timestamp":1747541050348,"version":"3.40.5"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031929311","type":"print"},{"value":"9783031929328","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-92932-8_14","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:21Z","timestamp":1747468041000},"page":"205-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Bounds for\u00a0Group Testing in\u00a0Arbitrary Hypergraphs"],"prefix":"10.1007","author":[{"given":"Annalisa","family":"De Bonis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"issue":"4","key":"14_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. Discrete Math. 18(4), 697\u2013712 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Arasli, B. and Ulukus, S.: Graph and cluster formation based group testing. In: 2021 IEEE ISIT, pp. 1236\u20131241 (2021)","DOI":"10.1109\/ISIT45174.2021.9518128"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/j.dam.2006.10.009","volume":"155","author":"HB Chen","year":"2007","unstructured":"Chen, H.B., Hwang, F.K.: Exploring the missing link among $$d$$-separable, $${\\overline{d}}$$-separable, and $$d$$-disjunct matrices. Discrete Appl. Math. 155, 662\u2013664 (2007)","journal-title":"Discrete Appl. Math."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Crescenzi, P., Monti, A., Penna, P., Silvestri, R.: On Computing Ad-hoc selective families. In: RANDOM-APPROX 2001, pp. 211\u2013222 (2001)","DOI":"10.1007\/3-540-44666-4_24"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"14_CR6","unstructured":"Coja-Oghlan, A., et al.: Optimal group testing. In: Thirty Third Conference on Learning Theory, pp. 1374\u20131388 (2020)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"De Bonis, A.: Conflict resolution in arbitrary hypergraphs. In: 19th International Symposium, ALGOWIN 2023, Lecture Notes in Computer Science, vol. 14061, pp. 13\u201336. Springer (2023)","DOI":"10.1007\/978-3-031-48882-5_2"},{"issue":"4","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1007\/s10878-015-9949-8","volume":"32","author":"A De Bonis","year":"2016","unstructured":"De Bonis, A.: Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing. J. Comb. Optim. 32(4), 1254\u20131287 (2016)","journal-title":"J. Comb. Optim."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"De Bonis, A.: Group testing in arbitrary hypergraphs and related combinatorial structures. In: Fernau, H., Gaspers, S., Klasing, R. (eds.) SOFSEM 2024: Theory and Practice of Computer Science. SOFSEM 2024. Lecture Notes in Computer Science, vol. 14519, pp 154\u2013168. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-52113-3_11"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"De Bonis, A, Ga\u0327sieniec, L, Vaccaro, U.: Optimal two-stage algorithms for group testing problems. SIAM J. Comput. 34(5), 1253\u20131270 (2005)","DOI":"10.1137\/S0097539703428002"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1214\/aoms\/1177731363","volume":"14","author":"R Dorfman","year":"1943","unstructured":"Dorfman, R.: The detection of defective members of large populations. Ann. Math. Statist. 14, 436\u2013440 (1943)","journal-title":"Ann. Math. Statist."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Du, D.Z., Hwang, F. K.: Pooling design and nonadaptive group testing. Ser. Appl. Math. 18 (2006)","DOI":"10.1142\/6122"},{"key":"14_CR13","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: A survey of superimposed code theory. Probl. Control Inform. Theory, 12, 229\u2013242 (1983)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s, P., Frankl, P., F\u00fcredi, Z.: Families of finite sets in which no set is covered by the union of $$r$$ others. Israel J. Math. 51, 79\u201389 (1985)","journal-title":"Israel J. Math."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Gargano, L., Rescigno, A.A., Vaccaro, U.: On k-strong conflict\u2013free multicoloring. In: Gao, X., Du, H., Han, M. (eds.) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science, vol. 10628, pp. 276\u2013290. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-71147-8_19"},{"key":"14_CR16","unstructured":"Gonen, M., Langberg, M., Sprintson A.: Group Testing on General Set-Systems. Manuscript, Available at https:\/\/arxiv.org\/abs\/2202.04988"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Gonen, M., Langberg, M., Sprintson A.: Group testing on general set-systems. In: 2022 IEEE International Symposium on Information, pp. 874\u2013879 (2022)","DOI":"10.1109\/ISIT50566.2022.9834789"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Harvey, N.J.A., Patrascu, M., Wen, Y., Yekhanin, S., Chan, V.W.S.: Non-adaptive fault diagnosis for all-optical networks via combinatorial group testing on graphs. In: 26th IEEE International Conference on on Computer Communications, pp. 697\u2013705 (2007)","DOI":"10.1109\/INFCOM.2007.87"},{"issue":"8","key":"14_CR19","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1109\/TIP.2002.801124","volume":"11","author":"ES Hong","year":"2002","unstructured":"Hong, E.S., Ladner, R.E.: Group testing for image compression. IEEE Trans. Image Process. 11(8), 901\u2013911 (2002)","journal-title":"IEEE Trans. Image Process."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Goenka R., Cao S.J., Wong C.W., Rajwade A., Baron D.: Contact tracing enhances the efficiency of covid-19 group testing. In: ICASSP 2021, pp. 8168\u20138172 (2021)","DOI":"10.1109\/ICASSP39728.2021.9414034"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"WH Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory 10, 363\u2013377 (1964)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Lo, C., Liu, M., Lynch, J.P., Gilbert, A.C.: Efficient sensor fault detection using combinatorial group testing. In: 2013 IEEE International Conference on Distributed Computing in Sensor Systems, pp. 199\u2013206 (2013)","DOI":"10.1109\/DCOSS.2013.57"},{"key":"14_CR23","unstructured":"Nikolopoulos, P., Srinivasavaradhan, S.R., Guo, T., Fragouli, C., Diggavi S.: Group testing for connected communities. In: The 24th International Conference on Artificial Intelligence and Statistics, vol. 130, pp. 2341\u20132349. PMLR (2021)"},{"key":"14_CR24","doi-asserted-by":"publisher","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. Combin. Theory Ser. A 66, 302\u2013310 (1994)","journal-title":"J. Combin. Theory Ser. A"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1002\/j.1538-7305.1959.tb03914.x","volume":"38","author":"M Sobel","year":"1959","unstructured":"Sobel, M., Groll, P.A.: Group testing to eliminate efficiently all defectives in a binomial sample. Bell Syst. Tech. J. 38, 1179\u20131252 (1959)","journal-title":"Bell Syst. Tech. J."},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Vorobyev, I.: Note on generalized group testing (2022). https:\/\/doi.org\/10.48550\/arXiv.2211.04264","DOI":"10.48550\/arXiv.2211.04264"},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TIT.1985.1057026","volume":"31","author":"J Wolf","year":"1985","unstructured":"Wolf, J.: Born again group testing: multiaccess communications. IEEE Trans. Inf. Theory 31, 185\u2013191 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Zhu, J., Rivera, K., and Baron, D.: Noisy pooled PCR for virus testing (2020). https:\/\/doi.org\/10.48550\/arXiv.2004.02689","DOI":"10.48550\/arXiv.2004.02689"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92932-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:29Z","timestamp":1747468049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92932-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929311","9783031929328"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92932-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}