{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T23:16:46Z","timestamp":1781479006100,"version":"3.54.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031521126","type":"print"},{"value":"9783031521133","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_11","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"154-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Group Testing in\u00a0Arbitrary Hypergraphs and\u00a0Related Combinatorial Structures"],"prefix":"10.1007","author":[{"given":"Annalisa","family":"De Bonis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"11_CR1","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":"11_CR2","unstructured":"De Bonis, A.: Group testing in arbitrary hypergraphs and related combinatorial structures (2023). https:\/\/arxiv.org\/abs\/2307.09608"},{"issue":"5","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539703428002","volume":"34","author":"A De Bonis","year":"2005","unstructured":"De Bonis, A., Gasieniec, L., Vaccaro, U.: Optimal two-stage algorithms for group testing problems. SIAM J. Comput. 34(5), 1253\u20131270 (2005)","journal-title":"SIAM J. Comput."},{"key":"11_CR4","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":"11_CR5","doi-asserted-by":"crossref","unstructured":"Du, D.Z., Hwang, F.K.: Pooling Design and Nonadaptive Group Testing. Series on Applied Mathematics, vol. 18. World Scientific (2006)","DOI":"10.1142\/6122"},{"key":"11_CR6","first-page":"229","volume":"12","author":"AG D\u2019yachkov","year":"1983","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: A survey of superimposed code theory. Probl. Control Inform. Theory 12, 229\u2013242 (1983)","journal-title":"Probl. Control Inform. Theory"},{"key":"11_CR7","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":"11_CR8","first-page":"874","volume":"2022","author":"M Gonen","year":"2022","unstructured":"Gonen, M., Langberg, M., Sprintson, A.: Group testing on general set-systems. IEEE Trans. Inf. Theory 2022, 874\u2013879 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR9","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 Computer Communications, pp. 697\u2013705 (2007)","DOI":"10.1109\/INFCOM.2007.87"},{"issue":"8","key":"11_CR10","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":"11_CR11","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":"11_CR12","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":"11_CR13","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":"11_CR14","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e0sz","year":"1975","unstructured":"Lov\u00e0sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13, 383\u2013390 (1975)","journal-title":"Discrete Math."},{"key":"11_CR15","doi-asserted-by":"crossref","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)","DOI":"10.1109\/ICC42927.2021.9500791"},{"key":"11_CR16","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":"11_CR17","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":"11_CR18","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":"11_CR19","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":"11_CR20","doi-asserted-by":"publisher","unstructured":"Zhu, J., Rivera, K., 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","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:03:42Z","timestamp":1711569822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}