{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:43:56Z","timestamp":1648964636486},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,20]],"date-time":"2013-04-20T00:00:00Z","timestamp":1366416000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s00453-013-9783-2","type":"journal-article","created":{"date-parts":[[2013,4,19]],"date-time":"2013-04-19T15:59:31Z","timestamp":1366387171000},"page":"87-97","source":"Crossref","is-referenced-by-count":3,"title":["A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments"],"prefix":"10.1007","volume":"71","author":[{"given":"Mingyu","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,20]]},"reference":[{"issue":"7","key":"9783_CR1","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"F.N. Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76(7), 524\u2013531 (2010)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9783_CR2","doi-asserted-by":"crossref","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":"9783_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-642-02927-1_6","volume-title":"ICALP 2009","author":"N. Alon","year":"2009","unstructured":"Alon, N., Lokshtanov, D., Saurabh, S.: Fast FAST. In: Albers, S., et al. (eds.) ICALP 2009. Lecture Notes in Computer Science, vol. 5555, pp. 49\u201358. Springer, Heidelberg (2009)"},{"issue":"2","key":"9783_CR4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1287\/moor.27.2.361.328","volume":"27","author":"M. Cai","year":"2002","unstructured":"Cai, M., Deng, M., Zang, W.: A min-max theorem on feedback vertex sets. Math. Oper. Res. 27(2), 361\u2013371 (2002)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"9783_CR5","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1016\/j.jcss.2010.10.001","volume":"77","author":"S. Bessy","year":"2011","unstructured":"Bessy, S., Fomin, F.V., Gaspers, S., Paul, C., Perez, A., Saurabh, S., Thomass\u00e9, S.: 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":"9783_CR6","doi-asserted-by":"crossref","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."},{"issue":"1","key":"9783_CR7","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.jda.2009.08.001","volume":"8","author":"M. Dom","year":"2010","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R., Tru\u00df, A.: Fixed-parameter tractability results for feedback set problems in tournaments. J. Discrete Algorithms 8(1), 76\u201386 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"2\u20133","key":"9783_CR8","doi-asserted-by":"crossref","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\u20133), 62\u201365 (2007)","journal-title":"Inf. Process. Lett."},{"key":"9783_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/978-3-642-25591-5_36","volume-title":"ISAAC 2011","author":"S. Hsiao","year":"2011","unstructured":"Hsiao, S.: Fixed-parameter complexity of feedback vertex set in bipartite tournaments. In: Asano, T., et al. (eds.) ISAAC 2011. Lecture Notes in Computer Science, vol. 7074, pp. 344\u2013353. Springer, Heidelberg (2011)"},{"key":"9783_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-17517-6_3","volume-title":"ISAAC 2010","author":"M. Karpinski","year":"2010","unstructured":"Karpinski, M., Schudy, W.: Faster algorithms for feedback arc set in tournament, Kemeny rank aggregation and betweenness tournament. In: Cheong, O., Chwa, K., Park, K. (eds.) ISAAC 2010. Lecture Notes in Computer Science, vol. 6506, pp. 3\u201314. Springer, Heidelberg (2010)"},{"issue":"4","key":"9783_CR11","first-page":"571","volume":"88","author":"J. Kemeny","year":"1959","unstructured":"Kemeny, J.: Mathematics without numbers. Daedalus 88(4), 571\u2013591 (1959)","journal-title":"Daedalus"},{"key":"9783_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-3-642-25591-5_35","volume-title":"ISAAC 2011","author":"P. Misra","year":"2011","unstructured":"Misra, P., Raman, V., Ramanujan, M.S., Saurabh, S.: A polynomial kernel for feedback arc set on bipartite tournaments. In: Asano, T., et al. (eds.) ISAAC 2011. Lecture Notes in Computer Science, vol. 7074, pp. 333\u2013343. Springer, Heidelberg (2011)"},{"key":"9783_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-3-642-22993-0_45","volume-title":"MFCS 2011","author":"C. Paul","year":"2011","unstructured":"Paul, C., Perez, A., Thomass\u00e9, S.: Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. Lecture Notes in Computer Science, vol. 6907, pp. 497\u2013507. Springer, Heidelberg (2011)"},{"key":"9783_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1007\/978-3-642-16949-6_24","volume-title":"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. Lecture Notes in Computer Science, vol. 6427, pp. 999\u20131008. Springer, Heidelberg (2010)"},{"key":"9783_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/3-540-52292-1_16","volume-title":"WG 1989","author":"E. Speckenmeyer","year":"1990","unstructured":"Speckenmeyer, E.: On feedback problems in digraphs. In: Nagl, M. (ed.) WG 1989. Lecture Notes in Computer Science, vol. 411, pp. 218\u2013231. Springer, Heidelberg (1990)"},{"issue":"3","key":"9783_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.ipl.2007.08.014","volume":"105","author":"P. Sasatte","year":"2008","unstructured":"Sasatte, P.: Improved FPT algorithm for feedback vertex set problem in bipartite tournament. Inf. Process. Lett. 105(3), 79\u201382 (2008)","journal-title":"Inf. Process. Lett."},{"key":"9783_CR17","unstructured":"Wahlstr\u00f6m, M.: Algorithms, measures and upper bounds for satisfiability and related problems. Ph.D.\u00a0Thesis, Link\u00f6pings Universitet (2007)"},{"issue":"3","key":"9783_CR18","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/j.tcs.2005.10.010","volume":"351","author":"V. Raman","year":"2006","unstructured":"Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci. 351(3), 446\u2013458 (2006)","journal-title":"Theor. Comput. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9783-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9783-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9783-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:12Z","timestamp":1559137512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9783-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,20]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9783"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9783-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,20]]}}}