{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:49:51Z","timestamp":1743119391171,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_21","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T08:02:33Z","timestamp":1580112153000},"page":"249-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Packing Arc-Disjoint Cycles in Bipartite Tournaments"],"prefix":"10.1007","author":[{"given":"Ajay Saju","family":"Jacob","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Krithika","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N Alon","year":"2006","unstructured":"Alon, N.: Ranking tournaments. SIAM J. Discrete Math. 20(1), 137\u2013142 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-02927-1_6","volume-title":"Automata, Languages and Programming","author":"Noga Alon","year":"2009","unstructured":"Alon, N., Lokshtanov, D., Saurabh, S.: Fast FAST. In: 36th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 49\u201358 (2009)"},{"issue":"4","key":"21_CR3","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"},{"key":"21_CR4","unstructured":"Bessy, S., et al.: Packing arc-disjoint cycles in tournaments. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), pp. 27:1\u201327:14 (2019)"},{"issue":"6","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1016\/j.jcss.2010.10.001","volume":"77","author":"S Bessy","year":"2011","unstructured":"Bessy, S., et al.: Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. 77(6), 1071\u20131078 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0963548306007887","volume":"16","author":"P Charbit","year":"2007","unstructured":"Charbit, P., Thomass\u00e9, S., Yeo, A.: The minimum feedback arc set problem is $$ NP$$-hard for tournaments. Comb. Probab. Comput. 16(1), 1\u20134 (2007)","journal-title":"Comb. Probab. Comput."},{"key":"21_CR7","unstructured":"Conitzer, V.: Computing slater rankings using similarities among candidates. In: 21st National Conference on Artificial Intelligence, vol. 1. pp. 613\u2013619 (2006)"},{"key":"21_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"21_CR9","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, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","volume":"17","author":"P Erd\u0151s","year":"1965","unstructured":"Erd\u0151s, P., P\u00f3sa, L.: On independent circuits contained in a graph. Can. J. Math. 17, 347\u2013352 (1965)","journal-title":"Can. J. Math."},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5(4), 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"key":"21_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"21_CR13","first-page":"505","volume-title":"Lecture Notes in Computer Science","author":"Fedor V. Fomin","year":"2013","unstructured":"Fomin, F., Pilipczuk, M.: Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. In: 21st Annual European Symposium on Algorithms (ESA 2013), vol. 8125, pp. 505\u2013516 (2013)"},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10(2), 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ipl.2006.11.016","volume":"102","author":"J Guo","year":"2007","unstructured":"Guo, J., H\u00fcffner, F., Moser, H.: Feedback arc set in bipartite tournaments is $$ NP$$-complete. Inf. Process. Lett. 102(2), 62\u201365 (2007)","journal-title":"Inf. Process. Lett."},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-17517-6_3","volume-title":"Algorithms and Computation","author":"M Karpinski","year":"2010","unstructured":"Karpinski, M., Schudy, W.: Faster algorithms for feedback arc set tournament, kemeny rank aggregation and betweenness tournament. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 3\u201314. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17517-6_3"},{"issue":"4","key":"21_CR17","first-page":"577","volume":"88","author":"J Kemeny","year":"1959","unstructured":"Kemeny, J.: Mathematics without numbers. Daedalus 88(4), 577\u2013591 (1959)","journal-title":"Daedalus"},{"key":"21_CR18","volume-title":"Mathematical Models in the Social Sciences","author":"J Kemeny","year":"1962","unstructured":"Kemeny, J., Snell, J.: Mathematical Models in the Social Sciences. Blaisdell, New York (1962)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pp. 95\u2013103 (2007)","DOI":"10.1145\/1250790.1250806"},{"issue":"4","key":"21_CR20","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., Yuster, J.V., Yuster, R.: Approximation algorithms and hardness results for cycle packing problems. ACM Trans. Algorithms 3(4), 48 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"21_CR21","unstructured":"Lokshtanov, D., Mouawad, A., Saurabh, S., Zehavi, M.: Packing cycles faster Than Erd\u0151s-P\u00f3sa. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 71:1\u201371:15 (2017)"},{"key":"21_CR22","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proceedings of IEEE 36th Annual Foundations of Computer Science, pp. 182\u2013191 (1995)"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Paul, C., Perez, A., Thomass\u00e9, S.: Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems. CoRR abs\/1101.4491 (2011)","DOI":"10.1007\/978-3-642-22993-0_45"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1007\/978-3-642-16949-6_24","volume-title":"On the Move to Meaningful Internet Systems, OTM 2010","author":"B Sanghvi","year":"2010","unstructured":"Sanghvi, B., Koul, N., Honavar, V.: Identifying and eliminating inconsistencies in mappings across hierarchical ontologies. In: Meersman, R., Dillon, T., Herrero, P. (eds.) OTM 2010. LNCS, vol. 6427, pp. 999\u20131008. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16949-6_24"},{"issue":"1","key":"21_CR25","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. 24(1), 146\u2013157 (2010)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"21_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00453-013-9783-2","volume":"71","author":"M Xiao","year":"2015","unstructured":"Xiao, M., Guo, J.: A quadratic vertex kernel for feedback arc set in bipartite tournaments. Algorithmica 71(1), 87\u201397 (2015)","journal-title":"Algorithmica"},{"issue":"23","key":"21_CR27","doi-asserted-by":"publisher","first-page":"2556","DOI":"10.1016\/j.tcs.2010.10.047","volume":"412","author":"A Zuylen van","year":"2011","unstructured":"van Zuylen, A.: Linear programming based approximation algorithms for feedback set problems in bipartite tournaments. Theoret. Comput. Sci. 412(23), 2556\u20132561 (2011)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T23:19:30Z","timestamp":1665616770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}