{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:38:25Z","timestamp":1767706705382,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030864743"},{"type":"electronic","value":"9783030864750"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86475-0_33","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T07:03:29Z","timestamp":1630393409000},"page":"346-357","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Two-Phase Approach for Enumeration of Maximal $$(\\varDelta , \\gamma )$$-Cliques of a Temporal Network"],"prefix":"10.1007","author":[{"given":"Suman","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bithika","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,1]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Akkoyunlu, E.A.: The enumeration of maximal cliques of large graphs. SIAM J. Comput. 2(1), 1\u20136 (1973)","DOI":"10.1137\/0202001"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Al-Naymat, G., Chawla, S., Arunasalam, B.: Enumeration of maximal clique for mining spatial co-location patterns. In: 2008 IEEE\/ACS International Conference on Computer Systems and Applications (2007)","DOI":"10.1109\/AICCSA.2008.4493526"},{"key":"33_CR3","unstructured":"Banerjee, S., Pal, B.: On the enumeration of maximal ($$\\Delta $$, $$\\gamma $$)-cliques of a temporal network. In: Proceedings of the ACM India Joint International Conference on Data Science and Management of Data (COMAD\/CODS 2019), Kolkata, India, January 3\u20135 2019, pp. 112\u2013120 (2019)"},{"issue":"3","key":"33_CR4","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1109\/TKDE.2015.2492559","volume":"28","author":"SS Bhowmick","year":"2015","unstructured":"Bhowmick, S.S., Seah, B.S.: Clustering and summarizing protein-protein interaction networks: a survey. IEEE Trans. Knowl. Data Eng. 28(3), 638\u2013658 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"9","key":"33_CR5","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":"33_CR6","first-page":"1","volume":"18","author":"D Eppstein","year":"2013","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. J. Exp, Algorith. (JEA) 18, 1\u20133 (2013)","journal-title":"J. Exp, Algorith. (JEA)"},{"key":"33_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. WH freeman, New York (2002)"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Himmel, A.S., Molter, H., Niedermeier, R., Sorge, M.: Enumerating maximal cliques in temporal graphs. In: IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2016), pp. 337\u2013344. IEEE (2016)","DOI":"10.1109\/ASONAM.2016.7752255"},{"issue":"1","key":"33_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s13278-017-0455-0","volume":"7","author":"AS Himmel","year":"2017","unstructured":"Himmel, A.S., Molter, H., Niedermeier, R., Sorge, M.: Adapting the bron-kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Mining 7(1), 35 (2017)","journal-title":"Soc. Netw. Anal. Mining"},{"issue":"3","key":"33_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"issue":"12","key":"33_CR11","doi-asserted-by":"publisher","first-page":"i171","DOI":"10.1093\/bioinformatics\/btv227","volume":"31","author":"Y Hulovatyy","year":"2015","unstructured":"Hulovatyy, Y., Chen, H., Milenkovi\u0107, T.: Exploring the structure and function of temporal networks with dynamic graphlets. Bioinformatics 31(12), i171\u2013i180 (2015)","journal-title":"Bioinformatics"},{"issue":"1","key":"33_CR12","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","volume":"271","author":"L Isella","year":"2011","unstructured":"Isella, L., Stehl\u00e9, J., Barrat, A., Cattuto, C., Pinton, J.F., Van den Broeck, W.: What\u2019s in a crowd? analysis of face-to-face behavioral networks. J. Theor, Biol. 271(1), 166\u2013180 (2011)","journal-title":"J. Theor, Biol."},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Kumar, S., Hooi, B., Makhija, D., Kumar, M., Faloutsos, C., Subrahmanian, V.: Rev2: Fraudulent user prediction in rating platforms. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pp. 333\u2013341. ACM (2018)","DOI":"10.1145\/3159652.3159729"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Masuda, N., Holme, P.: Temporal Network Epidemiology. Springer, Singapore (2017)","DOI":"10.1007\/978-981-10-5287-3"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Molter, H., Niedermeier, R., Renken, M.: Enumerating isolated cliques in temporal networks. In: International Conference on Complex Networks and Their Applications, pp. 519\u2013531. Springer (2019)","DOI":"10.1007\/978-3-030-36683-4_42"},{"issue":"3","key":"33_CR16","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/TKDE.2016.2527643","volume":"29","author":"AP Mukherjee","year":"2016","unstructured":"Mukherjee, A.P., Xu, P., Tirthapura, S.: Enumeration of maximal cliques from an uncertain graph. IEEE Trans. Knowl. Data Eng. 29(3), 543\u2013555 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"33_CR17","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1002\/asi.21015","volume":"60","author":"P Panzarasa","year":"2009","unstructured":"Panzarasa, P., Opsahl, T., Carley, K.M.: Patterns and dynamics of users\u2019 behavior and interaction: Network analysis of an online community. J. Assoc. Inf, Sci, Technol. 60(5), 911\u2013932 (2009)","journal-title":"J. Assoc. Inf, Sci, Technol."},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Gleich, D.F., Gebremedhin, A.H., Patwary, M.M.A.: Fast maximum clique algorithms for large graphs. In: Proceedings of the 23rd International Conference on World Wide Web, pp. 365\u2013366. ACM (2014)","DOI":"10.1145\/2567948.2577283"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Viard, J., Latapy, M., Magnien, C.: Revealing contact patterns among high-school students using maximal cliques in link streams. In: Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, pp. 1517\u20131522. ACM (2015)","DOI":"10.1145\/2808797.2809291"},{"key":"33_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.tcs.2015.09.030","volume":"609","author":"T Viard","year":"2016","unstructured":"Viard, T., Latapy, M., Magnien, C.: Computing maximal cliques in link streams. Theor. Comput. Sci. 609, 245\u2013252 (2016)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86475-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:09:56Z","timestamp":1710328196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86475-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030864743","9783030864750"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86475-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"149","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":"37","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":"31","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":"25% - 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":"4","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","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)"}},{"value":"DEXA 2021 Workshops: 50 papers submitted, 23 papers accepted","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}