{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T21:57:20Z","timestamp":1772315840566,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,8,19]],"date-time":"2012-08-19T00:00:00Z","timestamp":1345334400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s11590-012-0536-y","type":"journal-article","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T04:27:06Z","timestamp":1345264026000},"page":"1155-1165","source":"Crossref","is-referenced-by-count":21,"title":["On finding k-cliques in k-partite graphs"],"prefix":"10.1007","volume":"7","author":[{"given":"M.","family":"Mirghorbani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Krokhmal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,19]]},"reference":[{"key":"536_CR1","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Handbook of Combinatorial Optimization, p. 1\u201374. Kluwer, Dordrecht (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"issue":"5","key":"536_CR2","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/j.ipl.2007.08.021","volume":"105","author":"S. Grabowski","year":"2008","unstructured":"Grabowski S., Fredriksson K.: Bit-parallel string matching under hamming distance in $${{O(n\\lceil m\/w \\rceil) O(n\\lceil m\/w \\rceil)}}$$ worst case time. Inf. Process. Lett. 105(5), 182\u2013187 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"536_CR3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0305-0548(00)00053-8","volume":"29","author":"T. Grunert","year":"2002","unstructured":"Grunert T., Irnich S., Zimmermann H.J., Schneider M., Wulfhorst B.: Finding all k-cliques in k-partite graphs, an application in textile engineering. Comput. Oper. Res. 29(1), 13\u201331 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"2\u20134","key":"536_CR4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.jda.2004.08.006","volume":"3","author":"H. Hyyr\u00f6","year":"2005","unstructured":"Hyyr\u00f6 H.: Bit-parallel approximate string matching algorithms with transposition. J. Discrete Algorithms 3(2\u20134), 215\u2013229 (2005)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"536_CR5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s00453-004-1108-z","volume":"41","author":"H. Hyyr\u00f6","year":"2004","unstructured":"Hyyr\u00f6 H., Navarro G.: Bit-parallel witnesses and their applications to approximate string matching. Algorithmica 41(3), 203\u2013231 (2004)","journal-title":"Algorithmica"},{"issue":"2\u20133","key":"536_CR6","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10107-006-0036-x","volume":"109","author":"P. Krokhmal","year":"2007","unstructured":"Krokhmal P., Grundel D., Pardalos P.: Asymptotic behavior of the expected optimal value of the multidimensional assignment problem. Math. Progr. 109(2\u20133), 525\u2013551 (2007)","journal-title":"Math. Progr."},{"key":"536_CR7","doi-asserted-by":"crossref","unstructured":"Krokhmal, P.A., Pardalos, P.M.: Limiting optimal values and convergence rates in some combinatorial optimization problems on hypergraph matchings. (2011, submitted)","DOI":"10.21236\/ADA566882"},{"key":"536_CR8","unstructured":"Leiserson, C.E., Prokop, H., Randall, K.H.: Using de Bruijn sequences to index a 1 in a computer word. Working paper. http:\/\/supertech.csail.mit.edu\/papers\/debruijn.ps (1998)"},{"key":"536_CR9","doi-asserted-by":"crossref","unstructured":"Liu, Q., Chen, Y.: High functional coherence in k-partite protein cliques of protein interaction networks. In: Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, pp. 111\u2013117 (2009)","DOI":"10.1109\/BIBM.2009.46"},{"issue":"2","key":"536_CR10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"R.D. Luce","year":"1950","unstructured":"Luce R.D.: Connectivity and generalized cliques in sociometric group structure. Psychometrika 15(2), 169\u2013190 (1950)","journal-title":"Psychometrika"},{"key":"536_CR11","doi-asserted-by":"crossref","unstructured":"Mirghorbani, M., Krokhmal P., Pasiliao E.L.: Computational studies of randomized multidimensional assignment problems. In: Sorokin, A., Thai, M.T., Pardalos, P.M. (eds.) Dynamics of Information Systems. Springer, Berlin (2012, in press)","DOI":"10.1007\/978-1-4614-3906-6_12"},{"key":"536_CR12","unstructured":"Peters, M.: CLICK: Clustering categorical data using k-partite maximal cliques. In: IEEE International Conference on Data Engineering (2005)"},{"issue":"2","key":"536_CR13","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"P. San Segundo","year":"2011","unstructured":"San Segundo P., Rodr\u00edguez-Losada D., Jiminez A.: An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res. 38(2), 571\u2013581 (2011)","journal-title":"Comput. Oper. Res."},{"key":"536_CR14","doi-asserted-by":"crossref","unstructured":"Segundo, P., Tapia, C., Puente, J., Rodrguez-Losada, D.: A new exact bit-parallel algorithm for sat. In: ICTAI (2)\u201908, pp. 59\u201365 (2008)","DOI":"10.1109\/ICTAI.2008.127"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0536-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0536-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0536-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T20:37:23Z","timestamp":1643229443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0536-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,19]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["536"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0536-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,19]]}}}