{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:27:22Z","timestamp":1742959642789,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031231001"},{"type":"electronic","value":"9783031231018"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-23101-8_2","type":"book-chapter","created":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T20:18:53Z","timestamp":1671481133000},"page":"18-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Spectral Algorithm for\u00a0Finding Maximum Cliques in\u00a0Dense Random Intersection Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3176-3759","authenticated-orcid":false,"given":"Filippos","family":"Christodoulou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3765-5636","authenticated-orcid":false,"given":"Sotiris","family":"Nikoletseas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9837-2632","authenticated-orcid":false,"given":"Christoforos","family":"Raptopoulos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5396-3749","authenticated-orcid":false,"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W","volume":"13","author":"N Alon","year":"1998","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Finding a large hidden clique in a random graph. Random Struct. Algor. 13, 457\u2013466 (1998)","journal-title":"Random Struct. Algor."},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2005.12.005","volume":"355","author":"M Behrisch","year":"2006","unstructured":"Behrisch, M., Taraz, A.: Efficiently covering complex networks with cliques of similar vertices. Theor. Comput. Sci. 355(1), 37\u201347 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","series-title":"Studies in Classification, Data Analysis, and Knowledge Organization","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-662-44983-7_7","volume-title":"Data Science, Learning by Latent Structures, and Knowledge Discovery","author":"M Bloznelis","year":"2015","unstructured":"Bloznelis, M., Godehardt, E., Jaworski, J., Kurauskas, V., Rybarczyk, K.: Recent progress in complex network analysis: properties of random intersection graphs. In: Lausen, B., Krolak-Schwerdt, S., B\u00f6hmer, M. (eds.) Data Science, Learning by Latent Structures, and Knowledge Discovery. SCDAKO, pp. 79\u201388. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-44983-7_7"},{"key":"2_CR4","series-title":"Studies in Classification, Data Analysis, and Knowledge Organization","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-662-44983-7_6","volume-title":"Data Science, Learning by Latent Structures, and Knowledge Discovery","author":"M Bloznelis","year":"2015","unstructured":"Bloznelis, M., Godehardt, E., Jaworski, J., Kurauskas, V., Rybarczyk, K.: Recent progress in complex network analysis: models of random intersection graphs. In: Lausen, B., Krolak-Schwerdt, S., B\u00f6hmer, M. (eds.) Data Science, Learning by Latent Structures, and Knowledge Discovery. SCDAKO, pp. 69\u201378. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-44983-7_6"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bloznelis, M., Kurauskas, V.: Large cliques in sparse random intersection graphs. Electr. J. Comb. 24(2), P2.5 (2017)","DOI":"10.37236\/6233"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Christodoulou, F., Nikoletseas, S., Raptopoulos, C., Spirakis, P.: A spectral algorithm for finding maximum cliques in dense random intersection graphs (2022). https:\/\/doi.org\/10.48550\/ARXIV.2210.02121, https:\/\/arxiv.org\/abs\/2210.02121","DOI":"10.48550\/ARXIV.2210.02121"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<156::AID-RSA3>3.0.CO;2-H","volume":"16","author":"JA Fill","year":"2000","unstructured":"Fill, J.A., Sheinerman, E.R., Singer-Cohen, K.B.: Random intersection graphs when $$m = \\omega (n)$$: an equivalence theorem relating the evolution of the $$g(n, m, p)$$ and $$g(n, p)$$ models. Random Struct. Algor. 16(2), 156\u2013176 (2000)","journal-title":"Random Struct. Algor."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.jda.2015.05.014","volume":"34","author":"T Friedrich","year":"2015","unstructured":"Friedrich, T., Hercher, C.: On the kernel size of clique cover reductions for random intersection graphs. J. Discrete Algorithms 34, 128\u2013136 (2015)","journal-title":"J. Discrete Algorithms"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1017\/S0305004100051124","volume":"77","author":"GR Grimmett","year":"1975","unstructured":"Grimmett, G.R., McDiarmid, C.: On coloring random graphs. Math. Proc. Cambridge Philos. Soc. 77, 313\u2013324 (1975)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within $$n^{1-\\varepsilon }$$. Acta Math. 182, 105\u2013142 (1999)","journal-title":"Acta Math."},{"issue":"8","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1016\/j.jcss.2006.04.007","volume":"72","author":"C Jianer","year":"2006","unstructured":"Jianer, C., Xiuzhen, H., Iyad, A.K., Ge, X.: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8), 1346\u20131367 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1017\/S0963548398003459","volume":"8","author":"M Karo\u0144ski","year":"1999","unstructured":"Karo\u0144ski, M., Scheinerman, E.R., Singer-Cohen, K.B.: On random intersection graphs: the subgraph problem. Comb. Probab. Comput. 8, 131\u2013159 (1999)","journal-title":"Comb. Probab. Comput."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of computer computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"2_CR14","unstructured":"Karp, R.M.: Probabilistic analysis of some combinatorial search problems. In: Algorithms and Complexity: New Directions and Recent Results, pp. 85\u2013103. Academic Press (1976)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Nikoletseas, S.E., Raptopoulos, C.L., Spirakis, P.G.: Communication and security in random intersection graphs models. In: 12th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WOWMOM), pp. 1\u20136 (2011)","DOI":"10.1109\/WoWMoM.2011.5986170"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Nikoletseas, S.E., Raptopoulos, C.L., Spirakis, P.G.: Maximum cliques in graphs with small intersection number and random intersection graphs. In: Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 728\u2013739 (2012)","DOI":"10.1007\/978-3-642-32589-2_63"},{"key":"2_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100353","volume":"39","author":"SE Nikoletseas","year":"2021","unstructured":"Nikoletseas, S.E., Raptopoulos, C.L., Spirakis, P.G.: Maximum cliques in graphs with small intersection number and random intersection graphs. Comput. Sci. Rev. 39, 100353 (2021)","journal-title":"Comput. Sci. Rev."},{"issue":"1\u20132","key":"2_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/rsa.20356","volume":"38","author":"K Rybarczyk","year":"2011","unstructured":"Rybarczyk, K.: Equivalence of a random intersection graph and $$g(n, p)$$. Random Struct. Algor. 38(1\u20132), 205\u2013234 (2011)","journal-title":"Random Struct. Algor."},{"key":"2_CR19","unstructured":"Singer-Cohen, K.B.: Random intersection graphs. Ph.D. thesis, John Hopkins University (1995)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2023: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23101-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T00:05:00Z","timestamp":1673049900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23101-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031231001","9783031231018"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23101-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2023","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":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ics.science.upjs.sk\/sofsem2023\/","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":"43","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":"26","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":"60% - 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":"6-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)"}}]}}