{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T02:50:26Z","timestamp":1780973426178,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540959946","type":"print"},{"value":"9783540959953","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-95995-3_3","type":"book-chapter","created":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T02:33:44Z","timestamp":1233196424000},"page":"25-37","source":"Crossref","is-referenced-by-count":135,"title":["Finding Dense Subgraphs with Size Bounds"],"prefix":"10.1007","author":[{"given":"Reid","family":"Andersen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kumar","family":"Chellapilla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","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, R.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 598\u2013612. Springer, Heidelberg (2002)"},{"key":"3_CR2","first-page":"41","volume":"18","author":"J.I. Alvarez-Hamelin","year":"2006","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. Advances in Neural Information Processing Systems\u00a018, 41\u201350 (2006)","journal-title":"Advances in Neural Information Processing Systems"},{"key":"3_CR3","unstructured":"Andersen, R.: A local algorithm for finding dense subgraphs. In: Proc. 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 1003\u20131009 (2008)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. In: Proc. 27th ACM Symposium on Theory of Computing (STOC 1995), pp. 284\u2013293 (1995)","DOI":"10.1145\/225058.225140"},{"issue":"1-3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y. Asahiro","year":"2002","unstructured":"Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discrete Appl. Math.\u00a0121(1-3), 15\u201326 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y. Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. J. Algorithms\u00a034(2), 203\u2013221 (2000)","journal-title":"J. Algorithms"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M. Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol.\u00a01913, pp. 84\u201395. Springer, Heidelberg (2000)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: WSDM 2008: Proceedings of the international conference on web search and web data mining, pp. 95\u2013106 (2008)","DOI":"10.1145\/1341531.1341547"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: WWW 2007: Proceedings of the 16th international conference on World Wide Web, pp. 461\u2013470 (2007)","DOI":"10.1145\/1242572.1242635"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jagm.2001.1183","volume":"41","author":"U. Feige","year":"2001","unstructured":"Feige, U., Langberg, M.: Approximation algorithms for maximization problems arising in graph partitioning. J. Algorithms\u00a041(2), 174\u2013211 (2001)","journal-title":"J. Algorithms"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica\u00a029(3), 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"3_CR12","unstructured":"Feige, U., Seltser, M.: On the densest k-subgraph problem, Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehobot (1997)"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M., Tarjan, R.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput.\u00a018(1), 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"3_CR14","unstructured":"Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: Proc. 31st VLDB Conference (2005)"},{"key":"3_CR15","unstructured":"Goldberg, A.: Finding a maximum density subgraph, Technical Report UCB\/CSB 84\/171, Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA (1984)"},{"key":"3_CR16","unstructured":"Kannan, R., Vinay, V.: Analyzing the structure of large graphs (manuscript) (1999)"},{"issue":"4","key":"3_CR17","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1137\/S0097539705447037","volume":"36","author":"S. Khot","year":"2006","unstructured":"Khot, S.: Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique. SIAM Journal on Computing\u00a036(4), 1025\u20131071 (2006)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/jagm.1994.1032","volume":"17","author":"G. Kortsarz","year":"1994","unstructured":"Kortsarz, G., Peleg, D.: Generating sparse 2-spanners. J. Algorithms\u00a017(2), 222\u2013236 (1994)","journal-title":"J. Algorithms"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"S.B. Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Social Networks\u00a05, 269\u2013287 (1983)","journal-title":"Social Networks"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the Web for emerging cyber-communities. In: Proc. 8th WWW Conference (WWW 1999) (1999)","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1002\/pmic.200400962","volume":"5","author":"S. Wuchty","year":"2005","unstructured":"Wuchty, S., Almaas, E.: Peeling the yeast protein network. Proteomics\u00a05, 444 (2005)","journal-title":"Proteomics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95995-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T22:46:56Z","timestamp":1551739616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95995-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540959946","9783540959953"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95995-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}