{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T14:19:37Z","timestamp":1774361977417,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_36","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:05Z","timestamp":1770977225000},"page":"545-559","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Engineering Algorithms for\u00a0$$\\ell $$-Isolated Maximal Clique Enumeration"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6266-3324","authenticated-orcid":false,"given":"Marco","family":"D\u2019Elia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6394-6798","authenticated-orcid":false,"given":"Irene","family":"Finocchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9806-7411","authenticated-orcid":false,"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"8","key":"36_CR1","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1080\/00207160.2016.1226498","volume":"94","author":"Z Alamgir","year":"2017","unstructured":"Alamgir, Z., Karim, S., Husnine, S.: Linear-time algorithm for generating c-isolated bicliques. Int. J. Comput. Math. 94(8), 1574\u20131590 (2017)","journal-title":"Int. J. Comput. Math."},{"issue":"9","key":"36_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (1973)","journal-title":"Commun. ACM"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2021.11.005","volume":"899","author":"A Conte","year":"2022","unstructured":"Conte, A., Tomita, E.: On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms. Theor. Comput. Sci. 899, 1\u201324 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"D\u2019Elia, M., Finocchi, I., Patrignani, M.: Engineering algorithms for $$\\ell $$-isolated maximal clique enumeration. arXiv preprint arXiv:2511.03525 (2025)","DOI":"10.1007\/978-981-95-7127-7_36"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer Science and Business Media (2012)","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"36_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2025.100784","volume":"58","author":"M D\u2019Elia","year":"2025","unstructured":"D\u2019Elia, M., Finocchi, I., Patrignani, M.: Maximal cliques summarization: principles, problem classification, and algorithmic approaches. Comput. Sci. Rev. 58, 100784 (2025)","journal-title":"Comput. Sci. Rev."},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. ACM J. Exp. Algorithmics 18 (2013)","DOI":"10.1145\/2543629"},{"key":"36_CR8","unstructured":"Gall, F.L., Nadler, O., Nishimura, H., Oshman, R.: Quantum simultaneous protocols without public coins using modified equality queries. In: 28th International Conference on Principles of Distributed Systems. LIPIcs, vol.\u00a0324, pp. 34:1\u201334:20 (2024)"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-64243-3_11","volume-title":"Green, Pervasive, and Cloud Computing","author":"J Gao","year":"2020","unstructured":"Gao, J., Hao, F., Yang, E., Yang, Y., Min, G.: Concept stability based isolated maximal cliques detection in dynamic social networks. In: Yu, Z., Becker, C., Xing, G. (eds.) GPC 2020. LNCS, vol. 12398, pp. 131\u2013144. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64243-3_11"},{"issue":"1","key":"36_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J Hastad","year":"1999","unstructured":"Hastad, J.: Clique is hard to approximate within $$n^{1-\\varepsilon }$$. Acta Math. 182(1), 105\u2013142 (1999)","journal-title":"Acta Math."},{"issue":"52","key":"36_CR11","doi-asserted-by":"publisher","first-page":"5384","DOI":"10.1016\/j.tcs.2009.05.008","volume":"410","author":"F H\u00fcffner","year":"2009","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Isolation concepts for clique enumeration: comparison and computational experiments. Theor. Comput. Sci. 410(52), 5384\u20135397 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Ito, H., Iwama, K.: Enumeration of isolated cliques and pseudo-cliques. ACM Trans. Algorithms 5(4), 40:1\u201340:21 (2009)","DOI":"10.1145\/1597036.1597044"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Proc. Symp. Compl. Comp. Computat., pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"38\u201340","key":"36_CR14","doi-asserted-by":"publisher","first-page":"3640","DOI":"10.1016\/j.tcs.2009.04.021","volume":"410","author":"C Komusiewicz","year":"2009","unstructured":"Komusiewicz, C., H\u00fcffner, F., Moser, H., Niedermeier, R.: Isolation concepts for efficiently enumerating dense subgraphs. Theor. Comput. Sci. 410(38\u201340), 3640\u20133654 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT: the Koblenz network collection. In: World Wide Web Conference, WWW, pp. 1343\u20131350 (2013)","DOI":"10.1145\/2487788.2488173"},{"issue":"S1","key":"36_CR16","doi-asserted-by":"publisher","first-page":"S83","DOI":"10.1017\/nws.2020.38","volume":"9","author":"H Molter","year":"2021","unstructured":"Molter, H., Niedermeier, R., Renken, M.: Isolation concepts applied to temporal clique enumeration. Netw. Sci. 9(S1), S83\u2013S105 (2021)","journal-title":"Netw. Sci."},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J Moon","year":"1965","unstructured":"Moon, J., Moser, L.: On cliques in graphs. Israel J. Math. 3, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-319-41920-6_45","volume-title":"Green, Pervasive, and Cloud Computing","author":"Y Okubo","year":"2016","unstructured":"Okubo, Y., Haraguchi, M., Tomita, E.: Enumerating maximal isolated cliques based on vertex-dependent connection lower bound. In: GPC 2020. LNCS (LNAI), vol. 12398, pp. 569\u2013583. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41920-6_45"},{"issue":"5","key":"36_CR19","doi-asserted-by":"publisher","first-page":"661","DOI":"10.7155\/jgaa.00243","volume":"15","author":"T Shigezumi","year":"2011","unstructured":"Shigezumi, T., Uno, Y., Watanabe, O.: A new model for a scale-free hierarchical structure of isolated cliques. J. Graph Algorithms Appl. 15(5), 661\u2013682 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"36_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Uno, Y., Oguri, F.: Contracted webgraphs - scale-freeness and structure mining -. IEICE Trans. Commun. 96-B(11), 2766\u20132773 (2013)","DOI":"10.1587\/transcom.E96.B.2766"},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Uno, Y., Ota, Y., Uemichi, A.: Web structure mining by isolated stars. In: Algorithms and Models for the Web-Graph. LNCS, vol.\u00a04936, pp. 149\u2013156 (2006)","DOI":"10.1007\/978-3-540-78808-9_14"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Uno, Y., Ota, Y., Uemichi, A.: Web structure mining by isolated cliques. IEICE Trans. Inf. Syst. 90-D(12), 1998\u20132006 (2007)","DOI":"10.1093\/ietisy\/e90-d.12.1998"},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"Wang, J., Cheng, J., Fu, A.W.: Redundancy-aware maximal cliques. In: Knowledge Discovery and Data Mining, KDD, pp. 122\u2013130 (2013)","DOI":"10.1145\/2487575.2487689"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:10:01Z","timestamp":1774325401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}