{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:28:31Z","timestamp":1764782911340},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_19","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"191-202","source":"Crossref","is-referenced-by-count":34,"title":["Unbalanced Graph Cuts"],"prefix":"10.1007","author":[{"given":"Ara","family":"Hayrapetyan","sequence":"first","affiliation":[]},{"given":"David","family":"Kempe","sequence":"additional","affiliation":[]},{"given":"Martin","family":"P\u00e1l","sequence":"additional","affiliation":[]},{"given":"Zoya","family":"Svitkina","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Network Flows","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. In: STOC (2004)","DOI":"10.1145\/1007352.1007355"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. Journal of Algorithms, 34 (2000)","DOI":"10.1006\/jagm.1999.1062"},{"key":"19_CR4","volume-title":"The Mathematical Theory of Infectious Diseases and its Applications","author":"N. Bailey","year":"1975","unstructured":"Bailey, N.: The Mathematical Theory of Infectious Diseases and its Applications. Hafner Press, New York (1975)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. on Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM J. on Computing"},{"key":"19_CR6","unstructured":"Develin, M., Hartke, S.G.: Fire containment in grids of dimension three and higher (2004) (Submitted)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1038\/nature02541","volume":"429","author":"S. Eubank","year":"2004","unstructured":"Eubank, S., Guclu, H., Kumar, V.S.A., Marathe, M.V., Srinivasan, A., Toroczkai, Z., Wang, N.: Modelling disease outbreaks in realistic urban social networks. Nature\u00a0429, 180\u2013184 (2004)","journal-title":"Nature"},{"key":"19_CR8","unstructured":"Eubank, S., Kumar, V.S.A., Marathe, M.V., Srinivasan, A., Wang, N.: Structure of social contact networks and their impact on epidemics. AMS-DIMACS Special Volume on Epidemiology"},{"key":"19_CR9","unstructured":"Eubank, S., Kumar, V.S.A., Marathe, M.V., Srinivasan, A., Wang, N.: Structural and algorithmic aspects of massive social networks. In: SODA (2004)"},{"key":"19_CR10","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. In: STOC (1993)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1137\/S0097539701387660","volume":"31","author":"U. Feige","year":"2002","unstructured":"Feige, U., Krauthgamer, R.: A polylogarithmic approximation of the minimum bisection. SIAM J. on Computing\u00a031, 1090\u20131118 (2002)","journal-title":"SIAM J. on Computing"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/S0166-218X(02)00394-3","volume":"127","author":"U. Feige","year":"2003","unstructured":"Feige, U., Krauthgamer, R., Nissim, K.: On cutting a few vertices from a graph. Discrete Applied Mathematics\u00a0127, 643\u2013649 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR13","unstructured":"Feige, U., Seltser, M.: On the densest k-subgraph problem. Technical report, The Weizmann Institute, Rehovot (1997)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Flake, G., Lawrence, S., Giles, C.L., Coetzee, F.: Self-organization of the web and identification of communities. IEEE Computer, 35 (2002)","DOI":"10.1109\/2.989932"},{"key":"19_CR15","unstructured":"Flake, G., Tarjan, R., Tsioutsiouliklis, K.: Graph clustering techniques based on minimum cut trees. Technical Report 2002-06, NEC, Princeton (2002)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Ford, L., Fulkerson, D.: Maximal flow through a network. Can. J. Math. (1956)","DOI":"10.4153\/CJM-1956-045-5"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. on Computing\u00a018, 30\u201355 (1989)","journal-title":"SIAM J. on Computing"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. on Computing (1996)","DOI":"10.1137\/S0097539793243016"},{"key":"19_CR19","volume-title":"Algorithm Design","author":"J. Kleinberg","year":"2005","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley, Reading (2005)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the web for emerging cyber-communities. In: WWW (1999)","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"19_CR21","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawler","year":"1976","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehard and Winston (1976)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46 (1999)","DOI":"10.1145\/331524.331526"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. Proc. Natl. Acad. Sci. USA (2004)","DOI":"10.1073\/pnas.0400054101"},{"key":"19_CR24","unstructured":"Shmoys, D.: Cut problems and their application to divide-and-conquer. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard problems, pp. 192\u2013235. PWD Publishing (1995)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-27821-4_19","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Z. Svitkina","year":"2004","unstructured":"Svitkina, Z., Tardos, E.: Min-max multiway cut. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 207\u2013218. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:50:40Z","timestamp":1605642640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11561071_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}