{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,15]],"date-time":"2023-03-15T04:31:51Z","timestamp":1678854711034},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T00:00:00Z","timestamp":1674691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T00:00:00Z","timestamp":1674691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["grant no. 819416"],"award-info":[{"award-number":["grant no. 819416"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swarnajayanti Fellowship","award":["DST\/SJF\/MSA-01\/2017-18"],"award-info":[{"award-number":["DST\/SJF\/MSA-01\/2017-18"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00224-022-10114-8","type":"journal-article","created":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T08:02:58Z","timestamp":1674720178000},"page":"221-233","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Kernelization of Arc Disjoint Cycle Packing in \u03b1-Bounded Digraphs"],"prefix":"10.1007","volume":"67","author":[{"given":"Abhishek","family":"Sahu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,26]]},"reference":[{"issue":"16","key":"10114_CR1","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.ipl.2010.04.020","volume":"110","author":"FN Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: An improved kernelization algorithm for r-set packing. Inf. Process. Lett. 110(16), 621\u2013624 (2010)","journal-title":"Inf. Process. Lett."},{"key":"10114_CR2","unstructured":"Bessy, S., Bougeret, M., Krithika, R., Sahu, A., Saurabh, S., Thiebaut, J., Zehavi, M.: Packing arc-disjoint cycles in tournaments. In: 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, Aachen, Germany, volume 138 of LIPIcs, pp 27:1\u201327:14,2019 (2019)"},{"issue":"5","key":"10114_CR3","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., Sahu, A., Saurabh, S., Thiebaut, J., Zehavi, M.: Packing arc-disjoint cycles in tournaments. Algorithmica 83(5), 1393\u20131420 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00788-2","journal-title":"Algorithmica"},{"issue":"1","key":"10114_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0129054194000049","volume":"5","author":"HL Bodlaender","year":"1994","unstructured":"Bodlaender, H. L.: On disjoint cycles. Int. J. Found. Comput. Sci. 5(1), 59\u201368 (1994)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"35","key":"10114_CR5","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":"1","key":"10114_CR6","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 48(1), 239\u2013256 (2003)","journal-title":"J. Algorithms"},{"key":"10114_CR7","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"10114_CR8","volume-title":"Graph theory","author":"R Diestel","year":"2006","unstructured":"Diestel, R.: Graph theory. Springer-Verlag, Berlin Heidelberg (2006)"},{"issue":"2","key":"10114_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0166-218X(92)00171-H","volume":"50","author":"D Dorninger","year":"1994","unstructured":"Dorninger, D.: Hamiltonian circuits determining the order of chromosomes. Discret. Appl. Math. 50(2), 159\u2013168 (1994)","journal-title":"Discret. Appl. Math."},{"key":"10114_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of parameterized complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of parameterized complexity. Springer-Verlag, london (2013)"},{"key":"10114_CR11","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","volume":"17","author":"P Erdo\u030bs","year":"1965","unstructured":"Erdo\u030bs, P., P\u00f3sa, L.: On independent circuits contained in a graph. Canadian J. Math. 17, 347\u2013352 (1965)","journal-title":"Canadian J. Math."},{"issue":"3","key":"10114_CR12","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1145\/44483.44491","volume":"35","author":"MR Fellows","year":"1988","unstructured":"Fellows, M. R., Langston, M.A.: Nonconstructive tools for proving polynomial-time decidability. J. ACM 35(3), 727\u2013739 (1988)","journal-title":"J. ACM"},{"key":"10114_CR13","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory springer (2006)"},{"key":"10114_CR14","doi-asserted-by":"publisher","unstructured":"Lochet, W., Lokshtanov, D., Misra, P., Saurabh, S., Sharma, R., Zehavi, M.: Fault tolerant subgraphs with applications in kernelization. In: Vidick, T. (ed.) 11th Innovations in theoretical computer science conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA, vol. 151 of LIPIcs, pp. 47:1\u201347:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.47 (2020)","DOI":"10.4230\/LIPIcs.ITCS.2020.47"},{"issue":"3","key":"10114_CR15","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1137\/17M1150037","volume":"33","author":"D Lokshtanov","year":"2019","unstructured":"Lokshtanov, D., Mouawad, A.E., Saurabh, S., Meirav Zehavi.: Packing cycles faster than Erdo\u030bs-P\u00f3sa. SIAM J. Discrete Math. 33(3), 1194\u20131215 (2019)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"10114_CR16","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/BF01271272","volume":"16","author":"BA Reed","year":"1996","unstructured":"Reed, B.A., Robertson, N., Seymour, P.D., Thomas, R.: Packing directed circuits. Combinatorica 16(4), 535\u2013554 (1996)","journal-title":"Combinatorica"},{"issue":"1","key":"10114_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph, minors. XIII the disjoint paths problem. Journal of Combinatorial Theory Series B 63(1), 65\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory Series B"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-022-10114-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-022-10114-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-022-10114-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,14]],"date-time":"2023-03-14T10:08:41Z","timestamp":1678788521000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-022-10114-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,26]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["10114"],"URL":"https:\/\/doi.org\/10.1007\/s00224-022-10114-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,26]]},"assertion":[{"value":"3 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}