{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:05:16Z","timestamp":1743001516463,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819612413"},{"type":"electronic","value":"9789819612420"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-1242-0_27","type":"book-chapter","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T08:07:43Z","timestamp":1733990863000},"page":"359-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$$\\alpha $$-Persistent Temporal Clique Enumeration with\u00a0an\u00a0Application"],"prefix":"10.1007","author":[{"given":"Bithika","family":"Pal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudeshna","family":"Kolay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suman","family":"Banerjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","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, pp. 112\u2013120 (2019)","DOI":"10.1145\/3297001.3297015"},{"issue":"1","key":"27_CR2","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/s13278-024-01207-y","volume":"14","author":"S Banerjee","year":"2024","unstructured":"Banerjee, S., Pal, B.: A two-phase approach for enumeration of maximal ($$\\delta $$, $$\\gamma $$)-cliques of a temporal network. Soc. Netw. Anal. Min. 14(1), 54 (2024)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"12529","DOI":"10.1038\/s41598-020-69464-3","volume":"10","author":"M Ciaperoni","year":"2020","unstructured":"Ciaperoni, M., Galimberti, E., Bonchi, F., Cattuto, C., Gullo, F., Barrat, A.: Relevance of temporal cores for epidemic spread in temporal networks. Sci. Rep. 10(1), 12529 (2020)","journal-title":"Sci. Rep."},{"issue":"1","key":"27_CR4","first-page":"1","volume":"15","author":"E Galimberti","year":"2020","unstructured":"Galimberti, E., Ciaperoni, M., Barrat, A., Bonchi, F., Cattuto, C., Gullo, F.: Span-core decomposition for temporal networks: algorithms and applications. ACM Trans. Knowl. Discov. Data (TKDD) 15(1), 1\u201344 (2020)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"1","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. Min. 7, 1\u201316 (2017)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"1","key":"27_CR6","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."},{"issue":"3","key":"27_CR7","first-page":"707","volume":"72","author":"Q Luo","year":"2022","unstructured":"Luo, Q., Yu, D., Cheng, X., Sheng, H., Lyu, W.: Exploring truss maintenance in fully dynamic graphs: a mixed structure-based approach. IEEE Trans. Comput. 72(3), 707\u2013718 (2022)","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"27_CR8","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0136497","volume":"10","author":"R Mastrandrea","year":"2015","unstructured":"Mastrandrea, R., Fournet, J., Barrat, A.: Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PLoS ONE 10(9), e0136497 (2015)","journal-title":"PLoS ONE"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Ordozgoiti, B., Matakos, A., Gionis, A.: Finding large balanced subgraphs in signed networks. In: Proceedings of The Web Conference 2020, pp. 1378\u20131388 (2020)","DOI":"10.1145\/3366423.3380212"},{"issue":"11","key":"27_CR10","doi-asserted-by":"publisher","first-page":"11259","DOI":"10.1109\/TKDE.2022.3233788","volume":"35","author":"H Qin","year":"2023","unstructured":"Qin, H., Li, R.H., Yuan, Y., Dai, Y., Wang, G.: Densest periodic subgraph mining on large temporal graphs. IEEE Trans. Knowl. Data Eng. 35(11), 11259\u201311273 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"27_CR11","doi-asserted-by":"publisher","first-page":"5051","DOI":"10.1109\/TKDE.2020.3047224","volume":"34","author":"R Sun","year":"2020","unstructured":"Sun, R., Chen, C., Wang, X., Zhang, Y., Wang, X.: Stable community detection in signed social networks. IEEE Trans. Knowl. Data Eng. 34(10), 5051\u20135055 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"27_CR12","doi-asserted-by":"publisher","unstructured":"Viard, J., Latapy, M., Magnien, C.: Revealing contact patterns among high-school students using maximal cliques in link streams. In: Pei, J., Silvestri, F., Tang, J. (eds.) Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, 25\u201328 August 2015, pp. 1517\u20131522. ACM (2015). https:\/\/doi.org\/10.1145\/2808797.2809291","DOI":"10.1145\/2808797.2809291"},{"key":"27_CR13","doi-asserted-by":"publisher","unstructured":"Yang, J., Zhong, M., Zhu, Y., Qian, T., Liu, M., Yu, J.X.: Scalable time-range k-core query on temporal graphs. Proc. VLDB Endow. 16(5), 1168\u20131180 (2023). https:\/\/doi.org\/10.14778\/3579075.3579089","DOI":"10.14778\/3579075.3579089"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X.: Unboundedness and efficiency of truss maintenance in evolving graphs. In: Proceedings of the 2019 International Conference on Management of Data, pp. 1024\u20131041 (2019)","DOI":"10.1145\/3299869.3300082"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1242-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T20:06:02Z","timestamp":1736193962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1242-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9789819612413","9789819612420"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1242-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc-conference.github.io\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}