{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:09:55Z","timestamp":1725516595931},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_38","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"405-416","source":"Crossref","is-referenced-by-count":5,"title":["Enumerating Isolated Cliques in Synthetic and Financial Networks"],"prefix":"10.1007","author":[{"given":"Falk","family":"H\u00fcffner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannes","family":"Moser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","first-page":"62","volume-title":"Proc.\u00a06th ALENEX","author":"F.N. Abu-Khzam","year":"2004","unstructured":"Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: Theory and experiments. In: Proc.\u00a06th ALENEX, pp. 62\u201369. SIAM, Philadelphia (2004)"},{"issue":"1","key":"38_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2005.12.005","volume":"355","author":"M. Behrisch","year":"2006","unstructured":"Behrisch, M., Taraz, A.: Efficiently covering complex networks with cliques of similar vertices. Theoret. Comput. Sci.\u00a0355(1), 37\u201347 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"38_CR3","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.csda.2004.02.004","volume":"48","author":"V. Boginski","year":"2005","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: Statistical analysis of financial networks. Comput. Statist. Data Anal.\u00a048(2), 431\u2013443 (2005)","journal-title":"Comput. Statist. Data Anal."},{"issue":"11","key":"38_CR4","doi-asserted-by":"publisher","first-page":"3171","DOI":"10.1016\/j.cor.2005.01.027","volume":"33","author":"V. Boginski","year":"2006","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: Mining market data: A network approach. Comput. Oper. Res.\u00a033(11), 3171\u20133184 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"38_CR5","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.E.: Clique-detection models in computational biochemistry and genomics. European J. Oper. Res.\u00a0173(1), 1\u201317 (2006)","journal-title":"European J. Oper. Res."},{"issue":"3","key":"38_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1038\/ng1518","volume":"37","author":"E.J. Chesler","year":"2005","unstructured":"Chesler, E.J., Lu, L., Shou, S., Qu, Y., Gu, J., Wang, J., Hsu, H.C., Mountz, J.D., Baldwin, N.E., Langston, M.A., Threadgill, D.W., Manly, K.F., Williams, R.W.: Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function. Nat. Genet.\u00a037(3), 233\u2013242 (2005)","journal-title":"Nat. Genet."},{"key":"38_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"38_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"1","key":"38_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n\n                1\u2009\u2212\u2009\u03b5\n                . Acta Math.\u00a0182(1), 105\u2013142 (1999)","journal-title":"Acta Math."},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11561071_13","volume-title":"Algorithms \u2013 ESA 2005","author":"H. Ito","year":"2005","unstructured":"Ito, H., Iwama, K., Osumi, T.: Linear-time enumeration of isolated cliques. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 119\u2013130. Springer, Heidelberg (2005)"},{"issue":"1\u20132","key":"38_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00286-3","volume":"250","author":"I. Koch","year":"2001","unstructured":"Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theoret. Comput. Sci.\u00a0250(1\u20132), 1\u201330 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-73545-8_16","volume-title":"Computing and Combinatorics","author":"C. Komusiewicz","year":"2007","unstructured":"Komusiewicz, C., H\u00fcffner, F., Moser, H., Niedermeier, R.: Isolation concepts for enumerating dense subgraphs. In: Lin, G. (ed.) COCOON. LNCS, vol.\u00a04598, pp. 140\u2013150. Springer, Heidelberg (2007)"},{"key":"38_CR13","volume-title":"Introduction to Econophysics: Correlations and Complexity in Finance","author":"R.N. Mantegna","year":"2000","unstructured":"Mantegna, R.N., Stanley, H.E.: Introduction to Econophysics: Correlations and Complexity in Finance. Cambridge University Press, Cambridge (2000)"},{"issue":"1","key":"38_CR14","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E. Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theoret. Comput. Sci.\u00a0363(1), 28\u201342 (2006)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:41:07Z","timestamp":1619523667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}