{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:48:37Z","timestamp":1742935717773,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319266251"},{"type":"electronic","value":"9783319266268"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26626-8_49","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T04:08:43Z","timestamp":1449634123000},"page":"676-687","source":"Crossref","is-referenced-by-count":0,"title":["Edge-Disjoint Packing of Stars and Cycles"],"prefix":"10.1007","author":[{"given":"Minghui","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"issue":"4","key":"49_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"issue":"2","key":"49_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V Bafna","year":"1996","unstructured":"Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput. 25(2), 272\u2013289 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"49_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/120880240","volume":"28","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28(1), 277\u2013305 (2014)","journal-title":"SIAM J. Discrete Math."},{"issue":"35","key":"49_CR4","doi-asserted-by":"publisher","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"HL Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570\u20134578 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"49_CR5","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1137\/080716475","volume":"38","author":"J Chen","year":"2009","unstructured":"Chen, J., Kneis, J., Lu, S., Molle, D., Richter, S., Rossmanith, P., Sze, S., Zhang, F.: Randomized divide-and-conquer: improved path, matching, and packing algorithms. SIAM J. Comput. 38(6), 2526\u20132547 (2009)","journal-title":"SIAM J. Comput."},{"key":"49_CR6","volume-title":"The Combinatorics of Network Reliability","author":"CJ Colbourn","year":"1987","unstructured":"Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press Inc., New York (1987)"},{"key":"49_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0012-365X(88)90193-8","volume":"72","author":"CJ Colbourn","year":"1988","unstructured":"Colbourn, C.J.: Edge-packings of graphs and network reliability. Discrete Math. 72, 49\u201361 (1988)","journal-title":"Discrete Math."},{"key":"49_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"issue":"2","key":"49_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","volume":"10","author":"ME Dyer","year":"1985","unstructured":"Dyer, M.E., Frieze, A.M.: On the complexity of partitioning graphs into connected subgraphs. Discrete Appl. Math. 10(2), 139\u2013153 (1985)","journal-title":"Discrete Appl. Math."},{"key":"49_CR10","first-page":"13","volume":"19","author":"T Feder","year":"2012","unstructured":"Feder, T., Subi, C.S.: Packing edge-disjoint triangles in given graphs. Electron. Colloquium Comput. Complex. (ECCC) 19, 13 (2012)","journal-title":"Electron. Colloquium Comput. Complex. (ECCC)"},{"issue":"6","key":"49_CR11","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1016\/j.jcss.2010.12.001","volume":"77","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Guo, J., Moser, H., Niedermeier, R.: A generalization of Nemhauser and Trotter\u2019s local optimization theorem. J. Comput. Syst. Sci. 77(6), 1141\u20131158 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Heggernes, P., Rosamond, F.A., Sloper, C., Telle, J.A.: Finding \n                      \n                        \n                      \n                      $$k$$\n                      \n                        \n                          k\n                        \n                      \n                     disjoint triangles in an arbitrary graph. In: Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 235\u2013244 (2004)","DOI":"10.1007\/978-3-540-30559-0_20"},{"issue":"2","key":"49_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00453-007-9146-y","volume":"52","author":"MR Fellows","year":"2008","unstructured":"Fellows, M.R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D.M., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica 52(2), 167\u2013176 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"49_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"key":"49_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-73420-8_34","volume-title":"Automata, Languages and Programming","author":"J Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Linear problem kernels for NP-hard problems on planar graphs. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 375\u2013386. Springer, Heidelberg (2007)"},{"key":"49_CR16","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s002240000107","volume":"31","author":"LS Heath","year":"1998","unstructured":"Heath, L.S., Vergara, J.P.C.: Edge-packing in planar graphs. Theor. Comput. Syst. 31, 629\u2013662 (1998)","journal-title":"Theor. Comput. Syst."},{"issue":"4","key":"49_CR17","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/0210054","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of some edge-partition problems. SIAM J. Comput. 10(4), 713\u2013717 (1981)","journal-title":"SIAM J. Comput."},{"key":"49_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jcss.2012.04.004","volume":"79","author":"K Jansen","year":"2013","unstructured":"Jansen, K., Kratsch, S., Marx, D., Schlotter, I.: Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. 79, 39\u201349 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"49_CR19","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1007\/BF01759074","volume":"6","author":"S Masuyama","year":"1991","unstructured":"Masuyama, S., Ibaraki, T.: Chain packing in graphs. Algorithmica 6, 826\u2013839 (1991)","journal-title":"Algorithmica"},{"key":"49_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-28639-4_12","volume-title":"Parameterized and Exact Computation","author":"L Mathieson","year":"2004","unstructured":"Mathieson, L., Prieto, E., Shaw, P.: Packing edge disjoint triangles: a\u00a0parameterized view. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 127\u2013137. Springer, Heidelberg (2004)"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Moser, H.: A problem kernelization for graph packing. In 35th International Conference on Current Trends in Theory and Practice of Computer Science, pp. 401\u2013412 (2009)","DOI":"10.1007\/978-3-540-95891-8_37"},{"issue":"3","key":"49_CR22","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. Theor. Comput. Sci. 351(3), 437\u2013445 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"49_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-79228-4_19","volume-title":"Theory and Applications of Models of Computation","author":"J Wang","year":"2008","unstructured":"Wang, J., Ning, D., Feng, Q., Chen, J.: An improved parameterized algorithm for a generalized matching problem. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 212\u2013222. Springer, Heidelberg (2008)"},{"issue":"7","key":"49_CR24","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ipl.2014.02.003","volume":"114","author":"Y Yang","year":"2014","unstructured":"Yang, Y.: Towards optimal kernel for edge-disjoint triangle packing. Inf. Process. Lett. 114(7), 344\u2013348 (2014)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T17:01:36Z","timestamp":1559322096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}