{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T21:20:57Z","timestamp":1775942457910,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319200859","type":"print"},{"value":"9783319200866","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_7","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"82-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments"],"prefix":"10.1007","author":[{"given":"Christian","family":"Komusiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kolja","family":"Stahl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Abello, J., Pardalos, P.M., Resende, M.G.C.: On maximum clique problems in very large graphs. In: External Memory Algorithms and Visualization, vol. 50 of DIMACS, pp. 119\u2013130. AMS (1999)","DOI":"10.1090\/dimacs\/050\/06"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical Informatics","author":"J Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 598\u2013612. Springer, Heidelberg (2002)"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"GD Bader","year":"2003","unstructured":"Bader, G.D., Hogue, C.W.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4(1), 2 (2003)","journal-title":"BMC Bioinformatics"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Balasundaram, B., Pajouh, F.M.: Graph theoretic clique relaxations and applications. In: Handbook of Combinatorial Optimization, pp. 1559\u20131598. Springer (2013)","DOI":"10.1007\/978-1-4419-7997-1_9"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: On structural properties of the market graph. In: Innovations in Financial and Economic Networks. New Dimensions in Networks, pp. 29\u201345. Edward Elgar Publishing, Cheltenham, England (2003)","DOI":"10.4337\/9781035304998.00010"},{"issue":"1&2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science 141(1&2), 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"key":"7_CR7","unstructured":"Feige, U., Seltser, M.: On the densest $$k$$-subgraph problem. Technical report,The Weizmann Institute, Department of Applied Math and Computer Science (1997)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-33293-7_23","volume-title":"Parameterized and Exact Computation","author":"C Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Sorge, M.: Finding dense subgraphs of sparse graphs. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 242\u2013251. Springer, Heidelberg (2012)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-31955-9_6","volume-title":"Network Analysis","author":"S Kosub","year":"2005","unstructured":"Kosub, S.: Local Density. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol. 3418, pp. 112\u2013142. Springer, Heidelberg (2005)"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10479-012-1242-y","volume":"216","author":"FM Pajouh","year":"2014","unstructured":"Pajouh, F.M., Miao, Z., Balasundaram, B.: A branch-and-bound approach for maximum quasi-cliques. Annals of Operations Research 216(1), 145\u2013161 (2014)","journal-title":"Annals of Operations Research"},{"issue":"1\u20132","key":"7_CR11","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. Discrete Applied Mathematics 161(1\u20132), 244\u2013257 (2013)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Raghavendra, P., Steurer, D.: Graph expansion and the unique games conjecture. In: Proc. 42nd STOC, pp. 755\u2013764. ACM (2010)","DOI":"10.1145\/1806689.1806792"},{"issue":"1478","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1098\/rspb.2001.1711","volume":"268","author":"A Wagner","year":"2001","unstructured":"Wagner, A., Fell, D.A.: The small world inside large metabolic networks. Proceedings of the Royal Society of London. Series B: Biological Sciences 268(1478), 1803\u20131810 (2001)","journal-title":"Proceedings of the Royal Society of London. Series B: Biological Sciences"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, J., Chen, Y.: Monte Carlo algorithms for identifying densely connected subgraphs. Journal of Computational and Graphical Statistics (2014)","DOI":"10.1080\/10618600.2014.930040"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:38:19Z","timestamp":1676943499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}