{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T17:01:13Z","timestamp":1764349273930,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T00:00:00Z","timestamp":1675728000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T00:00:00Z","timestamp":1675728000000},"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":["Optim Lett"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11590-023-01975-0","type":"journal-article","created":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T13:14:34Z","timestamp":1675775674000},"page":"813-828","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On atomic cliques in temporal graphs"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6145-7771","authenticated-orcid":false,"given":"Yajun","family":"Lu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5251-9862","authenticated-orcid":false,"given":"Zhuqi","family":"Miao","sequence":"additional","affiliation":[]},{"given":"Parisa","family":"Sahraeian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3490-4257","authenticated-orcid":false,"given":"Balabhaskar","family":"Balasundaram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,7]]},"reference":[{"issue":"3","key":"1975_CR1","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1016\/j.ejor.2021.03.051","volume":"296","author":"B Balasundaram","year":"2022","unstructured":"Balasundaram, B., Borrero, J.S., Pan, H.: Graph signatures: identification and optimization. Eur. J. Oper. Res. 296(3), 764\u2013775 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"1975_CR2","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/978-0-387-30165-5_30","volume-title":"Handbook of Optimization in Telecommunications","author":"B Balasundaram","year":"2006","unstructured":"Balasundaram, B., Butenko, S.: Graph domination, coloring and cliques in telecommunications. In: Resende, M.G.C., Pardalos, P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 865\u2013890. Springer Science + Business Media, New York (2006)"},{"key":"1975_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/9780470253489.ch6","volume-title":"Analysis of Biological Networks","author":"B Balasundaram","year":"2008","unstructured":"Balasundaram, B., Butenko, S.: Network clustering. In: Junker, B.H., Schreiber, F. (eds.) Analysis of Biological Networks, pp. 113\u2013138. Wiley, New York (2008)"},{"issue":"1","key":"1975_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B Balasundaram","year":"2011","unstructured":"Balasundaram, B., Butenko, S., Hicks, I.V.: Clique relaxations in social network analysis: the maximum $$k$$-plex problem. Oper. Res. 59(1), 133\u2013142 (2011)","journal-title":"Oper. Res."},{"issue":"1","key":"1975_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","volume":"10","author":"B Balasundaram","year":"2005","unstructured":"Balasundaram, B., Butenko, S., Trukhanov, S.: Novel approaches for analyzing biological networks. J. Comb. Optim. 10(1), 23\u201339 (2005)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"1975_CR6","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1056\/NEJMe078114","volume":"357","author":"AL Barab\u00e1si","year":"2007","unstructured":"Barab\u00e1si, A.L.: Network medicine \u2013 from obesity to the \u201cdiseasome\u2019\u2019. N. Engl. J. Med. 357(4), 404\u2013407 (2007)","journal-title":"N. Engl. J. Med."},{"issue":"4","key":"1975_CR7","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1002\/net.22097","volume":"80","author":"Y Blokhin","year":"2022","unstructured":"Blokhin, Y., Butenko, S., Momcilovic, P., Prokopyev, O.A.: On maximum ratio clique relaxations. Networks 80(4), 440\u2013465 (2022)","journal-title":"Networks"},{"key":"1975_CR8","volume-title":"Innovation in Financial and Economic Networks","author":"V Boginski","year":"2003","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: On structural properties of the market graph. In: Nagurney, A. (ed.) Innovation in Financial and Economic Networks. Edward Elgar Publishers, London (2003)"},{"issue":"1","key":"1975_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-013-1395-3","volume":"216","author":"V Boginski","year":"2014","unstructured":"Boginski, V., Butenko, S., Shirokikh, O., Trukhanov, S., Gil Lafuente, J.: A network-based data mining approach to portfolio selection via weighted clique relaxations. Ann. Oper. Res. 216(1), 23\u201334 (2014)","journal-title":"Ann. Oper. Res."},{"key":"1975_CR10","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1\u201374. Kluwer Academic Publishers, Dordrecht, The Netherlands (1999)"},{"key":"1975_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer-Verlag, London (2008)"},{"key":"1975_CR12","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0305-0548(99)00047-7","volume":"27","author":"JM Bourjolly","year":"2000","unstructured":"Bourjolly, J.M., Laporte, G., Pesant, G.: Heuristics for finding $$k$$-clubs in an undirected graph. Comput. Op. Res. 27, 559\u2013569 (2000)","journal-title":"Comput. Op. Res."},{"key":"1975_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2005.05.026","volume":"173","author":"S Butenko","year":"2006","unstructured":"Butenko, S., Wilhelm, W.: Clique-detection models in computational biochemistry and genomics. Eur. J. Op. Res. 173, 1\u201317 (2006)","journal-title":"Eur. J. Op. Res."},{"issue":"2","key":"1975_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"1975_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2950048","volume":"43","author":"N Gould","year":"2016","unstructured":"Gould, N., Scott, J.: A note on performance profiles for benchmarking software. ACM Trans. Math. Softw. 43(2), 1\u20135 (2016)","journal-title":"ACM Trans. Math. Softw."},{"key":"1975_CR16","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2022). http:\/\/www.gurobi.com"},{"issue":"1","key":"1975_CR17","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. Min. 7(1), 35 (2017)","journal-title":"Soc. Netw. Anal. Min."},{"volume-title":"Cliques, Coloring, and Satisfiablility: Second Dimacs Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science","year":"1996","key":"1975_CR18","unstructured":"Johnson, D., Trick, M. (eds.): Cliques, Coloring, and Satisfiablility: Second Dimacs Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26. American Mathematical Society, Providence, RI (1996)"},{"key":"1975_CR19","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"1975_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2021.113583","volume":"148","author":"Y Lu","year":"2021","unstructured":"Lu, Y., Chen, S., Miao, Z., Delen, D., Gin, A.: Clustering temporal disease networks to assist clinical decision support systems in visual analytics of comorbidity progression. Decis. Support Syst. 148, 113583 (2021)","journal-title":"Decis. Support Syst."},{"issue":"3","key":"1975_CR21","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1287\/ijoc.2019.0922","volume":"32","author":"Z Miao","year":"2020","unstructured":"Miao, Z., Balasundaram, B.: An ellipsoidal bounding scheme for the quasi-clique number of a graph. INFORMS J. Comput. 32(3), 763\u2013778 (2020)","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"1975_CR22","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1007\/s11590-012-0536-y","volume":"7","author":"M Mirghorbani","year":"2013","unstructured":"Mirghorbani, M., Krokhmal, P.: On finding $$k$$-cliques in $$k$$-partite graphs. Optim. Lett. 7(6), 1155\u20131165 (2013)","journal-title":"Optim. Lett."},{"issue":"1","key":"1975_CR23","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10107-021-01706-2","volume":"195","author":"MJ Naderi","year":"2022","unstructured":"Naderi, M.J., Buchanan, A., Walteros, J.L.: Worst-case analysis of clique MIPs. Math. Program. 195(1), 517\u2013551 (2022)","journal-title":"Math. Program."},{"key":"1975_CR24","unstructured":"Pan, H., Balasundaram, B., Borrero, J.S.: A decomposition branch-and-cut algorithm for the maximum cross-graph $$k$$-club problem. In: Proceedings of the 10th International Network Optimization Conference (INOC), pp. 17\u201322. Open Proceedings (2022). http:\/\/www.openproceedings.org\/html\/pages\/2022_inoc.html"},{"issue":"2","key":"1975_CR25","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1002\/net.21791","volume":"71","author":"G Pastukhov","year":"2018","unstructured":"Pastukhov, G., Veremyev, A., Boginski, V., Prokopyev, O.A.: On maximum degree-based-quasi-clique problem: complexity and exact approaches. Networks 71(2), 136\u2013152 (2018)","journal-title":"Networks"},{"issue":"1\u20132","key":"1975_CR26","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.dam.2012.07.019","volume":"161","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Veremyev, A., Butenko, S., Boginski, V.: On the maximum quasi-clique problem. Discret. Appl. Math. 161(1\u20132), 244\u2013257 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"1975_CR27","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ejor.2012.10.021","volume":"226","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Youssef, N., Butenko, S.: On clique relaxation models in network analysis. Eur. J. Oper. Res. 226(1), 9\u201318 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1975_CR28","doi-asserted-by":"publisher","first-page":"S17","DOI":"10.1186\/1752-0509-6-S3-S17","volume":"6","author":"MP Pradhan","year":"2012","unstructured":"Pradhan, M.P., Nagulapalli, K., Palakal, M.J.: Cliques for the identification of gene signatures for colorectal cancer across population. BMC Syst. Biol. 6(3), S17 (2012)","journal-title":"BMC Syst. Biol."},{"issue":"1","key":"1975_CR29","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10479-018-2956-2","volume":"276","author":"S Rasti","year":"2019","unstructured":"Rasti, S., Vogiatzis, C.: A survey of computational methods in protein-protein interaction networks. Ann. Oper. Res. 276(1), 35\u201387 (2019)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1975_CR30","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10287-013-0197-z","volume":"12","author":"S Sethuraman","year":"2015","unstructured":"Sethuraman, S., Butenko, S.: The maximum ratio clique problem. CMS 12(1), 197\u2013218 (2015)","journal-title":"CMS"},{"issue":"21","key":"1975_CR31","doi-asserted-by":"publisher","first-page":"12123","DOI":"10.1073\/pnas.2032324100","volume":"100","author":"V Spirin","year":"2003","unstructured":"Spirin, V., Mirny, L.A.: Protein complexes and functional modules in molecular networks. Proc. Natl. Acad. Sci. 100(21), 12123\u201312128 (2003)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"1975_CR32","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10589-015-9804-y","volume":"64","author":"A Veremyev","year":"2016","unstructured":"Veremyev, A., Prokopyev, O.A., Butenko, S., Pasiliao, E.L.: Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs. Comput. Optim. Appl. 64(1), 177\u2013214 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"1975_CR33","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. Theoret. Comput. Sci. 609, 245\u2013252 (2016)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"1975_CR34","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1287\/opre.2019.1970","volume":"68","author":"JL Walteros","year":"2020","unstructured":"Walteros, J.L., Buchanan, A.: Why is maximum clique often easy in practice? Oper. Res. 68(6), 1866\u20131895 (2020)","journal-title":"Oper. Res."},{"key":"1975_CR35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, New York (1994)"},{"key":"1975_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102262","volume":"101","author":"H Zhong","year":"2021","unstructured":"Zhong, H., Mahdavi Pajouh, F., Prokopyev, O.A.: Finding influential groups in networked systems: the most degree-central clique problem. Omega 101, 102262 (2021)","journal-title":"Omega"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01975-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-01975-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01975-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T13:20:32Z","timestamp":1681305632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-01975-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,7]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1975"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-01975-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2023,2,7]]},"assertion":[{"value":"21 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}