{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:55:01Z","timestamp":1725573301081},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_31","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"320-331","source":"Crossref","is-referenced-by-count":21,"title":["Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments"],"prefix":"10.1007","author":[{"given":"Michael","family":"Dom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Falk","family":"H\u00fcffner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anke","family":"Tru\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1145\/1060590.1060692","volume-title":"Proc.\u00a037th STOC","author":"N. Ailon","year":"2005","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: Proc.\u00a037th STOC, pp. 684\u2013693. ACM, New York (2005)"},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N. Alon","year":"2006","unstructured":"Alon, N.: Ranking tournaments. SIAM Journal on Discrete Mathematics\u00a020(1), 137\u2013142 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"6","key":"31_CR3","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1137\/S0097539798338163","volume":"30","author":"M.-C. Cai","year":"2001","unstructured":"Cai, M.-C., Deng, X., Zang, W.: An approximation algorithm for feedback vertex sets in tournaments. SIAM Journal on Computing\u00a030(6), 1993\u20132007 (2001)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1287\/moor.27.2.361.328","volume":"27","author":"M.-C. Cai","year":"2002","unstructured":"Cai, M.-C., Deng, X., Zang, W.: A min-max theorem on feedback vertex sets. Mathematics of Operations Research\u00a027(2), 361\u2013371 (2002)","journal-title":"Mathematics of Operations Research"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Charbit, P., Thomass\u00e9, S., Yeo, A.: The minimum feedback arc set problem is NP-hard for tournaments. Combinatorics, Probability and Computing (to appear, 2005)","DOI":"10.1017\/S0963548306007887"},{"key":"31_CR6","unstructured":"Conitzer, V.: Computing Slater rankings using similarities among candidates. Technical Report RC23748, IBM Thomas J.\u00a0Watson Research Center, Yorktown Heights, NY (2005)"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Dehne, F.K.H.A., Fellows, M.R., Langston, M.A., Rosamond, F.A., Stevens, K.: An O(2 O(k) n 3) FPT algorithm for the undirected feedback vertex set problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 859\u2013869. Springer, Heidelberg (2005), To appear in Theory of Computing Systems","DOI":"10.1007\/11533719_87"},{"key":"31_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"31_CR9","unstructured":"Fernau, H.: A top-down approach to search-trees: Improved algorithmics for 3-hitting set. Technical Report TR04-073, Electronic Colloquium on Computational Complexity (2004)"},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-1-4757-3023-4_4","volume-title":"Handbook of Combinatorial Optimization","author":"P. Festa","year":"1999","unstructured":"Festa, P., Pardalos, P.M., Resende, M.G.C.: Feedback set problems. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol.\u00a0A, pp. 209\u2013258. Kluwer, Dordrecht (1999)"},{"key":"31_CR11","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"1","key":"31_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"M.L. Fredman","year":"1975","unstructured":"Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Mathematics\u00a011(1), 29\u201335 (1975)","journal-title":"Discrete Mathematics"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Guo, J., Gramm, J., H\u00fcffner, F., Niedermeier, R., Wernicke, S.: Improved fixed-parameter algorithms for two feedback set problems. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 158\u2013168. Springer, Heidelberg (2005), To appear in Journal of Computer and System Sciences","DOI":"10.1007\/11534273_15"},{"key":"31_CR14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"1","key":"31_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: An efficient fixed parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms\u00a01(1), 89\u2013102 (2003)","journal-title":"Journal of Discrete Algorithms"},{"issue":"3","key":"31_CR16","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0351(3), 446\u2013458 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"31_CR17","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B. Reed","year":"2004","unstructured":"Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters\u00a032(4), 299\u2013301 (2004)","journal-title":"Operations Research Letters"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/3-540-52292-1_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Speckenmeyer","year":"1990","unstructured":"Speckenmeyer, E.: On feedback problems in digraphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol.\u00a0411, pp. 218\u2013231. Springer, Heidelberg (1990)"},{"key":"31_CR19","unstructured":"Tru\u00df, A.: Parameterized algorithms for feedback set problems in tournaments (in German). Diplomarbeit, Institut f\u00fcr Informatik, Friedrich-Schiller-Universit\u00e4t Jena (December 2005)"},{"key":"31_CR20","unstructured":"van Zuylen, A.: Deterministic approximation algorithms for ranking and clustering problems. Technical Report 1431, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY (September 2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T16:12:10Z","timestamp":1683475930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11758471_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}