{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T22:30:05Z","timestamp":1775341805473,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T00:00:00Z","timestamp":1546473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,1,3]]},"DOI":"10.1145\/3297001.3297015","type":"proceedings-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T21:45:18Z","timestamp":1547847918000},"page":"112-120","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["On the Enumeration of Maximal (\u0394, \u03b3)-Cliques of a Temporal Network"],"prefix":"10.1145","author":[{"given":"Suman","family":"Banerjee","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Kharagpur, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bithika","family":"Pal","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Kharagpur, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,1,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2017. Infectious network dataset - KONECT. http:\/\/konect.uni-koblenz.de\/networks\/sociopatterns-infectious  2017. Infectious network dataset - KONECT. http:\/\/konect.uni-koblenz.de\/networks\/sociopatterns-infectious"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202001"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.010"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1060"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32049-6_16"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807217"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043652.2043654"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339724"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2006.17"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2543629"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2543629"},{"key":"e_1_3_2_1_14_1","volume-title":"Listing all maximal cliques in large sparse real-world graphs. Experimental Algorithms","author":"Eppstein David","year":"2011","unstructured":"David Eppstein and Darren Strash . 2011. Listing all maximal cliques in large sparse real-world graphs. Experimental Algorithms ( 2011 ), 364--375. David Eppstein and Darren Strash. 2011. Listing all maximal cliques in large sparse real-world graphs. Experimental Algorithms (2011), 364--375."},{"key":"e_1_3_2_1_15_1","volume-title":"Topological features of online social networks. arXiv preprint arXiv.1202.0331","author":"Ferrara Emilio","year":"2012","unstructured":"Emilio Ferrara and Giacomo Fiumara . 2012. Topological features of online social networks. arXiv preprint arXiv.1202.0331 ( 2012 ). Emilio Ferrara and Giacomo Fiumara. 2012. Topological features of online social networks. arXiv preprint arXiv.1202.0331 (2012)."},{"key":"e_1_3_2_1_16_1","volume-title":"Computers and intractability","author":"Garey Michael R","unstructured":"Michael R Garey and David S Johnson . 2002. Computers and intractability . Vol. 29 . wh freeman New York . Michael R Garey and David S Johnson. 2002. Computers and intractability. Vol. 29. wh freeman New York."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3192424.3192486"},{"key":"e_1_3_2_1_18_1","volume-title":"Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Social Network Analysis and Mining 7, 1 (31","author":"Himmel Anne-Sophie","year":"2017","unstructured":"Anne-Sophie Himmel , Hendrik Molter , Rolf Niedermeier , and Manuel Sorge . 2017. Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Social Network Analysis and Mining 7, 1 (31 Jul 2017 ), 35. Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, and Manuel Sorge. 2017. Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Social Network Analysis and Mining 7, 1 (31 Jul 2017), 35."},{"key":"e_1_3_2_1_19_1","volume-title":"Temporal networks. Physics reports 519, 3","author":"Holme Petter","year":"2012","unstructured":"Petter Holme and Jari Saram\u00e4ki . 2012. Temporal networks. Physics reports 519, 3 ( 2012 ), 97--125. Petter Holme and Jari Saram\u00e4ki. 2012. Temporal networks. Physics reports 519, 3 (2012), 97--125."},{"key":"e_1_3_2_1_20_1","volume-title":"Temporal networks","author":"Holme Petter","unstructured":"Petter Holme and Jari Saram\u00e4ki . 2013. Temporal networks . Springer . Petter Holme and Jari Saram\u00e4ki. 2013. Temporal networks. Springer."},{"key":"e_1_3_2_1_21_1","volume-title":"Efficient maximal clique enumeration over graph data. Data Science and Engineering1, 4","author":"Hou Boyi","year":"2016","unstructured":"Boyi Hou , Zhuo Wang , Qun Chen , Bo Suo , Chao Fang , Zhanhuai Li , and Zachary G Ives . 2016. Efficient maximal clique enumeration over graph data. Data Science and Engineering1, 4 ( 2016 ), 219--230. Boyi Hou, Zhuo Wang, Qun Chen, Bo Suo, Chao Fang, Zhanhuai Li, and Zachary G Ives. 2016. Efficient maximal clique enumeration over graph data. Data Science and Engineering1, 4 (2016), 219--230."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv227"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtbi.2010.11.033"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367591"},{"key":"e_1_3_2_1_26_1","volume-title":"Temporal Network Epidemiology","author":"Masuda Naoki","unstructured":"Naoki Masuda and Petter Holme . 2017. Temporal Network Epidemiology . Springer . Naoki Masuda and Petter Holme. 2017. Temporal Network Epidemiology. Springer."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113288"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2527643"},{"key":"e_1_3_2_1_29_1","first-page":"911","article-title":"Patterns and dynamics of users' behavior and interaction: Network analysis of an online community","volume":"60","author":"Panzarasa Pietro","year":"2009","unstructured":"Pietro Panzarasa , Tore Opsahl , and Kathleen M Carley . 2009 . Patterns and dynamics of users' behavior and interaction: Network analysis of an online community . Journal of the Association for Information Science and Technology 60 , 5 (2009), 911 -- 932 . Pietro Panzarasa, Tore Opsahl, and Kathleen M Carley. 2009. Patterns and dynamics of users' behavior and interaction: Network analysis of an online community. Journal of the Association for Information Science and Technology 60, 5 (2009), 911--932.","journal-title":"Journal of the Association for Information Science and Technology"},{"key":"e_1_3_2_1_30_1","volume-title":"Using graph theory to analyze biological networks. BioData mining 4, 1","author":"Pavlopoulos Georgios A","year":"2011","unstructured":"Georgios A Pavlopoulos , Maria Secrier , Charalampos N Moschopoulos , Theodoros G Soldatos , Sophia Kossida , Jan Aerts , Reinhard Schneider , and Pantelis G Bagos . 2011. Using graph theory to analyze biological networks. BioData mining 4, 1 ( 2011 ), 10. Georgios A Pavlopoulos, Maria Secrier, Charalampos N Moschopoulos, Theodoros G Soldatos, Sophia Kossida, Jan Aerts, Reinhard Schneider, and Pantelis G Bagos. 2011. Using graph theory to analyze biological networks. BioData mining 4, 1 (2011), 10."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/14100018X"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2577283"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.01.003"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2808797.2809291"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.030"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.01.006"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544815"},{"key":"e_1_3_2_1_39_1","unstructured":"Zhaonian Zou Jianzhong Li Hong Gao and Shuo Zhang. 2010. Finding top-k maximal cliques in an uncertain graph. (2010).  Zhaonian Zou Jianzhong Li Hong Gao and Shuo Zhang. 2010. Finding top-k maximal cliques in an uncertain graph. (2010)."}],"event":{"name":"CoDS-COMAD '19: 6th ACM IKDD CoDS and 24th COMAD","location":"Kolkata India","acronym":"CoDS-COMAD '19"},"container-title":["Proceedings of the ACM India Joint International Conference on Data Science and Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297001.3297015","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297001.3297015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:14Z","timestamp":1750213574000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297001.3297015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,3]]},"references-count":39,"alternative-id":["10.1145\/3297001.3297015","10.1145\/3297001"],"URL":"https:\/\/doi.org\/10.1145\/3297001.3297015","relation":{},"subject":[],"published":{"date-parts":[[2019,1,3]]},"assertion":[{"value":"2019-01-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}