{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:15:48Z","timestamp":1776122148429,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662460771","type":"print"},{"value":"9783662460788","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_21","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T09:54:29Z","timestamp":1421229269000},"page":"254-265","source":"Crossref","is-referenced-by-count":9,"title":["Finding Highly Connected Subgraphs"],"prefix":"10.1007","author":[{"given":"Falk","family":"H\u00fcffner","sequence":"first","affiliation":[]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/2344422.2344428","volume":"8","author":"D. Binkele-Raible","year":"2012","unstructured":"Binkele-Raible, D., Fernau, H., Fomin, F.V., Lokshtanov, D., Saurabh, S., Villanger, Y.: Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Trans. Algorithms\u00a08(4), 38 (2012)","journal-title":"ACM Trans. Algorithms"},{"issue":"8","key":"21_CR2","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci.\u00a075(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1137\/0114065","volume":"14","author":"G. Chartrand","year":"1966","unstructured":"Chartrand, G.: A graph-theoretic approach to a communications problem. SIAM J. Appl. Math.\u00a014(4), 778\u2013781 (1966)","journal-title":"SIAM J. Appl. Math."},{"key":"21_CR4","first-page":"40","volume":"411","author":"J. Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci.\u00a0411, 40\u201342 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-17517-6_36","volume-title":"Algorithms and Computation","author":"D. Eppstein","year":"2010","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I. LNCS, vol.\u00a06506, pp. 403\u2013414. Springer, Heidelberg (2010)"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.ejc.2012.04.008","volume":"34","author":"M.R. Fellows","year":"2013","unstructured":"Fellows, M.R., Jansen, B.M.P., Rosamond, F.A.: Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. Eur. J. Combinatorics\u00a034(3), 541\u2013566 (2013)","journal-title":"Eur. J. Combinatorics"},{"issue":"7","key":"21_CR8","doi-asserted-by":"publisher","first-page":"1430","DOI":"10.1016\/j.jcss.2014.04.015","volume":"80","author":"F.V. Fomin","year":"2014","unstructured":"Fomin, F.V., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Villanger, Y.: Tight bounds for parameterized complexity of cluster editing with a small number of clusters. J. Comput. Syst. Sci.\u00a080(7), 1430\u20131447 (2014)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Hartuv, E., Shamir, R.: A clustering algorithm based on graph connectivity. Inf. Process. Lett.\u00a076(4\u20136), 175\u2013181","DOI":"10.1016\/S0020-0190(00)00142-3"},{"issue":"26-28","key":"21_CR10","doi-asserted-by":"publisher","first-page":"2467","DOI":"10.1016\/j.tcs.2010.02.016","volume":"411","author":"Q.-S. Hua","year":"2010","unstructured":"Hua, Q.-S., Wang, Y., Yu, D., Lau, F.C.M.: Dynamic programming based algorithms for set multicover and multiset multicover problems. Theor. Comput. Sci.\u00a0411(26-28), 2467\u20132474 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"21_CR11","first-page":"455","volume":"11","author":"F. H\u00fcffner","year":"2014","unstructured":"H\u00fcffner, F., Komusiewicz, C., Liebtrau, A., Niedermeier, R.: Partitioning biological networks into highly connected clusters with maximum edge coverage. IEEE\/ACM Trans. Comput.\u00a011(3), 455\u2013467 (2014)","journal-title":"IEEE\/ACM Trans. Comput."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Ito, H., Iwama, K.: Enumeration of isolated cliques and pseudo-cliques. ACM Trans. Algorithms\u00a05(4), Article\u00a040 (2009)","DOI":"10.1145\/1597036.1597044"},{"key":"21_CR13","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":"38-40","key":"21_CR14","doi-asserted-by":"publisher","first-page":"3640","DOI":"10.1016\/j.tcs.2009.04.021","volume":"410","author":"C. Komusiewicz","year":"2009","unstructured":"Komusiewicz, C., H\u00fcffner, F., Moser, H., Niedermeier, R.: Isolation concepts for efficiently enumerating dense subgraphs. Theor. Comput. Sci\u00a0410(38-40), 3640\u20133654 (2009)","journal-title":"Theor. Comput. Sci"},{"key":"21_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-87481-2_3","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"G. Liu","year":"2008","unstructured":"Liu, G., Wong, L.: Effective pruning techniques for mining quasi-cliques. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part II. LNCS (LNAI), vol.\u00a05212, pp. 33\u201349. Springer, Heidelberg (2008)"},{"key":"21_CR16","first-page":"41","volume":"105","author":"D. Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the Exponential Time Hypothesis. Bulletin of the EATCS\u00a0105, 41\u201371 (2011)","journal-title":"Bulletin of the EATCS"},{"issue":"2","key":"21_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0304-3975(98)00091-7","volume":"210","author":"H. Matsuda","year":"1999","unstructured":"Matsuda, H., Ishihara, T., Hashimoto, A.: Classifying molecular sequences using a linkage graph with their pairwise similarities. Theor. Comput. Sci.\u00a0210(2), 305\u2013325 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"21_CR18","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. Operational Research\u00a0226(1), 9\u201318 (2013)","journal-title":"Eur. J. Operational Research"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1038\/msb4100129","volume":"3","author":"R. Sharan","year":"2007","unstructured":"Sharan, R., Ulitsky, I., Shamir, R.: Network-based prediction of protein function. Mol. Syst. Biol.\u00a03, 88 (2007)","journal-title":"Mol. Syst. Biol."},{"issue":"2","key":"21_CR20","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.ejor.2014.05.041","volume":"239","author":"A. Veremyev","year":"2014","unstructured":"Veremyev, A., Prokopyev, O.A., Boginski, V., Pasiliao, E.L.: Finding maximum subgraphs with relatively large vertex connectivity. Eur. J. Operational Research\u00a0239(2), 349\u2013362 (2014)","journal-title":"Eur. J. Operational Research"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2015: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46078-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:13:57Z","timestamp":1559088837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}