{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T18:05:39Z","timestamp":1770833139073,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030340285","type":"print"},{"value":"9783030340292","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34029-2_33","type":"book-chapter","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T22:02:40Z","timestamp":1573682560000},"page":"513-526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithmic Aspects on the Construction of Separating Codes"],"prefix":"10.1007","author":[{"given":"Marcel","family":"Fernandez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6409-4286","authenticated-orcid":false,"given":"John","family":"Livieratos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"issue":"3","key":"33_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/2818352","volume":"63","author":"D Achlioptas","year":"2016","unstructured":"Achlioptas, D., Iliopoulos, F.: Random walks that find perfect objects and the Lov\u00e1sz local lemma. J. ACM (JACM) 63(3), 22 (2016)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"33_CR2","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1109\/TIT.2003.809570","volume":"49","author":"A Barg","year":"2003","unstructured":"Barg, A., Blakley, G.R., Kabatiansky, G.A.: Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49(4), 852\u2013865 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20133","key":"33_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/B:DESI.0000029217.97956.26","volume":"32","author":"D Deng","year":"2004","unstructured":"Deng, D., Stinson, D.R., Wei, R.: The Lov\u00e1sz local lemma and its applications to some combinatorial arrays. Des. Codes Crypt. 32(1\u20133), 121\u2013134 (2004)","journal-title":"Des. Codes Crypt."},{"key":"33_CR4","first-page":"609","volume":"10","author":"P Erd\u0151s","year":"1975","unstructured":"Erd\u0151s, P., Lov\u00e1sz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. Infin. Finite Sets 10, 609\u2013627 (1975)","journal-title":"Infin. Finite Sets"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-03456-5_3","volume-title":"Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday","author":"H Gebauer","year":"2009","unstructured":"Gebauer, H., Moser, R.A., Scheder, D., Welzl, E.: The Lov\u00e1sz local lemma and satisfiability. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 30\u201354. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03456-5_3"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Gebauer, H., Szab\u00f3, T., Tardos, G.: The local lemma is tight for SAT. In: Proceedings 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 664\u2013674. SIAM (2011)","DOI":"10.1137\/1.9781611973082.52"},{"key":"33_CR7","unstructured":"Giotis, I., Kirousis, L., Psaromiligkos, K.I., Thilikos, D.M.: On the algorithmic Lov\u00e1sz local lemma and acyclic edge coloring. In: Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics. Society for Industrial and Applied Mathematics (2015). \nhttp:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611973761.2"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2016.12.011","volume":"665","author":"I Giotis","year":"2017","unstructured":"Giotis, I., Kirousis, L., Psaromiligkos, K.I., Thilikos, D.M.: Acyclic edge coloring through the Lov\u00e1sz local lemma. Theoret. Comput. Sci. 665, 40\u201350 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR9","unstructured":"Giotis, I., Kirousis, L., Livieratos, J., Psaromiligkos, K.I., Thilikos, D.M.: Alternative proofs of the asymmetric Lov\u00e1sz local lemma and Shearer\u2019s lemma. In: Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, GASCom (2018). \nhttp:\/\/ceur-ws.org\/Vol-2113\/paper15.pdf"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Harvey, N.J., Vondr\u00e1k, J.: An algorithmic proof of the Lov\u00e1sz local lemma via resampling oracles. In: Proceedings 56th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1327\u20131346. IEEE (2015)","DOI":"10.1109\/FOCS.2015.85"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-030-05348-2_5","volume-title":"Learning and Intelligent Optimization","author":"L Kirousis","year":"2019","unstructured":"Kirousis, L., Livieratos, J.: A simple algorithmic proof of the symmetric lopsided Lov\u00e1sz local lemma. In: Battiti, R., Brunato, M., Kotsireas, I., Pardalos, P.M. (eds.) LION 12 2018. LNCS, vol. 11353, pp. 49\u201363. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-05348-2_5"},{"issue":"3","key":"33_CR12","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/0401035","volume":"1","author":"J K\u00f6rner","year":"1988","unstructured":"K\u00f6rner, J., Simonyi, G.: Separating partition systems and locally different sequences. SIAM J. Discrete Math. 1(3), 355\u2013359 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"33_CR13","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, vol. 16. Elsevier, Amsterdam (1977)"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Moser, R.A.: A constructive proof of the Lov\u00e1sz local lemma. In: Proceedings 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 343\u2013350. ACM (2009)","DOI":"10.1145\/1536414.1536462"},{"issue":"2","key":"33_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1667053.1667060","volume":"57","author":"RA Moser","year":"2010","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general Lov\u00e1sz local lemma. J. ACM (JACM) 57(2), 11 (2010)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"33_CR16","first-page":"105","volume":"30","author":"YL Sagalovich","year":"1994","unstructured":"Sagalovich, Y.L.: Separating systems. Problems Inform. Transmission 30(2), 105\u2013123 (1994)","journal-title":"Problems Inform. Transmission"},{"issue":"2","key":"33_CR17","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1137\/16M1067767","volume":"31","author":"K Sarkar","year":"2017","unstructured":"Sarkar, K., Colbourn, C.J.: Upper bounds on the size of covering arrays. SIAM J. Discrete Math. 31(2), 1277\u20131293 (2017)","journal-title":"SIAM J. Discrete Math."},{"key":"33_CR18","volume-title":"An Introduction to the Analysis of Algorithms","author":"R Sedgewick","year":"2013","unstructured":"Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms. Addison-Wesley, Boston (2013)"},{"issue":"3","key":"33_CR19","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"JN Staddon","year":"2001","unstructured":"Staddon, J.N., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47(3), 1042\u20131049 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38536-0_1","volume-title":"Computer Science \u2013 Theory and Applications","author":"M Szegedy","year":"2013","unstructured":"Szegedy, M.: The Lov\u00e1sz local lemma \u2013 a survey. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 1\u201311. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38536-0_1"},{"key":"33_CR21","unstructured":"Tao, T.: Moser\u2019s entropy compression argument (2009). \nhttps:\/\/terrytao.wordpress.com\/2009\/08\/05\/mosers-entropy-compression-argument\/"}],"container-title":["Lecture Notes in Computer Science","Analysis of Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34029-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T22:12:03Z","timestamp":1573683123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34029-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030340285","9783030340292"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34029-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Experimental Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalamata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wea2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/SEA2019\/","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":"45","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":"35","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":"78% - 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":"2","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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}