{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:35Z","timestamp":1725489155129},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_16","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T09:44:11Z","timestamp":1187343851000},"page":"140-150","source":"Crossref","is-referenced-by-count":3,"title":["Isolation Concepts for Enumerating Dense Subgraphs"],"prefix":"10.1007","author":[{"given":"Christian","family":"Komusiewicz","sequence":"first","affiliation":[]},{"given":"Falk","family":"H\u00fcffner","sequence":"additional","affiliation":[]},{"given":"Hannes","family":"Moser","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Balasundaram, B., Butenko, S., Hicks, I.V., Sachdeva, S.: Clique relaxations in social network analysis: The maximum k-plex problem. Manuscript (2006)"},{"issue":"1","key":"16_CR2","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., Trukhanovzu, S.: Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization\u00a010(1), 23\u201339 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"16_CR3","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 Journal of Operational Research\u00a0173(1), 1\u201317 (2006)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2005.10.004","volume":"351","author":"P. Damaschke","year":"2006","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoretical Computer Science\u00a0351(3), 337\u2013350 (2006)","journal-title":"Theoretical Computer Science"},{"key":"16_CR5","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":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/3-540-45655-4_60","volume-title":"Computing and Combinatorics","author":"H. Fernau","year":"2002","unstructured":"Fernau, H.: On parameterized enumeration. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 564\u2013573. Springer, Heidelberg (2002)"},{"issue":"1","key":"16_CR7","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 1\u2009\u2212\u2009\u03b5 . Acta Mathematica\u00a0182(1), 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Ito, H., Iwama, K.: Enumeration of isolated cliques and pseudo-cliques. Manuscript (August 2006)","DOI":"10.1007\/11561071_13"},{"key":"16_CR9","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)"},{"key":"16_CR10","unstructured":"Komusiewicz, C.: Various isolation concepts for the enumeration of dense subgraphs. Diplomarbeit, Institut f\u00fcr Informatik, Friedrich-Schiller Universit\u00e4t Jena (2007)"},{"key":"16_CR11","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"1\u20133","key":"16_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.dam.2005.02.029","volume":"152","author":"N. Nishimura","year":"2005","unstructured":"Nishimura, N., Ragde, P., Thilikos, D.M.: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discrete Applied Mathematics\u00a0152(1\u20133), 229\u2013245 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"7043","key":"16_CR13","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature\u00a0435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"J.M. Robson","year":"1986","unstructured":"Robson, J.M.: Algorithms for maximum independent sets. Journal of Algorithms\u00a07(3), 425\u2013440 (1986)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"S.B. Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. Journal of Mathematical Sociology\u00a06(1), 139\u2013154 (1978)","journal-title":"Journal of Mathematical Sociology"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:17:45Z","timestamp":1619504265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}