{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:33:12Z","timestamp":1743046392482,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250041"},{"type":"electronic","value":"9783030250058"}],"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-25005-8_31","type":"book-chapter","created":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T23:02:23Z","timestamp":1563145343000},"page":"378-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Clique Exhaustive Search in Circulant k-Hypergraphs"],"prefix":"10.1007","author":[{"given":"Lachlan","family":"Plant","sequence":"first","affiliation":[]},{"given":"Lucia","family":"Moura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF01955041","volume":"15","author":"E Balas","year":"1996","unstructured":"Balas, E., Xue, J.: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Algorithmica 15, 397\u2013412 (1996)","journal-title":"Algorithmica"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan, R., Pardalos, P.: An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9, 375\u2013382 (1990)","journal-title":"Oper. Res. Lett."},{"unstructured":"Colbourn, C.: Covering array tables for t = 2, 3, 4, 5, 6. http:\/\/www.public.asu.edu\/~ccolbou\/src\/tabby\/catable.html","key":"31_CR3"},{"key":"31_CR4","first-page":"121","volume":"58","author":"C Colbourn","year":"2004","unstructured":"Colbourn, C.: Combinatorial aspects of covering arrays. Le Mat. (Catania) 58, 121\u2013167 (2004)","journal-title":"Le Mat. (Catania)"},{"unstructured":"Niskanen, S., \u00d6sterg\u00e5rd, P.: Cliquer\u2019s user guide. Technical report T48, Helsinki University of Technology (2003). https:\/\/users.aalto.fi\/~pat\/cliquer\/cliquer_fm.pdf","key":"31_CR5"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120, 197\u2013207 (2002)","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"\u00d6sterg\u00e5rd, P.: Constructing combinatorial objects via cliques. In: Webb, B. (ed.) Surveys in Combinatorics, pp. 56\u201382 (2005)","key":"31_CR7","DOI":"10.1017\/CBO9780511734885.004"},{"doi-asserted-by":"crossref","unstructured":"Plant, L.: Maximum clique search in circulant $$k$$-hypergraphs. Master\u2019s thesis, University of Ottawa (2018)","key":"31_CR8","DOI":"10.1007\/978-3-030-25005-8_31"},{"unstructured":"Ruskey, F.: Combinatorial Generation (pre-publication), 289 p., 1 October 2003","key":"31_CR9"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/0196-6774(92)90047-G","volume":"13","author":"F Ruskey","year":"1992","unstructured":"Ruskey, F., Savage, C., Wang, T.: Generating necklaces. J. Algorithms 13, 414\u2013430 (1992)","journal-title":"J. Algorithms"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1016\/j.disc.2015.10.040","volume":"339","author":"G Tzanakis","year":"2016","unstructured":"Tzanakis, G., Moura, L., Panario, D., Stevens, B.: Constructing new covering arrays from LFSR sequences over finite fields. Discrete Math. 339, 1158\u20131171 (2016)","journal-title":"Discrete Math."},{"unstructured":"Verfaillie, G., Lemaitre, M., Schiex, T.: Russian doll search for solving constraint optimization problems. In: Proceedings of the Association for the Advancement of Artificial Intelligence, pp. 181\u2013187 (1996)","key":"31_CR12"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0167-6377(97)00054-0","volume":"21","author":"D Wood","year":"1997","unstructured":"Wood, D.: An algorithm for finding a maximum clique in a graph. Oper. Res. Lett. 21, 211\u2013217 (1997)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25005-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:15:49Z","timestamp":1710350149000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25005-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250041","9783030250058"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25005-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2019.di.unipi.it\/","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":"73","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":"36","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":"49% - 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","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":"5-6","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)"}}]}}