{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T00:17:10Z","timestamp":1718756230446},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T00:00:00Z","timestamp":1681689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T00:00:00Z","timestamp":1681689600000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11432-021-3551-2","type":"journal-article","created":{"date-parts":[[2023,4,22]],"date-time":"2023-04-22T09:02:17Z","timestamp":1682154137000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved kernels for triangle packing in tournaments"],"prefix":"10.1007","volume":"66","author":[{"given":"Hanchun","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,17]]},"reference":[{"key":"3551_CR1","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, 1996, 25: 272\u2013289","journal-title":"SIAM J Comput"},{"key":"3551_CR2","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45123-4_20","volume-title":"Combinatorial Pattern Matching","author":"N El-Mabrouk","year":"2000","unstructured":"El-Mabrouk N. Genome rearrangement by reversals and insertions\/deletions of contiguous segments. In: Combinatorial Pattern Matching. Berlin: Springer, 2000. 222\u2013234"},{"key":"3551_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-05269-4_22","volume-title":"Research in Computational Molecular Biology","author":"M F Shao","year":"2014","unstructured":"Shao M F, Lin Y, Moret B. An exact algorithm to compute the DCJ distance for genomes with duplicate genes. In: Research in Computational Molecular Biology. Cham: Springer, 2014. 280\u2013292"},{"key":"3551_CR4","doi-asserted-by":"publisher","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"H L Bodlaender","year":"2011","unstructured":"Bodlaender H L, Thomass\u00e9 S, Yeo A. Kernel bounds for disjoint cycles and disjoint paths. Theor Comput Sci, 2011, 412: 4570\u20134578","journal-title":"Theor Comput Sci"},{"key":"3551_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0196-6774(03)00052-X","volume":"48","author":"A Caprara","year":"2003","unstructured":"Caprara A, Panconesi A, Rizzi R. Packing cycles in undirected graphs. J Algorithms, 2003, 48: 239\u2013256","journal-title":"J Algorithms"},{"key":"3551_CR6","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1002\/jgt.21720","volume":"74","author":"F V Fomin","year":"2013","unstructured":"Fomin F V, Lokshtanov D, Misra N, et al. Quadratic upper bounds on the Erd\u0151s-P\u00f3sa property for a generalization of packing and covering cycles. J Graph Theor, 2013, 74: 417\u2013424","journal-title":"J Graph Theor"},{"key":"3551_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1145\/1290672.1290685","volume":"3","author":"M Krivelevich","year":"2007","unstructured":"Krivelevich M, Nutov Z, Salavatipour M R, et al. Approximation algorithms and hardness results for cycle packing problems. ACM Trans Algorithms, 2007, 3: 48","journal-title":"ACM Trans Algorithms"},{"key":"3551_CR8","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/070697781","volume":"24","author":"A Slivkins","year":"2010","unstructured":"Slivkins A. Parameterized tractability of edge-disjoint paths on directed acyclic graphs. SIAM J Discrete Math, 2010, 24: 146\u2013157","journal-title":"SIAM J Discrete Math"},{"key":"3551_CR9","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, 1981, 10: 713\u2013717","journal-title":"SIAM J Comput"},{"key":"3551_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0020-0190(02)00274-0","volume":"84","author":"A Caprara","year":"2002","unstructured":"Caprara A, Rizzi R. Packing triangles in bounded degree graphs. Inf Processing Lett, 2002, 84: 175\u2013180","journal-title":"Inf Processing Lett"},{"key":"3551_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V Kann","year":"1991","unstructured":"Kann V. Maximum bounded 3-dimensional matching is MAX SNP-complete. Inf Processing Lett, 1991, 37: 27\u201335","journal-title":"Inf Processing Lett"},{"key":"3551_CR12","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-44849-7_21","volume-title":"Proceedings of the 5th Italian Conference on Algorithms and Complexity","author":"M Chleb\u00edk","year":"2003","unstructured":"Chleb\u00edk M, Chleb\u00edkov\u00e1 J. Approximation hardness for small occurrence instances of np-hard problems. In: Proceedings of the 5th Italian Conference on Algorithms and Complexity. Berlin: Springer, 2003. 152\u2013164"},{"key":"3551_CR13","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.jcss.2003.09.003","volume":"67","author":"J Chen","year":"2003","unstructured":"Chen J, Kanj I A. Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. J Comput Syst Sci, 2003, 67: 833\u2013847","journal-title":"J Comput Syst Sci"},{"key":"3551_CR14","doi-asserted-by":"publisher","first-page":"140603","DOI":"10.1007\/s11432-021-3405-x","volume":"65","author":"Y L Liu","year":"2022","unstructured":"Liu Y L, Chen J, Huang J G. On book thickness parameterized by the vertex cover number. Sci China Inf Sci, 2022, 65: 140603","journal-title":"Sci China Inf Sci"},{"key":"3551_CR15","first-page":"072107","volume":"57","author":"J X Wang","year":"2014","unstructured":"Wang J X, Li W J, Li S H, et al. On the parameterized vertex cover problem for graphs with perfect matching. Sci China Inf Sci, 2014, 57: 072107","journal-title":"Sci China Inf Sci"},{"key":"3551_CR16","doi-asserted-by":"publisher","first-page":"012102","DOI":"10.1007\/s11432-015-5355-1","volume":"59","author":"F Shi","year":"2016","unstructured":"Shi F, Wang J X, Yang Y F, et al. A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees. Sci China Inf Sci, 2016, 59: 012102","journal-title":"Sci China Inf Sci"},{"key":"3551_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan M, Fomin F V, Kowalik L, et al. Parameterized Algorithms. Cham: Springer, 2015"},{"key":"3551_CR18","volume-title":"Kernelization: Theory of Parameterized Preprocessing","author":"F V Fomin","year":"2019","unstructured":"Fomin F V, Lokshtanov D, Saurabh S, et al. Kernelization: Theory of Parameterized Preprocessing. Cambridge: Cambridge University Press, 2019"},{"key":"3551_CR19","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"E D Demaine","year":"2005","unstructured":"Demaine E D, Fomin F V, Hajiaghayi M, et al. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J ACM, 2005, 52: 866\u2013893","journal-title":"J ACM"},{"key":"3551_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cosrev.2008.02.004","volume":"2","author":"F Dorn","year":"2008","unstructured":"Dorn F, Fomin F V, Thilikos D M. Subexponential parameterized algorithms. Comput Sci Rev, 2008, 2: 29\u201339","journal-title":"Comput Sci Rev"},{"key":"3551_CR21","doi-asserted-by":"publisher","first-page":"2197","DOI":"10.1137\/11085390X","volume":"42","author":"F V Fomin","year":"2013","unstructured":"Fomin F V, Villanger Y. Subexponential parameterized algorithm for minimum fill-in. SIAM J Comput, 2013, 42: 2197\u20132216","journal-title":"SIAM J Comput"},{"key":"3551_CR22","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ic.2013.11.006","volume":"233","author":"F Dorn","year":"2013","unstructured":"Dorn F, Fomin F V, Lokshtanov D, et al. Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Inf Computation, 2013, 233: 60\u201370","journal-title":"Inf Computation"},{"key":"3551_CR23","doi-asserted-by":"crossref","unstructured":"Bandyapadhyay S, Lochet W, Lokshtanov D, et al. Subexponential parameterized algorithms for cut and cycle hitting problems on H-minor-free graphs. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022. 2063\u20132084","DOI":"10.1137\/1.9781611977073.82"},{"key":"3551_CR24","doi-asserted-by":"crossref","unstructured":"Lokshtanov D, Panolan F, Saurabh S, et al. Subexponential parameterized algorithms on disk graphs. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022. 2005\u20132031","DOI":"10.1137\/1.9781611977073.80"},{"key":"3551_CR25","doi-asserted-by":"crossref","unstructured":"Marx D, Misra P, Neuen D, et al. A framework for parameterized subexponential algorithms for generalized cycle hitting problems on planar graphs. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022. 2085\u20132127","DOI":"10.1137\/1.9781611977073.83"},{"key":"3551_CR26","doi-asserted-by":"publisher","first-page":"203101","DOI":"10.1007\/s11432-020-2952-7","volume":"63","author":"W F Fan","year":"2020","unstructured":"Fan W F, He K, Li Q, et al. Graph algorithms: parallelization and scalability. Sci China Inf Sci, 2020, 63: 203101","journal-title":"Sci China Inf Sci"},{"key":"3551_CR27","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-28639-4_12","volume-title":"Proceedings of the 1st International Workshop on Parameterized and Exact Computation","author":"L Mathieson","year":"2004","unstructured":"Mathieson L, Prieto-Rodriguez E, Shaw P. Packing edge disjoint triangles: A parameterized view. In: Proceedings of the 1st International Workshop on Parameterized and Exact Computation. Bergen: Springer, 2004. 127\u2013137"},{"key":"3551_CR28","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ipl.2014.02.003","volume":"114","author":"Y J Yang","year":"2014","unstructured":"Yang Y J. Towards optimal kernel for edge-disjoint triangle packing. Inf Processing Lett, 2014, 114: 344\u2013348","journal-title":"Inf Processing Lett"},{"key":"3551_CR29","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ipl.2018.10.006","volume":"142","author":"W B Lin","year":"2019","unstructured":"Lin W B, Xiao M Y. A (3+\u03b5)k-vertex kernel for edge-disjoint triangle packing. Inf Processing Lett, 2019, 142: 20\u201326","journal-title":"Inf Processing Lett"},{"key":"3551_CR30","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1002\/(SICI)1097-0118(199810)29:2<103::AID-JGT6>3.0.CO;2-V","volume":"29","author":"D C Fisher","year":"1998","unstructured":"Fisher D C, Lundgren J R, Merz S K, et al. The domination and competition graphs of a tournament. J Graph Theor, 1998, 29: 103\u2013110","journal-title":"J Graph Theor"},{"key":"3551_CR31","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10710-005-7619-9","volume":"6","author":"M V Butz","year":"2005","unstructured":"Butz M V, Sastry K, Goldberg D E. Strong, stable, and reliable fitness pressure in XCS due to tournament selection. Genet Program Evolvable Mach, 2005, 6: 53\u201377","journal-title":"Genet Program Evolvable Mach"},{"key":"3551_CR32","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1287\/mnsc.1060.0514","volume":"52","author":"G Cui","year":"2006","unstructured":"Cui G, Wong M L, Lui H K. Machine learning for direct marketing response models: Bayesian networks with evolutionary programming. Manage Sci, 2006, 52: 597\u2013612","journal-title":"Manage Sci"},{"key":"3551_CR33","doi-asserted-by":"crossref","unstructured":"de Jong K A, Schultz A C. Using experience-based learning in game playing. In: Proceedings of the 5th International Conference on Machine Learning, Ann Arbor, 1988. 284\u2013290","DOI":"10.1016\/B978-0-934613-64-4.50034-7"},{"key":"3551_CR34","doi-asserted-by":"crossref","unstructured":"Dudek G. Tournament searching method to feature selection problem. In: Proceedings of the 10th International Conference on Artifical Intelligence and Soft Computing, Zakopane, 2010. 437\u2013444","DOI":"10.1007\/978-3-642-13232-2_53"},{"key":"3551_CR35","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1007\/s00453-020-00788-2","volume":"83","author":"S Bessy","year":"2021","unstructured":"Bessy S, Bougeret M, Krithika R, et al. Packing arc-disjoint cycles in tournaments. Algorithmica, 2021, 83: 1393\u20131420","journal-title":"Algorithmica"},{"key":"3551_CR36","unstructured":"Bessy S, Bougeret M, Thiebaut J. Triangle packing in (sparse) tournaments: Approximation and kernelization. In: Proceedings of the 25th Annual European Symposium on Algorithms, Vienna, 2017. 1\u201313"},{"key":"3551_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3355629","volume":"15","author":"F V Fomin","year":"2019","unstructured":"Fomin F V, Le T N, Lokshtanov D, et al. Subquadratic kernels for implicit 3-hitting set and 3-set packing problems. ACM Trans Algorithms, 2019, 15: 1\u201344","journal-title":"ACM Trans Algorithms"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3551-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-021-3551-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3551-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T20:17:48Z","timestamp":1718741868000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-021-3551-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,17]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["3551"],"URL":"https:\/\/doi.org\/10.1007\/s11432-021-3551-2","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,17]]},"assertion":[{"value":"30 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"152104"}}