{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:30:13Z","timestamp":1725795013815},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_25","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T05:30:40Z","timestamp":1401687040000},"page":"325-336","source":"Crossref","is-referenced-by-count":3,"title":["A Parameterized Algorithm for Packing Overlapping Subgraphs"],"prefix":"10.1007","author":[{"given":"Jazm\u0144","family":"Romero","sequence":"first","affiliation":[]},{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1093\/bioinformatics\/btl039","volume":"22","author":"B. Adamcsek","year":"2006","unstructured":"Adamcsek, B., Palla, G., Farkas, I., Derenyi, I., Vicsek, T.: Cfinder: locating cliques and overlapping modules in biological networks. Bioinformatics\u00a022(8), 1021\u20131023 (2006)","journal-title":"Bioinformatics"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Damaschke, P.: Fixed-parameter tractable generalizations of cluster editing. In: The 6th International Conference on Algorithms and Complexity (CIAC), pp. 344\u2013355 (January 2006)","DOI":"10.1007\/11758471_33"},{"issue":"1","key":"25_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.disopt.2010.09.006","volume":"8","author":"M. Fellows","year":"2011","unstructured":"Fellows, M., Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Graph-based data clustering with overlaps. Discrete Optimization\u00a08(1), 2\u201317 (2011)","journal-title":"Discrete Optimization"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Fellows, M., Heggernes, P., Rosamond, F., Sloper, C., Telle, J.: Finding k disjoint triangles in an arbitrary graph. In: The 30th Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp. 235\u2013244 (2004)","DOI":"10.1007\/978-3-540-30559-0_20"},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00453-007-9146-y","volume":"52","author":"M. Fellows","year":"2008","unstructured":"Fellows, M., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica\u00a052(2), 167\u2013176 (2008)","journal-title":"Algorithmica"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-35843-2_21","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"S. Hartung","year":"2013","unstructured":"Hartung, S., Komusiewicz, C., Nichterlein, A.: On structural parameterizations for the 2-club problem. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol.\u00a07741, pp. 233\u2013243. Springer, Heidelberg (2013)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Komusiewicz, C., Sorge, M.: Finding dense subgraphs of sparse graphs. In: 7th International Symposium on Parameterized and Exact Computation (IPEC), pp. 242\u2013251 (2012)","DOI":"10.1007\/978-3-642-33293-7_23"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-95891-8_37","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"H. Moser","year":"2009","unstructured":"Moser, H.: A problem kernelization for graph packing. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 401\u2013412. Springer, Heidelberg (2009)"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.tcs.2005.10.009","volume":"351","author":"E. Prieto","year":"2006","unstructured":"Prieto, E., Sloper, C.: Looking at the stars. Theoretical Computer Science\u00a0351(3), 437\u2013445 (2006)","journal-title":"Theoretical Computer Science"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-319-04657-0_13","volume-title":"Algorithms and Computation","author":"J. Romero","year":"2014","unstructured":"Romero, J., L\u00f3pez-Ortiz, A.: The \n                  \n                    \n                  \n                  ${\\mathcal{G}}$\n                -packing with t-overlap problem. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol.\u00a08344, pp. 114\u2013124. Springer, Heidelberg (2014)"},{"issue":"5","key":"25_CR11","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s11590-011-0311-5","volume":"6","author":"A. Sch\u00e4fer","year":"2012","unstructured":"Sch\u00e4fer, A., Komusiewicz, C., Moser, H., Niedermeier, R.: Parameterized computational complexity of finding small-diameter subgraphs. Optimization Letters\u00a06(5), 883\u2013891 (2012)","journal-title":"Optimization Letters"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:55:49Z","timestamp":1558914949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}